An efficient B+-tree design for main-memory database systems with strong access locality

Authors:
Pei-Lun Suei;Victor C. S. Lee;Shi-Wu Lo;Tei-Wei Kuo
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, ROC;Department of Computer Science, City University of Hong Kong, Hong Kong;Department of Computer Science and Information Engineering, National Chung-Cheng University, Chia-Yi, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, ROC and Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei, ...
Venue:
Information Sciences: an International Journal
Year:
2013

Citing 20
Cited 0

Implementing deletion in B+-trees

ACM SIGMOD Record
Optimizing Jan Jannink's Implementation of B+-tree deletion

ACM SIGMOD Record
Research issues in real-time database systems

Information Sciences—Informatics and Computer Science: An International Journal
The log-structured merge-tree (LSM-tree)

Acta Informatica
On-line reorganization of sparsely-populated B+-trees

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Main Memory Database Systems: An Overview

IEEE Transactions on Knowledge and Data Engineering
Concurrency Control in B-Trees with Batch Updates

IEEE Transactions on Knowledge and Data Engineering
Restructuring the concurrent B+-tree with non-blocked search operations

Information Sciences—Informatics and Computer Science: An International Journal
Efficient Bulk Deletes in Relational Databases

Proceedings of the 17th International Conference on Data Engineering
An Evaluation of Generic Bulk Loading Techniques

Proceedings of the 27th International Conference on Very Large Data Bases
Issues in data stream management

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

ADC '00 Proceedings of the Australasian Database Conference
T*-tree: a main memory database index structure for real time applications

RTCSA '96 Proceedings of the Third International Workshop on Real-Time Computing Systems Application
B-tree indexes for high update rates

ACM SIGMOD Record
Query and update efficient B+-tree based indexing of moving objects

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A B-Tree index extension to enhance response time and the life cycle of flash memory

Information Sciences: an International Journal
Fine-grained updates in database management systems for flash memory

Information Sciences: an International Journal
Tracking a moving object via a sensor network with a partial information broadcasting scheme

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper is motivated by the strong demands of many main-memory database applications with strong locality in data access, such as front-end logistical systems. We propose to adopt an auxiliary-tree approach with an tree-merging algorithm to efficiently handle bursty data insertions with keys in a small range and avoid significant overheads in tree rebalancing. A range-based deletion algorithm is then proposed to process data deletions with strong access locality in a batch fashion. The capability of the proposed approach is evaluated by a series of experiments with a wide range of workloads and a variety of locality patterns, where different tree index structures are compared in terms of the performance and memory space requirements.