On the public citation graph
Interpolation-based index maintenance
0 signed · 42 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-10885-8_45openalex-snapshot
The grid file: An adaptable, symmetric multi-key file structure
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1109/dac.1982.1585522openalex-snapshot
The EXCELL Method for Efficient Geometric Access to Data
inferredcites →https://doi.org/10.1145/321541.321546openalex-snapshot
File Organization: On the Selection of Random Access Index Points for Sequential Files
inferredcites →https://doi.org/10.1145/322248.322254openalex-snapshot
Expected Length of the Longest Probe Sequence in Hash Code Searching
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/588011.588037openalex-snapshot
A class of data structures for associative searching
inferredcites →https://doi.org/10.5555/800263.809228openalex-snapshot
The EXCELL Method for Efficient Geometric Access to Data
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_87openalex-snapshot
Grid file algorithms: An analysis in the biased case
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_38openalex-snapshot
Multidimensional order preserving linear hashing with partial expansions
inferred← citeshttps://doi.org/10.1007/3-540-52208-5_23openalex-snapshot
Performance comparison of point and spatial access methods
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_44openalex-snapshot
Data Organization Method for the Parallel Execution of Relational Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-71071-1_11openalex-snapshot
Bibliography on quadtrees and related hierarchical data structures
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_42openalex-snapshot
Hintergrundspeicherstrukturen für ausgedehnte Objekte
inferred← citeshttps://doi.org/10.1007/978-3-642-73608-7_2openalex-snapshot
Spatial Access Methods based on Dynamic Hashing
inferred← citeshttps://doi.org/10.1007/bf01936137openalex-snapshot
Implementation of the grid file: Design concepts and experience
inferred← citeshttps://doi.org/10.1007/bf01990535openalex-snapshot
Optimal dynamic multi-attribute hashing for range queries
inferred← citeshttps://doi.org/10.1016/0020-0255(89)90014-5openalex-snapshot
Multidimensional quantile hashing is very efficient for nonuniform distributions
inferred← citeshttps://doi.org/10.1016/0169-023x(90)90001-topenalex-snapshot
Heuristics and multi-dimensional physical database design: An experimental KBS
inferred← citeshttps://doi.org/10.1016/j.infsof.2004.04.001openalex-snapshot
Scalable distributed compact trie hashing (CTH*)
inferred← citeshttps://doi.org/10.1016/j.patcog.2007.09.012openalex-snapshot
Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree
inferred← citeshttps://doi.org/10.1109/69.124898openalex-snapshot
New order preserving access methods for very large files derived from linear hashing
inferred← citeshttps://doi.org/10.1109/69.277778openalex-snapshot
G-tree: a new data structure for organizing multidimensional data
inferred← citeshttps://doi.org/10.1109/icde.1988.105496openalex-snapshot
Spatial searching in geometric databases
inferred← citeshttps://doi.org/10.1109/icde.1989.47230openalex-snapshot
Key-sequential access methods for very large files derived from linear hashing
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346783openalex-snapshot
A linear hashing enabling efficient retrieval for range queries
inferred← citeshttps://doi.org/10.1109/icsmc.2010.5641860openalex-snapshot
A distributed linear hashing enabling efficient retrieval for range queries
inferred← citeshttps://doi.org/10.1145/12047.12048openalex-snapshot
Associative searching in multiple storage units
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/3468081.3471125openalex-snapshot
Redundancy of Routing Information on the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method
inferred← citeshttps://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferred← citeshttps://doi.org/10.1145/588011.588036openalex-snapshot
Index maintenance for non-uniform record distributions
inferred← citeshttps://doi.org/10.1145/6012.6014openalex-snapshot
Order preserving linear hashing using dynamic key statistics
inferred← citeshttps://doi.org/10.1145/602274.602275openalex-snapshot
A multikey hashing scheme using predicate trees
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.