A Case Study on B-Tree Database Indexing Technique

most commonly used to manage and organize large databases which support record insertion, deletion, and key range searches. B-Trees are the most widely used indexing method for large disk-based databases and for implementing file systems.

Computer Science

Source

Paper

Full text

PDF

A Case Study on B-Tree Database Indexing Technique

Semantic Scholar · Computer Science · 2020

Abstract

Source of record · Semantic Scholar

BMTree: Designing, Learning, and Updating Piecewise Space-Filling Curves for Multi-Dimensional Data IndexingJiangneng Li, Yuang Liu, Zheng Wang et al.2025 · IEEE Transactions on Knowledge and Data Engineering · 0 citations In Library

BT-Tree: A Reinforcement Learning Based Index for Big Trajectory DataTu Gu, Kaiyu Feng, Jingyi Yang et al.2024 · Proc. ACM Manag. Data · 3 citations In Library

Tree Index: A New Cluster Evaluation TechniqueA. H. Beg, Md Zahidul Islam, Vladimir Estivill‐Castro2020 · arXiv (Cornell University) In Library

Enhancing access privacy of range retrievals over B+-treesHweeHwa Pang, Jilian Zhang, K. Mouratidis2013 · IEEE Transactions on Knowledge and Data Engineering · 16 citations In Library

Constructing Tree-based Index for Efficient and Effective Dense RetrievalHaitao Li, Qingyao Ai, Jingtao Zhan et al.2023 In Library

A design approach for a distributed system to handle ChineseJames L. Clark2022 · Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI In Library

Constructing Tree-based Index for Efficient and Effective Dense RetrievalHaitao Li, Qingyao Ai, Jingtao Zhan et al.2023 · arXiv (Cornell University) · 33 citations In Library

Evaluating search key distribution impact on searching performance in large data streamsBowonsak Srisungsittisunti, Jirawat Duangkaew, Nakarin Chaikaew2025 · IAES International Journal of Artificial Intelligence In Library

BL-Tree: The Best of Both Worlds by Combining B+- Tree on Top and LSM - Tree on BottomSuzhen Wu, Zuocheng Wang, Shengzhe Wang et al.2025 In Library

Patents near this paper

SUPPORTING B+TREE INDEXES ON PRIMARY B+TREE STRUCTURES WITH LARGE PRIMARY KEYSUS 7,809,674 · ORACLE INTERNATIONAL CORPORATION · 2010 SYSTEM AND METHOD FOR IMPROVING DATABASE DATA MANIPULATION USING DIRECT INDEXING WITHIN A B*TREE INDEX HAVING A TUNABLE INDEX ORGANIZATIONUS 6,480,839 · GO2MARKET.COM · 2002 DYNAMIC PRECONDITIONING OF A B+TREEUS 7,809,759 · UNISYS CORPORATION · 2010 SYSTEM AND METHOD FOR EFFICIENTLY INDEXING AND STORING A LARGE DATABASE WITH HIGH DATA INSERTION FREQUENCYUS 5,204,958 · DIGITAL EQUIPMENT CORPORATION A CORP. OF MA · 1993 SUPPORTING DATABASE INDEXES BASED ON A GENERALIZED B-TREE INDEXUS 6,219,662 · INTERNATIONAL BUSINESS MACHINES CORPORATION · 2001

Source of record

Semantic Scholar

A Case Study on B-Tree Database Indexing Technique

Paper

Full text

Abstract

Similar papers

Patents near this paper

Welcome.

Patents near this paper