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

International Conference on Information Technology: Computers and Communications p. 676
KDBKD-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data
Byunggu Yu, University of Wyoming
Ratko Orlandic, Illinois Institute of Technology
Thomas Bailey, University of Wyoming
Jothi Somavaram, University of Wyoming

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197612
Send link to a friend

Abstract
The problem of storing and retrieving high- dimensional data continues to be an important issue. In this paper, we propose an efficient high-dimensional point access method called the KDB_KD-tree.The KDB_KD-tree eliminates redundant information in KDB-trees by changing the representation of the index entries in the interior pages. Experimental evidence shows that the KDB_KD-Tree outperforms other recent variants of KDB- trees, such as KDB_FD-trees and KDB_HD-trees.
Back to Top Additional Information
Citation: Byunggu Yu, Ratko Orlandic, Thomas Bailey, Jothi Somavaram, "KDBKD-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data," itcc, p. 676, International Conference on Information Technology: Computers and Communications, 2003

	Advanced Search
CS Search Google Search