On the public citation graph
Performance of on-line index construction algorithms
0 signed · 49 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01840448openalex-snapshot
On-the-fly, incremental, consistent reading of entire databases
inferredcites →https://doi.org/10.1007/bfb0032438openalex-snapshot
Performance of on-line index construction algorithms
inferredcites →https://doi.org/10.1109/dpds.1988.675013openalex-snapshot
Performance Evaluation of Global Reading of Entire Databases
inferredcites →https://doi.org/10.1145/115790.115860openalex-snapshot
Performance of B-tree concurrency control algorithms
inferredcites →https://doi.org/10.1145/130283.130337openalex-snapshot
Algorithms for creating indexes for very large tables without quiescing updates
inferredcites →https://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferredcites →https://doi.org/10.5555/62597.62616openalex-snapshot
Performance evaluation of global reading of entire databases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.20288openalex-snapshot
Dependable configurations and recovery for the Fat-Btree parallel directory structure
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_21openalex-snapshot
Group Updates for Bed-Black Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_10openalex-snapshot
Bulk Operations on B-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_11openalex-snapshot
Online Index Construction and Maintenance
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_12openalex-snapshot
Concurrency Control by Versioning
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_13openalex-snapshot
Distributed Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_14openalex-snapshot
Transactions in Page-Server Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_15openalex-snapshot
Processing of Write-Intensive Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_2openalex-snapshot
Operations on the Physical Database
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_4openalex-snapshot
Transaction Rollback and Restart Recovery
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_6openalex-snapshot
Lock-Based Concurrency Control
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_8openalex-snapshot
B-Tree Structure Modifications
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_9openalex-snapshot
Advanced Locking Protocols
inferred← citeshttps://doi.org/10.1007/s00778-013-0345-7openalex-snapshot
Transactional support for adaptive indexing
inferred← citeshttps://doi.org/10.1109/69.553166openalex-snapshot
Concurrency control in B-trees with batch updates
inferred← citeshttps://doi.org/10.1109/icde.2001.914827openalex-snapshot
Efficient bulk deletes in relational databases
inferred← citeshttps://doi.org/10.1109/icpads.2000.857715openalex-snapshot
Improving performance of parallel transaction processing systems by balancing data load on line
inferred← citeshttps://doi.org/10.1109/ideas.2000.880589openalex-snapshot
Concurrency control for B-trees with differential indices
inferred← citeshttps://doi.org/10.1109/prdc.2004.1276567openalex-snapshot
Availabilities and costs of reliable fat-Btrees
inferred← citeshttps://doi.org/10.1145/130283.130334openalex-snapshot
Compensation-based on-line query processing
inferred← citeshttps://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferred← citeshttps://doi.org/10.1145/1541880.1541881openalex-snapshot
Online reorganization of databases
inferred← citeshttps://doi.org/10.1145/233269.233325openalex-snapshot
On-line reorganization of sparsely-populated B+-trees
inferred← citeshttps://doi.org/10.1145/235968.233325openalex-snapshot
On-line reorganization of sparsely-populated B+-trees
inferred← citeshttps://doi.org/10.1145/303976.304011openalex-snapshot
Group updates for relaxed height-balanced trees
inferred← citeshttps://doi.org/10.1145/335191.335381openalex-snapshot
On-line reorganization in object databases
inferred← citeshttps://doi.org/10.1147/sj.363.0411openalex-snapshot
A method for on-line reorganization of a database
inferred← citeshttps://doi.org/10.14778/3137765.3137779openalex-snapshot
Resumable online index rebuild in SQL server
inferred← citeshttps://doi.org/10.14778/3303753.3303759openalex-snapshot
Efficient data ingestion and query processing for LSM-based storage systems
showing the first 35 of 36 · page through all 36
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.