On the public citation graph

MultidimensionalB-trees: Analysis of dynamic behavior

https://doi.org/10.1007/bf01932838
0 signed · 34 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/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1016/0306-4379(77)90003-5openalex-snapshot
Reduced combined indexes for efficient multiple attribute retrieval
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.1093/comjnl/20.1.15openalex-snapshot
Doubly-chained tree data base organisation--analysis and design strategies
inferredcites →https://doi.org/10.1109/cmpsac.1979.762462openalex-snapshot
Extended K-D tree database organization: a dynamic multi-attribute clustering method
inferredcites →https://doi.org/10.1109/tse.1977.231175openalex-snapshot
Analysis of the Multiple-Attribute-Tree Data-Base Organization
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1145/1282480.1282542openalex-snapshot
Binary search tree complex
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/320128.320135openalex-snapshot
Performance evaluation of attribute-based tree organization
inferredcites →https://doi.org/10.1145/320455.320457openalex-snapshot
System R
inferredcites →https://doi.org/10.1145/320613.320618openalex-snapshot
Quintary trees
inferredcites →https://doi.org/10.1145/356770.356776openalex-snapshot
Ubiquitous B-Tree
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/362248.362267openalex-snapshot
Optimum data base reorganization points
inferredcites →https://doi.org/10.1145/362342.362352openalex-snapshot
Evaluation and selection of file organization—a model and system
inferredcites →https://doi.org/10.1145/362790.362794openalex-snapshot
Multi-attribute retrieval with combined indexes
inferredcites →https://doi.org/10.1145/582095.582102openalex-snapshot
Compact B-trees
inferredcites →https://doi.org/10.1145/582250.582281openalex-snapshot
Experiments with B-tree reorganization
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.1007/978-1-4613-1881-1_24openalex-snapshot
Multidimensional Clustering Techniques for Large Relational Database Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-72617-0_17openalex-snapshot
Spatial kd-Tree: A Data Structure for Geographic Database
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_8openalex-snapshot
Trees for Multilevel Memory
inferred← citeshttps://doi.org/10.1007/bf01188717openalex-snapshot
External segment trees
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90069-2openalex-snapshot
An average-case analysis of MAT and inverted file
inferred← citeshttps://doi.org/10.1016/0306-4379(82)90024-2openalex-snapshot
Multidimensional B-trees for associative searching in database systems
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1016/s0950-5849(97)00035-9openalex-snapshot
Linearity in directory growth of the multilevel grid file
inferred← citeshttps://doi.org/10.1109/tse.1985.232197openalex-snapshot
On the File Design Problem for Partial Match Retrieval
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/318898.318928openalex-snapshot
Algorithm and performance evaluation of adaptive multidimensional clustering technique
inferred← citeshttps://doi.org/10.1145/325405.325408openalex-snapshot
The interpolation-based grid file
inferred← citeshttps://doi.org/10.1145/588058.588071openalex-snapshot
Storage mappings for multidimensional linear dynamic hashing
inferred← citeshttps://doi.org/10.1145/971699.318928openalex-snapshot
Algorithm and performance evaluation of adaptive multidimensional clustering technique
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.