article

Free access

Data Structures for Range Searching

Authors:

Jon Louis Bentley,

Jerome H. FriedmanAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 11, Issue 4

Pages 397 - 409

https://doi.org/10.1145/356789.356797

Published: 01 December 1979 Publication History

PDF eReader

References

[1]

BENTLEY, J. L. "Multidimensional binary search trees used for assocmtive seaxchmg," Comm ACM 18, 9 (Sept. 1975), 509-517

Crossref

Google Scholar

[2]

BENTLEY, J. L., AND STANAT, D F. "Analysis of range searches m quad trees," Inf Process Lett 3, 6 (July 1975), 170-173

Google Scholar

[3]

BENTLEY, J L, AND BURKHARD, W A. "HeurLstms for partial match retrieval data base design," Inf Process. Lett 4, 5 (Feb 1976), 132-135.1

Google Scholar

[4]

BENTLEY, J L., STANAT, D. F., AND WIL- LIAMS, E. H JR "The complexity of fixed-radius near neighbor searching," Inf Process. Lett. 6, 6 (Dec. 1977), 209-212.

Google Scholar

[5]

BENTLEY, J L., AND FRIEDMAN, J H. A survey of algortthms and data structures for range searching, Carnegie-Mellon Computer Science Rep CMU-CS-78-136 and Stanford hnear Accelerator Center Rep SLAC-PUB-2189, prehmlnary version in Proc. Computer Science and Statistics: 1 lth Ann. Symp. on the Interface, March 1978, pp. 297-307.

Google Scholar

[6]

BENTLEY, J.L. "Decomposable searching problems," Inf. Process. Lett. 8, 5 (June 1979), 133--136.

Google Scholar

[7]

BENTLEY, J. L. "Multidimensional binary search trees in database applications," IEEE Trans Soflw. Eng SE-5, 4 (July 1979), 333-340.

Google Scholar

[8]

BENTLEY, J. L "Multidimensional divide-and-conquer," to appear m Comm. ACM.

Crossref

Google Scholar

[9]

BENTLEY, J. L, AND MAURER, H. A. "Efficient worst-case data structures for range searching," to appear m Acta Inf.

Google Scholar

[10]

DOBKIN, D, AND LIPTON, R. J "Multdimensional searching problems," SIAM J. Comput. 5, 2 (1976), 181-186.

Google Scholar

[11]

FINKEL, R. A, AND BENTLEY, J. L. "Quad trees--a data structure for retrieval on composite keys," Acta Inf 4, 1 (1974), 1-9.

Google Scholar

[12]

FREDMAN, M. "A near optimal data structure for a type of range query problem," in Proc. 11 th A CM Syrup. Theory of Computing, May 1979, pp. 62-66.

Crossref

Google Scholar

[13]

FRIEDMAN, J H., BASKETT, F., AND SHUS- TEK, L. J "An algorithm for finding nearest neighbors," IEEE Trans Cornput. C-24, 10 (Oct. 1975), 1000-1006.

Google Scholar

[14]

FRIEDMAN, J H., BENTLEY, j L., AND FINKEL, R.A. "An algorithm for finding best matches m logarlthmlc expected tlme," A CM Trans. Math. Softw. 3, 3 {Sept. 1977), 209-226.

Crossref

Google Scholar

[15]

GOTLIEB, C. C., AND GOTLIEB, L. R Data types and structures, Prentice-Hall, Englewood Cliffs, N.J, pp. 357-363

Crossref

Google Scholar

[16]

KNUTH, D.E. The art of computer programming, vol. 3" sorting and searching, Addison-Wesley, Reading, Mass., 1973.

Crossref

Google Scholar

[17]

LAUTHER, U. "4-dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits," J Des. Autom Fault-Tolerant Comput. 2, 3 (July 1978), 241-247.

Google Scholar

[18]

LEE, R. C. T., CHIN, Y. H, AND CHANG, S.C. "Application of principal component analysm to multi-key searching," IEEE Trans. Soflw. Eng. SE-2, 3 (Sept 1976), 185-193.

Google Scholar

[19]

LEE, D. T, AND WONG, C K. "Worstcase analysis for region and partml region searches In multidlmensmnal binary search trees and quad trees," A cta Inf 9, 1 (1978), 23-29.

Google Scholar

[20]

LEE, D. T., AND WONG, C.K. "Qulntary trees' a i'de structure for multidimensmnal database systems," to appear m A CM Trans. Database Syst

Crossref

Google Scholar

[21]

LEVINTHAL, C. "Molecular model-budding by computer," Sct Am 214 (June 1966), ~2-52.

Google Scholar

[22]

LINN, J. General methods for parallel searching, Tech Rep. 61, Digital Systems Lab, Stanford U., Stanford, Cahf, May 1973.

Google Scholar

[23]

Lmu, J H., AND YAO, S B "Multi-dimensional clustering for data base organization," Inf Syst. 2 (1977), 187-{98.

Google Scholar

[24]

LOFTSGAARDEN, D. O, AND QUESEN- BERRY, C.P. "A nonparametric density function," Ann. Math. Star. 36 (1965), 1049-1051

Google Scholar

[25]

LUEKER, G. "A data structure for orthogonal range queries," m Proc 19th Syrup Foundattons of Computer Scwnce, IEEE, Oct. 1978, pp. 28-34

Google Scholar

[26]

LUEKER, G. "A transformation for addmg range restractlon capability to dynamtc data structures for decomposable searchmg problems," Tech. Rep. 129, U of Califorma at irvine, 1979.

Google Scholar

[27]

RABIN, M O "Probabdmtm algorithms," m Agortthms and complexity. new dwectlons and recent results, J. F Traub (Ed.), Academm Press, New York, 1976, pp. 21-39.

Google Scholar

[28]

RIVEST, R L. "Parhal match retrieval algorithms," SIAM J Comput. 5, 1 (March 1976), 19-50

Google Scholar

[29]

SAXE, J. B "On the number of range queries m k-space," to appear m Dtscrete Appl Math

Google Scholar

[30]

SHNEIDERMAN, B. "Reduced combined indexes for efficient multiple attribute retrieval," Inf. Syst. 2 (1977), 149-154.

Google Scholar

[31]

SILVA-FILHO, Y.V. Average case analysts of regton search m balanced k-d trees, Rep., U. of Kent, Canterbury, England, Nov. 1978.

Google Scholar

[32]

S/LVA-FILHO, Y V. Multtdimenstonal search trees as radices of fdes, Rep., U of Kent, Canterbury, England, Dec 1978.

Google Scholar

[33]

WILLARO, D. E. Predicate-oriented database search algorithms, Rep. TR-20- 78, Harvard U. Aiken Lab., 1978.

Google Scholar

[34]

WILLARt), D. E. "Balanced forests of k-d* trees as a dynamic data structure," mformative abstract, Harvard U., Boston, Mass, 1978.

Google Scholar

[35]

YANG, C. "Avoiding redundant record accesses in unsorted multilist t'de orgamzations," inf Syst. 2 (1977), 155-158.

Google Scholar

[36]

YANG, C. "A class of hybrid list file orgamzations," Inf. Syst. 3 (1978), 49-58.

Google Scholar

[37]

YUVAL, G. "Finding near neighbors m k-dimensional space," Inf. Process. Lett. 3, 4 (March 1975), 113-114

Google Scholar

Cited By

View all

Liu ZDeep SFariha APsallidas FTiwari AFloratou A(2024)Rapidash: Efficient Detection of Constraint ViolationsProceedings of the VLDB Endowment10.14778/3659437.365945417:8(2009-2021)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659454
Li MWang HDai HLi MChai CGu RChen FChen ZLi SLiu QChen G(2024)A Survey of Multi-Dimensional Indexes: Past and Future TrendsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.336418336:8(3635-3655)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3364183
Tsitsigkos DBouros PLampropoulos KMamoulis NTerrovitis M(2024)Two-Layer Space-Oriented Partitioning for Non-Point DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.329797536:3(1341-1355)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TKDE.2023.3297975
Show More Cited By

Recommendations

Efficient worst-case data structures for range searching
Abstract
In this paper we investigate the worst-case complexity of range searching: preprocess N points in k-space such that range queries can be answered quickly. A range query asks for all points with each coordinate in some range of values, and arises ...
New data structures for orthogonal range searching
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in R/sup 3/, we achieve query time O(log n+k) using space O(n log/sup 1+/spl epsiv// n), where n ...
Tradeoffs in Approximate Range Searching Made Simpler
SIBGRAPI '08: Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing

Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in R^d into a data structure, so that it is possible to determine the subset of points lying within a given query range. In ...

Comments

Information & Contributors

Information

Published In

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1979

Published in CSUR Volume 11, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

462
Total Citations
View Citations
5,852
Total Downloads

Downloads (Last 12 months)606
Downloads (Last 6 weeks)36

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu ZDeep SFariha APsallidas FTiwari AFloratou A(2024)Rapidash: Efficient Detection of Constraint ViolationsProceedings of the VLDB Endowment10.14778/3659437.365945417:8(2009-2021)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659454
Li MWang HDai HLi MChai CGu RChen FChen ZLi SLiu QChen G(2024)A Survey of Multi-Dimensional Indexes: Past and Future TrendsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.336418336:8(3635-3655)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3364183
Tsitsigkos DBouros PLampropoulos KMamoulis NTerrovitis M(2024)Two-Layer Space-Oriented Partitioning for Non-Point DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.329797536:3(1341-1355)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TKDE.2023.3297975
Mukherjee JDasgupta KBanerjee SBiswas M(2024)Efficient Partitioning of a Multi-dimensional Axis-Aligned Space into Uniform Non-overlapping Sub-spaces for Diverse ApplicationsRecent Trends in Intelligence Enabled Research10.1007/978-981-97-2321-8_16(181-194)Online publication date: 16-May-2024
https://doi.org/10.1007/978-981-97-2321-8_16
Mistry AZhang XRay SSeahra S(2024)SCORE: Scalable Contact Tracing over Uncertain TrajectoriesMobile and Ubiquitous Systems: Computing, Networking and Services10.1007/978-3-031-63989-0_4(68-93)Online publication date: 19-Jul-2024
https://doi.org/10.1007/978-3-031-63989-0_4
Chaudhry NYousaf M(2024)Exploiting hashing for concurrent query processing and indexing of current location of moving objectsConcurrency and Computation: Practice and Experience10.1002/cpe.801336:11Online publication date: 3-Jan-2024
https://doi.org/10.1002/cpe.8013
ZHDANOV DLYSYKH AKHALIMOV RKINEV IZHDANOV A(2023)USING MULTILEVEL HASH TABLES TO SPEED UP RENDERINGПрограммирование10.31857/S013234742303007X(37-48)Online publication date: 1-May-2023
https://doi.org/10.31857/S013234742303007X
McKee PDerksen HChristian J(2023)View Invariants for Three-Dimensional Points with Constrained Observer MotionJournal of Guidance, Control, and Dynamics10.2514/1.G00679346:2(277-285)Online publication date: Feb-2023
https://doi.org/10.2514/1.G006793
Ward GRubinstein FClear R(2023)A Ray Tracing Solution for Diffuse InterreflectionSeminal Graphics Papers: Pushing the Boundaries, Volume 210.1145/3596711.3596741(261-268)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1145/3596711.3596741
Gu YMen ZShen ZSun YWan ZAgrawal KShun J(2023)Parallel Longest Increasing Subsequence and van Emde Boas TreesProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591069(327-340)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591069
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Efficient worst-case data structures for range searching

New data structures for orthogonal range searching

Tradeoffs in Approximate Range Searching Made Simpler

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations