The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Data Structures for Range Searching
Open accessAbstract
Much research has recently been devoted to "multikey" searching problems.In this paper the partmular multlkey problem of range searching Is investigated and a number of data structures that have been proposed as solutions to this problem are surveyed.The purposes of this paper are to bring together a collection of widely scattered results, to acquaint the reader with the structures currently avadable for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Self-citationAn Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Self-citationQuad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Self-citationA Nonparametric Estimate of a Multivariate Density Function
Loftsgaarden, D. O., & Quesenberry, C. P. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700079 · Cited by 781
Multidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
Self-citationMultidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
Self-citationAn Algorithm for Finding Nearest Neighbors
Friedman, J. H., Baskett, F., & Shustek, L. J. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224110 · Cited by 394
Self-citationDecomposable searching problems
Bentley, J. L. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90117-0 · Cited by 340
Self-citationMultidimensional Searching Problems
Dobkin, D., & Lipton, R. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205015 · Cited by 248
Partial-Match Retrieval Algorithms
Rivest, R. L. (1976) · SIAM Journal on Computing · doi:10.1137/0205003 · Cited by 244
Lee, D. T., & Wong, C. K. (1977) · Acta Informatica · doi:10.1007/bf00263763 · Cited by 220
Efficient worst-case data structures for range searching
Bentley, J. L., & Maurer, H. A. (1980) · Acta Informatica · doi:10.1007/bf00263991 · Cited by 179
Self-citationMulti-dimensional clustering for data base organizations
Liou, J. H., & Yao, S. B. (1977) · Information Systems · doi:10.1016/0306-4379(77)90007-2 · Cited by 78
Analysis of range searches in quad trees
Bently, J. L., & Stanat, D. F. (1975) · Information Processing Letters · doi:10.1016/0020-0190(75)90034-4 · Cited by 73
Application of Principal Component Analysis to Multikey Searching
Lee, R. C. T., Chin, Y. H., & Chang, S.-K. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.225946 · Cited by 57
Heuristics for partial-match retrieval data base design
Bentley, J. L., & Burkhard, W. A. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90027-2 · Cited by 19
Self-citationBalanced Forests of K-D* Trees as a Dynamic Data Structure.
Willard, D. E. (1978) · Defense Technical Information Center (DTIC) · Cited by 9
Cited by
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Kajiya, J. T. (1986) · ACM SIGGRAPH Computer Graphics · doi:10.1145/15886.15902 · Cited by 2,238
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,612
Metadata
- Authors
- Bentley, J. L., & Friedman, J. H.
- Venue
- ACM Computing Surveys
- Published
- 1979-12
- Volume
- 11
- Issue
- 4
- Pages
- 397-409
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2092276439
- Cited by
- 622
- References
- 18
- FWCI
- 12.25
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.