PrefixB-trees

Author:

Bayer Rudolf1,Unterauer Karl1

Affiliation:

1. Technische Univ. München, Munich, West Germany

Abstract

Two modifications ofB-trees are described, simple prefixB-trees and prefixB-trees. Both store only parts of keys, namely prefixes, in the index part of aB*-tree. In simple prefixB-trees those prefixes are selected carefully to minimize their length. In prefixB-trees the prefixes need not be fully stored, but are reconstructed as the tree is searched. PrefixB-trees are designed to combine some of the advantages ofB-trees, digital search trees, and key compression techniques while reducing the processing overhead of compression techniques.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Reference10 articles.

1. AUER 1~. Schlfisselkompressionen in B*-b~iumen. Diplomarbeit Tech. U. Miinchen Mtinchen Germany 1976. AUER 1~. Schlfisselkompressionen in B*-b~iumen. Diplomarbeit Tech. U. Miinchen Mtinchen Germany 1976.

2. BAYER R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta lnformatica 1 (1972) 290-306. BAYER R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta lnformatica 1 (1972) 290-306.

3. Organization and maintenance of large ordered indexes

4. BAYER R. AND METZGER J.K. On the encipherment of search tress and random access files. A CM Trans. Database Syst. i 1 (March 1976) 37-52. 10.1145/320434.320445 BAYER R. AND METZGER J.K. On the encipherment of search tress and random access files. A CM Trans. Database Syst. i 1 (March 1976) 37-52. 10.1145/320434.320445

Cited by 168 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Storage Management with Multi-Version Partitioned BTrees;Information Systems;2024-11

2. Revisiting B-tree Compression: An Experimental Study;Proceedings of the ACM on Management of Data;2024-05-29

3. Why Files If You Have a DBMS?;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. More Modern B-Tree Techniques;Foundations and Trends® in Databases;2024

5. DB+-tree: A new variant of B+-tree for main-memory database systems;Information Systems;2023-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3