J+-tree: a new index structure in main memory

Authors:
Hua Luan;Xiaoyong Du;Shan Wang;Yongzhi Ni;Qiming Chen
Affiliations:
School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, University of China, MOE, Beijing, China;School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, University of China, MOE, Beijing, China;School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, University of China, MOE, Beijing, China;School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, University of China, MOE, Beijing, China;HP Labs China, Beijing, China
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 9
Cited 0

Making B+- trees cache conscious in main memory

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Improving index performance through prefetching

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Main Memory Database Systems: An Overview

IEEE Transactions on Knowledge and Data Engineering
An Evaluation of Starburst's Memory Resident Storage Component

IEEE Transactions on Knowledge and Data Engineering
Logical and Physical Versioning in Main Memory Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Study of Index Structures for Main Memory Database Management Systems

VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Cache Conscious Indexing for Decision-Support in Main Memory

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
High-Performance and Scalability through Application Tier,In-Memory Data Management

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the memory capacity increases and the hardware becomes cheaper, main memory databases (MMDB) have come true and been used in more and more applications, because they can provide better response time and throughputs. The advent of MMDB requires a reconsideration of data structures and algorithms of traditional DBMS. The index structure is one of the most important aspects that need be redesigned since it can affect the overall system performance heavily. Even though the T-tree index, which was proposed for main memory databases, has been widely accepted as a promising index structure. B+-tree and its variants still have their advantages in memory and are also regarded as the potential main memory database index structures. In this paper, we propose a new indexing technique called J+-tree for MMDB, inspired by the Judy structure which is an associative array data structure. Our J+-tree index not only holds the advantages of Judy (such as good single value search characteristic) but also outperforms it in many ways. For example, J+-tree can obtain better performance for range queries that are very slow in Judy structure. We compare the J+-tree index with Judy, T-tree and B+-tree on time and space aspects, and the experimental results show that J+-tree can provide better overall performance in main memory.