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
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
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
Zhang, Z., & Zha, H. (2004) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502419154 · Cited by 1,479
Tree visualization with tree-maps: 2-d space-filling approach
Shneiderman, B. (1992) · ACM Transactions on Graphics · doi:10.1145/102377.115768 · Cited by 1,328
(1993) · doi:10.5555/313559.313789 · Cited by 998
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
Robinson, J. T. (1981) · Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81 · doi:10.1145/582318.582321 · Cited by 888
Kajiya, J. T. (1986) · Proceedings of the 13th annual conference on Computer graphics and interactive techniques · doi:10.1145/15922.15902 · Cited by 848
Multidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
Self-citationColor image quantization for frame buffer display
Heckbert, P. (1982) · Proceedings of the 9th annual conference on Computer graphics and interactive techniques · doi:10.1145/800064.801294 · Cited by 656
Dynamic queries for visual information seeking
Shneiderman, B. (1994) · IEEE Software · doi:10.1109/52.329404 · Cited by 573
Color image quantization for frame buffer display
Heckbert, P. (1982) · ACM SIGGRAPH Computer Graphics · doi:10.1145/965145.801294 · Cited by 549
Cosmic-string evolution: A numerical simulation
Allen, B., & Shellard, E. P. S. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.119 · Cited by 486
He, D., Ai, B., Guan, K., Wang, L., Zhong, Z., & Kürner, T. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2865724 · Cited by 422
ASSERT: A Physician-in-the-Loop Content-Based Retrieval System for HRCT Image Databases
Shyu, C.-R., Brodley, C. E., Kak, A. C., Kosaka, A., Aisen, A. M., & Broderick, L. S. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0768 · Cited by 387
A ray tracing solution for diffuse interreflection
Ward, G. J., Rubinstein, F. M., & Clear, R. D. (2007) · ACM SIGGRAPH 2007 courses · doi:10.1145/1281500.1281626 · Cited by 373
Multivariate interpolation of large sets of scattered data
Renka, R. J. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/45054.45055 · Cited by 349
On the Recognition of Printed Characters of Any Font and Size
Kahan, S., Pavlidis, T., & Baird, H. S. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767901 · Cited by 339
An Interactive-Voting Based Map Matching Algorithm
Yuan, J., Zheng, Y., Zhang, C., Xie, X., & Sun, G.-Z. (2010) · 2010 Eleventh International Conference on Mobile Data Management · doi:10.1109/mdm.2010.14 · Cited by 318
Cultured differential evolution for constrained optimization
Landa Becerra, R., & Coello, C. A. C. (2006) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2005.09.006 · Cited by 316
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Lazy Learning · doi:10.1007/978-94-017-2053-3_2 · Cited by 308
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
Range queries in OLAP data cubes
Ho, C.-T., Agrawal, R., Megiddo, N., & Srikant, R. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253274 · Cited by 281
Direct Large-Scale N-Body Simulations of Planetesimal Dynamics
Richardson, D. (2000) · Icarus · doi:10.1006/icar.1999.6243 · Cited by 255
Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings
Ren, H., Hu, W., & Leskovec, J. (2020) · arXiv · doi:10.48550/arxiv.2002.05969 · Cited by 135
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.