On the public citation graph

A robust and efficient spatial data structure

https://doi.org/10.1007/bf01178777
0 signed · 41 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-51295-0_140openalex-snapshot
Advances in the design of the BANG file
inferredcites →https://doi.org/10.1007/3-540-54029-6_156openalex-snapshot
The Interpolation-Based Bintree and its application to graphics
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.1007/bf01936137openalex-snapshot
Implementation of the grid file: Design concepts and experience
inferredcites →https://doi.org/10.1016/0020-0190(82)90027-8openalex-snapshot
Multidimensional tries used for associative searching
inferredcites →https://doi.org/10.1016/0020-0190(88)90058-0openalex-snapshot
Implicit data structures for linear hashing schemes
inferredcites →https://doi.org/10.1016/0020-0255(89)90014-5openalex-snapshot
Multidimensional quantile hashing is very efficient for nonuniform distributions
inferredcites →https://doi.org/10.1016/0167-9236(86)90059-xopenalex-snapshot
Some steps towards a DBMS based KBMS
inferredcites →https://doi.org/10.1016/0306-4379(82)90024-2openalex-snapshot
Multidimensional B-trees for associative searching in database systems
inferredcites →https://doi.org/10.1016/0306-4379(86)90031-1openalex-snapshot
Grid file concurrency
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50017-8openalex-snapshot
A Superjoin Algorithm for Deductive Databases
inferredcites →https://doi.org/10.1109/32.6139openalex-snapshot
PROBE spatial data modeling and query processing in an image database application
inferredcites →https://doi.org/10.1109/icde.1987.7272349openalex-snapshot
Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/325405.325408openalex-snapshot
The interpolation-based grid file
inferredcites →https://doi.org/10.1145/348.318586openalex-snapshot
The Grid File
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/38714.38743openalex-snapshot
The BANG file: A new kind of grid file
inferredcites →https://doi.org/10.1145/582318.582321openalex-snapshot
The K-D-B-tree
inferredcites →https://doi.org/10.1145/588011.588036openalex-snapshot
Index maintenance for non-uniform record distributions
inferredcites →https://doi.org/10.1145/588058.588070openalex-snapshot
Interpolation-based index maintenance
inferredcites →https://doi.org/10.1145/588058.588071openalex-snapshot
Storage mappings for multidimensional linear dynamic hashing
inferredcites →https://doi.org/10.1145/6012.6015openalex-snapshot
Balanced multidimensional extendible hash tree
inferredcites →https://doi.org/10.1145/99935.99949openalex-snapshot
The hB-tree: a multiattribute indexing method with good guaranteed performance

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-3-540-25840-7_13openalex-snapshot
G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networks
inferred← citeshttps://doi.org/10.1007/s10619-009-7045-8openalex-snapshot
Multi-dimensional data density estimation in P2P networks
inferred← citeshttps://doi.org/10.1016/0020-0255(94)90024-8openalex-snapshot
Management of concurrency in interpolation based grid file organization and its performance
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00187-1openalex-snapshot
The average height of a node in the BANG abstract directory tree
inferred← citeshttps://doi.org/10.1109/adc.2000.819818openalex-snapshot
Efficient range query retrieval for non-uniform data distributions
inferred← citeshttps://doi.org/10.1109/p2p.2006.48openalex-snapshot
W-Grid: a Cross-Layer Infrastructure for Multi-Dimensional Indexing, Querying and Routing in Wireless Ad-Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1109/perser.2006.1652232openalex-snapshot
Routing and Localization Services in Self-Organizing Wireless Ad-Hoc and Sensor Networks Using Virtual Coordinates
inferred← citeshttps://doi.org/10.1109/spdp.1996.570358openalex-snapshot
Parallelizing multidimensional index structures
inferred← citeshttps://doi.org/10.1109/tkde.2002.1019219openalex-snapshot
A stochastic programming approach for range query retrieval problems
inferred← citeshttps://doi.org/10.1109/tkde.2004.1318567openalex-snapshot
Efficient, Self-Contained Handling of Identity in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1145/1042046.1042052openalex-snapshot
Decoupling partitioning and grouping
inferred← citeshttps://doi.org/10.1145/1065870.1065875openalex-snapshot
Tolerance of localization imprecision in efficiently managing mobile sensor databases
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/502807.502809openalex-snapshot
Searching in high-dimensional spaces
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/928openalex-snapshot
Management and routing algorithms for ad-hoc and sensor networks
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.