The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient indexing of high-dimensional data through dimensionality reduction
Data & Knowledge Engineering
Improving index performance through prefetching
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
A retrieval technique for high-dimensional data and partially specified queries
Data & Knowledge Engineering
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Restructuring the concurrent B+-tree with non-blocked search operations
Information Sciences—Informatics and Computer Science: An International Journal
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
| Hi-index | 0.00 |
The B+-tree and its variants have been reported as the good index structures for retrieving data. Database systems frequently establish the B+-tree style indices for fast access to data records. However, traditional B+-tree index could be a performance bottleneck because of its inflatable hierarchy. Many works focus on improving indexing techniques. In fact, the optimization of data organization inside index nodes is the most critical factor to improve retrieval quality. Some handles like pre-partition of data space, node splitting by force, node splitting with unbalanced partition, and node splitting upon overflow loading always burden index structures with plenty of storage space and building overhead. In this paper, we propose a new index scheme to highly aggregate the external structure in a B+-tree. It also adopts a better splitting policy to completely remove the suffering from data insertion orders. Our new index technique can compress data records in leaves and in turn reduce index size to improve query performance. In addition, the entire index's space utilization is promoted to a higher level; thereby the index's space requirement becomes smaller and easily resides in memory.