KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data

Authors:
Byunggu Yu;Ratko Orlandic;Thomas Bailey;Jothi Somavaram
Affiliations:
-;-;-;-
Venue:
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Year:
2003

Citing 0
Cited 7

Processing partially specified queries over high-dimensional databases

Data & Knowledge Engineering
A new indexing method with high storage utilization and retrieval efficiency for large spatial databases

Information and Software Technology
Compressed B+-trees

WSEAS Transactions on Computers
The Optimization of In-Memory Space Partitioning Trees for Cache Utilization

IEICE - Transactions on Information and Systems
Indexing the fully evolvement of spatiotemporal objects

WSEAS Transactions on Information Science and Applications
An index structure for parallel processing of multidimensional data

WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Efficient implementation of a multi-dimensional index structure over flash memory storage systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of storing and retrieving high-dimensional data continues to be an important issue. Inthis paper, we propose an efficient high-dimensional pointaccess method called the KDBKD-tree.The KDBKD-treeeliminates redundant information in KDB-trees bychanging the representation of the index entries in theinterior pages. Experimental evidence shows that theKDBKD-Tree outperforms other recent variants of KDB-trees, such as KDBFD-trees and KDBHD-trees.