Article

Free access

The K-D-B-tree: a search structure for large multidimensional dynamic indexes

Author:

John T. RobinsonAuthors Info & Claims

SIGMOD '81: Proceedings of the 1981 ACM SIGMOD international conference on Management of data

Pages 10 - 18

https://doi.org/10.1145/582318.582321

Published: 29 April 1981 Publication History

PDF eReader

Abstract

The problem of retrieving multikey records via range queries from a large, dynamic index is considered. By large it is meant that most of the index must be stored on secondary memory. By dynamic it is meant that insertions and deletions are intermixed with queries, so that the index cannot be built beforehand. A new data structure, the K-D-B-tree, is presented as a solution to this problem. K-D-B-trees combine properties of K-D-trees and B-trees. It is expected that the multidimensional search effieciency of balanced K-D-trees and the I/O efficiency of B-trees should both be approximated in the K-D-B-tree. Preliminary experimental results that tend to support this are reported.

References

[1]

{Bayer and McCreight 72} Bayer, R. and McCreight, E. Organization and maintenance of large ordered indexes. Acta Informatica 1, 3 (1972), 173--189.

Digital Library

Google Scholar

[2]

{Bentley 75} Bentley, J. L. Multidimensional binary search tress used for associative searching. Comm. ACM 18, 9 (1975), 509--517.

Digital Library

Google Scholar

[3]

{Bentley 79} Bentley, J. L. Multidimensional binary search trees in database applications. IEEE Trans. Software Eng. SE-5, 4 (1979), 333--340.

Digital Library

Google Scholar

[4]

{Bentley and Friedman 79} Bentley, J. L. and Friedman, J. H. Data structures for range searching. Computing Surverys 11, 4 (1979), 397--409.

Digital Library

Google Scholar

[5]

{Comer 79} Comer, D. The ubiquitous B-tree. Computing Surveys 11, 2 (1979), 121--138.

Digital Library

Google Scholar

Cited By

View all

Song BFang YGuan RZhu RPan XTian Y(2024)Hierarchical Indexing and Compression Method with AI-Enhanced Restoration for Scientific Data ServiceApplied Sciences10.3390/app1413552814:13(5528)Online publication date: 25-Jun-2024
https://doi.org/10.3390/app14135528
Li YWang HLiu X(2024)One Seed, Two Birds: A Unified Learned Structure for Exact and Approximate CountingProceedings of the ACM on Management of Data10.1145/36392702:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639270
Liu BZhang CXin Y(2023)GL-Tree: A Hierarchical Tree Structure for Efficient Retrieval of Massive Geographic LocationsSensors10.3390/s2304224523:4(2245)Online publication date: 16-Feb-2023
https://doi.org/10.3390/s23042245
Show More Cited By

The K-D-B-tree: a search structure for large multidimensional dynamic indexes

Recommendations

T-Tree or B-Tree: Main Memory Database Index Structure Revisited
ADC '00: Proceedings of the Australasian Database Conference

While the B-tree (or the B+-tree) is the most popular index structure in disk-based relational database systems, the T-tree has been widely accepted as a promising index structure for main memory databases where the entire database (or most of them) ...
The string B-tree: a new data structure for string search in external memory and its applications

We introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link between some traditional external-memory and string-matching data structures. In a short phrase, it is a combination of B-trees and Patricia tries for ...
Revisiting B-tree Compression: An Experimental Study
SIGMOD

B-trees are widely recognized as one of the most important index structures in database systems, providing efficient query processing capabilities. Over the past few decades, many techniques have been developed to enhance the efficiency of B-trees from ...

Comments

Information & Contributors

Information

Published In

SIGMOD '81: Proceedings of the 1981 ACM SIGMOD international conference on Management of data

April 1981

237 pages

ISBN:0897910400

DOI:10.1145/582318

Conference Chair:
Toby J. Teorey
University of Michigan
,
Program Chair:
Y. Edmund Lien
Bell Laboratories

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 April 1981

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

494
Total Citations
View Citations
5,298
Total Downloads

Downloads (Last 12 months)463
Downloads (Last 6 weeks)35

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Song BFang YGuan RZhu RPan XTian Y(2024)Hierarchical Indexing and Compression Method with AI-Enhanced Restoration for Scientific Data ServiceApplied Sciences10.3390/app1413552814:13(5528)Online publication date: 25-Jun-2024
https://doi.org/10.3390/app14135528
Li YWang HLiu X(2024)One Seed, Two Birds: A Unified Learned Structure for Exact and Approximate CountingProceedings of the ACM on Management of Data10.1145/36392702:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639270
Liu BZhang CXin Y(2023)GL-Tree: A Hierarchical Tree Structure for Efficient Retrieval of Massive Geographic LocationsSensors10.3390/s2304224523:4(2245)Online publication date: 16-Feb-2023
https://doi.org/10.3390/s23042245
Arslan SYazici A(2023)MM-FOOD: a high-dimensional index structure for efficiently querying content and concept of multimedia dataJournal of Intelligent & Fuzzy Systems10.3233/JIFS-22067344:1(251-282)Online publication date: 5-Jan-2023
https://doi.org/10.3233/JIFS-220673
Yousfi HMesmoudi AHadjali AMatallah HBenkabou S(2023)SRDF_QDAG: An efficient end-to-end RDF data management when graph exploration meets spatial processingComputer Science and Information Systems10.2298/CSIS230225046Y20:4(1311-1341)Online publication date: 2023
https://doi.org/10.2298/CSIS230225046Y
Carniel AAguiar C(2023)Spatial Index Structures for Modern Storage Devices: A SurveyIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.324220735:9(9578-9597)Online publication date: 1-Sep-2023
https://doi.org/10.1109/TKDE.2023.3242207
Zhang YPeng BDu YSu J(2023)GeoLake: Bringing Geospatial Support to LakehousesIEEE Access10.1109/ACCESS.2023.334395311(143037-143049)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3343953
Zhang JXu SZhao YSun JXu SZhang X(2023)Aerial orthoimage generation for UAV remote sensingInformation Fusion10.1016/j.inffus.2022.08.00789:C(91-120)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1016/j.inffus.2022.08.007
Moti MSimatis PPapadias D(2022)WaffleProceedings of the VLDB Endowment10.14778/3574245.357425316:4(670-683)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.14778/3574245.3574253
Reif MNeumann T(2022)A scalable and generic approach to range joinsProceedings of the VLDB Endowment10.14778/3551793.355184915:11(3018-3030)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551849
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.

Cited By

Recommendations

T-Tree or B-Tree: Main Memory Database Index Structure Revisited

The string B-tree: a new data structure for string search in external memory and its applications

Revisiting B-tree Compression: An Experimental Study