article

Free access

Ubiquitous B-Tree

Author:

Douglas ComerAuthors Info & Claims

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

Pages 121 - 137

https://doi.org/10.1145/356770.356776

Published: 01 June 1979 Publication History

PDF eReader

References

[1]

AHO, A., HOPCROFT, J., AND ULLMAN, j. The design and analysts of computer algorithms, Addison Wesley, Publ. Co., Reading, Mass., 1974.

Crossref

Google Scholar

[2]

AuER, R. Schlusselkompress~onen ~n B*-baumen, Diplomarbeit, Tech. Umversitat, Munich, 1976.

Google Scholar

[3]

BAYER, R, AND MCCREmHT, C "Organization and maintenance of large ordered indexes," Acta inf. 1, 3 (1972), 173- 189.

Digital Library

Google Scholar

[4]

BAYER, R. "Binary B-trees for virtual memory," in Proc 1971 ACM SIGFIDET Workshop, ACM, New York, 219-235.

Google Scholar

[5]

BAYER, R. "Symmetric binary B-trees. data structure and maintenance algorithms," Acta Inf. 1, 4 (1972), 290-306

Digital Library

Google Scholar

[6]

BAYER, R., AND METZGER, J. "On encipherment of search trees and random access files," A CM Trans. Database Syst. 1, 1 (March 1976), 37-52.

Crossref

Google Scholar

[7]

BAYER, R, AND UNTERAUER, K. "PrefLx B-trees," A CM Trans. Database Syst. 2, 1 (March 1977), 11-26.

Crossref

Google Scholar

[8]

BAYER, R., AND SCHKOLNICK, M. "Concurrency of operations on B-trees," Acta Inf. 9, 1 (1977), 1-21.

Digital Library

Google Scholar

[9]

BERLINER, H. The B*-tree search algorithm: a best-fwst proof procedure, Tech. Rep. CMU-CA-78-112, Computer Scmnce Dept, Carnegie-Mellon Univ., Pittsburgh, 1978.

Google Scholar

[10]

BROWN, M "A storage scheme for height-balanced trees," Inf. Process. Lett. 7, 5 (Aug. 1978), 231-232.

Crossref

Google Scholar

[11]

BROWN, M. "A partial analysis of height-balanced trees," SIAM J. Comput., to appear.

Google Scholar

[12]

CLAMPETT, H. "Randomized binary searching with tree structures," Commun. ACM 7, 3 (March 1964), 163-165.

Digital Library

Google Scholar

[13]

FOSTER, C. "Information storage and retrieval using AVL trees," m Proc. A CM 20th Natmnal Conf., ACM, New York, 1965, 192-205.

Crossref

Google Scholar

[14]

GHOSH, S, AND SENKO, M. "File organization: on the selection of random access index points for sequential files," J ACM 16, 4 (Oct. 1969), 569-579.

Digital Library

Google Scholar

[15]

GUIBUS, L., MCCREIGHT, E., PLASS, M., AND ROBERTS, J. "A new representation for linear lists," m Proc. 9th A CM Symp. Theory of Computing, ACM, New York, 1977, 49-60.

Crossref

Google Scholar

[16]

GUIBAS, L., AND SEDGEWICK, R. "A dichromatic framework for balanced trees," m Proc 19th Syrup. Foundatmns of Computer Science, 1978, 8-21.

Google Scholar

[17]

HELD, G., AND STONEBRAKER, M. "B- trees reexamined," Commun. A CM 21, 2 (Feb. 1978), 139-143.

Crossref

Google Scholar

[18]

HOROWITZ, E., AND SAHNI, S. Fundamentals of data structures, Computer Science Press, Inc., Woodland Hills, Calif., 1976.

Google Scholar

[19]

OS/VS Virtual Storage Access Method (VSAM) planning gutde, Order No. GC26-3799, IBM, Armonk, N.Y.

Google Scholar

[20]

OS/VS Vwtual Storage Access Method (VSAM) logw, Order No. SY26-3841, IBM, Armonk, N.Y.

Google Scholar

[21]

KARLTON, P., FULLER, S., SCROGGS, R., AND KACHLER, E. "Performance of height balanced trees," Commun. A CM 19, 1 (Jan. 1976), 23-28.

Crossref

Google Scholar

[22]

KEEHN, D., AND LACY, J. "VSAM data set design parameters," IBM Syst. J. 3, (1974), 186-212.

Digital Library

Google Scholar

[23]

KNUTH, D. The art of computer programmmg, Vol. 1. fundamental algorithms, Addison-Wesley Publ. Co., Reading, Mass, 1968.

Crossref

Google Scholar

[24]

Kr~UTH, D. The art of computer programmmg, Vol. 3: sorting and searching, Addison-Wesley Publ. Co, Reading, Mass., 1973.

Crossref

Google Scholar

[25]

MARUYAMA, K, AND SMITH, S. "Analysis of design alternatives for virtual memory indexes," Commun. A CM 20, 4 (April 1977), 245-254.

Crossref

Google Scholar

[26]

MAUER, W., AND LEWIS, T. "Hash table methods," Comput. Surv. 7, 1 (March 1975), 5-19.

Crossref

Google Scholar

[27]

MCCREIGHT, E. "Pagination of B*-trees with variable-length records," Commun. ACM 20, 9 (Sept. 1977), 670-674

Digital Library

Google Scholar

[28]

MILLER, R., PIPPENGER, N., ROSENBERG, A., AND SNYDER, L. Optimal 2-3 trees, IBM Research Rep. RC 6505, IBM Research Lab, Yorktown Heights, N.Y., 1977.

Google Scholar

[29]

NIEVERGELT, J. "Binary search trees and file orgamzatmn," Comput. Surv. 6, 3 (Sept. 1973), 195-207.

Crossref

Google Scholar

[30]

ORGANICK, E. The Multics system: an exammatmn of tts structure, MIT Press, Cambridge, Mass., 1972.

Crossref

Google Scholar

[31]

ROSENBERG, A, AND SNYDER, L. "Minimal comparison 2-3 trees," SIAM J. Comput 7, 4 (Nov. 1978), 465-480.

Crossref

Google Scholar

[32]

RUBIN, F "Experiments in text file compressmn," Commun. ACM 19, 11 (Nov 1976), 617-623.

Digital Library

Google Scholar

[33]

SAMADI, B. "B-trees m a system w~th multiple vmws," Inf. Process. Lett. 5, 4 (Oct. 1976), 107-112

Crossref

Google Scholar

[34]

SEVERENCE, D. "Identifier search mechnisms, a survey and generahzed model," Comput. Surv 6, 3 (Sept. 1974), 175-194.

Crossref

Google Scholar

[35]

WAGNER, R. "Indexing demgn considerations," IBM Syst. J. 4, (1973), 351-367.

Digital Library

Google Scholar

[36]

WEDEKIND, H. "On the selection of access paths in a database system," in Data base management (Proc. IFIP Working Conf. Data Base Management) J Klimbie and K. Koffeman (Eds.), Elsevier/ North-Holland Pubhshmg Co., New York, 1974, 385-397.

Google Scholar

[37]

WIRTH, N. Algorithms + data structures --programs, Prentlce-HaU Inc., Englewood Cliffs, N J., 1976.

Crossref

Google Scholar

[38]

YAO, A. "On random 2-3 trees," Acta Inf. 9, 2 (1978), 159-170.

Digital Library

Google Scholar

Cited By

View all

Deng YYan MTang B(2024)Accelerating Merkle Patricia Trie with GPUProceedings of the VLDB Endowment10.14778/3659437.365944317:8(1856-1869)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659443
He WSabek ILou YCafarella M(2024)Optimizing Video Selection LIMIT Queries with Commonsense KnowledgeProceedings of the VLDB Endowment10.14778/3654621.365463917:7(1751-1764)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654639
Gao CBallijepalli SWang J(2024)Revisiting B-tree Compression: An Experimental StudyProceedings of the ACM on Management of Data10.1145/36549722:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654972
Show More Cited By

Index Terms

Ubiquitous B-Tree
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees

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) ...
Read More
Ubiquitous Computing: Are We There Yet?

The widespread deployment of technologies like mobile phones continues to drive new applications and to open research opportunities.

Read More
Special track on Ubiquitous Computing: Ubiquitous and Pervasive eCommerce and eBusiness: editorial message
SAC '08: Proceedings of the 2008 ACM symposium on Applied computing

Ubiquitous computing has emerged as one of the principal information and communication technologies that could lead to the achievement of the Ambient Intelligence (AmI) vision. Ambient Intelligence places human beings at the centre of the future ...
Read More

Comments

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 11, Issue 2

June 1979

108 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/356770

Editor:
Adele Goldberg

Issue’s Table of Contents

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: 01 June 1979

Published in CSUR Volume 11, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,400
Total Citations
View Citations
16,302
Total Downloads

Downloads (Last 12 months)1,997
Downloads (Last 6 weeks)208

Other Metrics

View Author Metrics

Citations

Cited By

View all

Deng YYan MTang B(2024)Accelerating Merkle Patricia Trie with GPUProceedings of the VLDB Endowment10.14778/3659437.365944317:8(1856-1869)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659443
He WSabek ILou YCafarella M(2024)Optimizing Video Selection LIMIT Queries with Commonsense KnowledgeProceedings of the VLDB Endowment10.14778/3654621.365463917:7(1751-1764)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654639
Gao CBallijepalli SWang J(2024)Revisiting B-tree Compression: An Experimental StudyProceedings of the ACM on Management of Data10.1145/36549722:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654972
Bender MFarach-Colton MGoodrich MKomlós H(2024)History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data StructuresProceedings of the ACM on Management of Data10.1145/36516092:2(1-27)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651609
Götz SBencomo NSamin HBaresi LMa XPasquale L(2024)Latency-aware RDMSim: Enabling the Investigation of Latency in Self-Adaptation for the Case of Remote Data MirroringProceedings of the 19th International Symposium on Software Engineering for Adaptive and Self-Managing Systems10.1145/3643915.3644106(182-188)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1145/3643915.3644106
Chen YChen S(2024)Cabin: A Compressed Adaptive Binned Scan IndexProceedings of the ACM on Management of Data10.1145/36393122:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639312
Chatterjee SPekala MKruglyak LIdreos S(2024)Limousine: Blending Learned and Classical Indexes to Self-Design Larger-than-Memory Cloud Storage EnginesProceedings of the ACM on Management of Data10.1145/36393022:1(1-28)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639302
Shi JWang BXu Y(2024)Spruce: a Fast yet Space-saving Structure for Dynamic Graph StorageProceedings of the ACM on Management of Data10.1145/36392822:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639282
Li PHua YJia JZuo P(2024)A Fast Learned Key-Value Store for Concurrent and Distributed SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3327009(1-14)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3327009
Liu JDragojević AFleming SKatsarakis AKorolija DZablotchi INg HKalia ACastro M(2024)Honeycomb: Ordered Key-Value Store Acceleration on an FPGA-Based SmartNICIEEE Transactions on Computers10.1109/TC.2023.334517373:3(857-871)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TC.2023.3345173
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

Index Terms

Recommendations

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

Ubiquitous Computing: Are We There Yet?

Special track on Ubiquitous Computing: Ubiquitous and Pervasive eCommerce and eBusiness: editorial message

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