On the public citation graph
Historical queries along multiple lines of time evolution
0 signed · 43 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-53507-1_75openalex-snapshot
Efficient algorithms for managing the history of evolving databases
inferredcites →https://doi.org/10.1007/3-540-56869-7_8openalex-snapshot
On optimal multiversion access structures
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferredcites →https://doi.org/10.1016/0306-4379(95)00011-ropenalex-snapshot
The Snapshot Index: An I/O-Optimal access method for timeslice queries
inferredcites →https://doi.org/10.1109/69.109107openalex-snapshot
Incremental implementation model for relational databases with transaction time
inferredcites →https://doi.org/10.1109/69.224200openalex-snapshot
Efficient indexing methods for temporal relations
inferredcites →https://doi.org/10.1109/69.404032openalex-snapshot
Efficient management of time-evolving databases
inferredcites →https://doi.org/10.1109/icde.1989.47208openalex-snapshot
Indexing techniques for historical databases
inferredcites →https://doi.org/10.1109/icde.1992.213174openalex-snapshot
Optimal versioning of objects
inferredcites →https://doi.org/10.1109/jcit.1990.128320openalex-snapshot
Overlapping B+trees for temporal data
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/16856.16864openalex-snapshot
Performance evaluation of a temporal database management system
inferredcites →https://doi.org/10.1145/16894.16864openalex-snapshot
Performance evaluation of a temporal database management system
inferredcites →https://doi.org/10.1145/28395.28434openalex-snapshot
Two algorithms for maintaining order in a list
inferredcites →https://doi.org/10.1145/602259.602276openalex-snapshot
Designing DBMS support for the temporal dimension
inferredcites →https://doi.org/10.1145/66926.66956openalex-snapshot
Access methods for multiversion data
inferredcites →https://doi.org/10.1145/67544.66956openalex-snapshot
Access methods for multiversion data
inferredcites →https://doi.org/10.1145/93597.98744openalex-snapshot
The performance of a multiversion access method
inferredcites →https://doi.org/10.1145/98163.98172openalex-snapshot
Toward a unified framework for version modeling in engineering databases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4471-3033-8_13openalex-snapshot
Access Methods for Bi-Temporal Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_3openalex-snapshot
The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-32600-4_20openalex-snapshot
Querying Transaction–Time Databases under Branched Schema Evolution
inferred← citeshttps://doi.org/10.1007/s00778-019-00594-5openalex-snapshot
$$\varvec{\textsc {Orpheus}}$$DB: bolt-on versioning for relational databases (extended version)
inferred← citeshttps://doi.org/10.1007/s11786-008-0049-3openalex-snapshot
Querying Historical Data Over Multiple Time-Lines
inferred← citeshttps://doi.org/10.1016/0306-4379(95)00011-ropenalex-snapshot
The Snapshot Index: An I/O-Optimal access method for timeslice queries
inferred← citeshttps://doi.org/10.1109/69.667079openalex-snapshot
Designing access methods for bitemporal databases
inferred← citeshttps://doi.org/10.1109/ride.2004.1281713openalex-snapshot
Supporting branched versions on XML documents
inferred← citeshttps://doi.org/10.1109/time.1999.777977openalex-snapshot
A temporal relational algebra based on multiple time-lines
inferred← citeshttps://doi.org/10.1109/tkde.2002.1019221openalex-snapshot
Hashing methods for temporal data
inferred← citeshttps://doi.org/10.1145/1125274.1125277openalex-snapshot
Supporting complex queries on multiversion XML documents
inferred← citeshttps://doi.org/10.1145/319806.319816openalex-snapshot
Comparison of access methods for time-evolving data
inferred← citeshttps://doi.org/10.48550/arxiv.1205.6699openalex-snapshot
Minuet: A Scalable Distributed Multiversion B-Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02475openalex-snapshot
OrpheusDB: Bolt-on Versioning for Relational Databases
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.