On the public citation graph

An empirical performance comparison of some variations of thek-d Tree andBD tree

https://doi.org/10.1007/bf00991003
0 signed · 37 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/bf00263763openalex-snapshot
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
inferredcites →https://doi.org/10.1007/bf00263991openalex-snapshot
Efficient worst-case data structures for range searching
inferredcites →https://doi.org/10.1016/0020-0190(76)90027-2openalex-snapshot
Heuristics for partial-match retrieval data base design
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(82)90119-3openalex-snapshot
A data structure for dynamic range queries
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1137/0205003openalex-snapshot
Partial-Match Retrieval Algorithms
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1145/320613.320618openalex-snapshot
Quintary trees
inferredcites →https://doi.org/10.1145/322276.322281openalex-snapshot
A Lower Bound on the Complexity of Orthogonal Range Queries
inferredcites →https://doi.org/10.1145/348.318586openalex-snapshot
The Grid File
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/356770.356776openalex-snapshot
Ubiquitous B-Tree
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/602259.602284openalex-snapshot
Performance comparison of index structures for multi-key retrieval
inferredcites →https://doi.org/10.1184/r1/6591230openalex-snapshot
A Problem in Multivariate Statistics: Algorithm, Data Structure, and Applications
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380161203openalex-snapshot
Algorithms for BD trees
inferred← citeshttps://doi.org/10.1002/spe.4380180110openalex-snapshot
Performance analysis of partial‐match search algorithms for BD trees
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_9openalex-snapshot
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_2openalex-snapshot
A Simple, Compact and Dynamic Partition Scheme Based on Co-centric Spheres
inferred← citeshttps://doi.org/10.1007/3-540-44803-9_23openalex-snapshot
The Arc-Tree: A Novel Symmetric Access Method for Multidimensional Data
inferred← citeshttps://doi.org/10.1007/3-540-48252-0_11openalex-snapshot
The Gr_Tree: The Use of Active Regions in G-Trees
inferred← citeshttps://doi.org/10.1007/3-540-58435-8_171openalex-snapshot
A study of spatial clustering techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-27308-7_66openalex-snapshot
Classification of Text Documents Using B-Tree
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-981-10-7512-4_88openalex-snapshot
Indexing-Based Classification: An Approach Toward Classifying Text Documents
inferred← citeshttps://doi.org/10.1016/0306-4573(89)90089-7openalex-snapshot
Handling incrementally specified boolean queries: A comparison of inverted and signature file organizations
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.1080/136588198241897openalex-snapshot
Mean-variance analysis of the performance of spatial ordering methods
inferred← citeshttps://doi.org/10.1090/dimacs/059/10openalex-snapshot
Towards a discipline of experimental algorithmics
inferred← citeshttps://doi.org/10.1109/69.277778openalex-snapshot
G-tree: a new data structure for organizing multidimensional data
inferred← citeshttps://doi.org/10.1186/1471-2105-15-s16-s5openalex-snapshot
Combining spatial and chemical information for clustering pharmacophores
inferred← citeshttps://doi.org/10.3217/jucs-007-05-0434openalex-snapshot
Algorithms and Experiments: The New (and Old) Methodology
inferred← citeshttps://doi.org/10.5121/ijdkp.2012.2104openalex-snapshot
Text Document Classification: An Approach Based on Indexing
inferred← citeshttps://doi.org/10.7155/jgaa.00024openalex-snapshot
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
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.