KDB<sub>KD</sub>-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data

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

Las Vegas, Nevada April 28-April 30

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197612

International Conference on Informati ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Byunggu Yu Articles by Ratko Orlandic Articles by Thomas Bailey Articles by Jothi Somavaram

	ASCII Text	x
	Byunggu Yu, Ratko Orlandic, Thomas Bailey, Jothi Somavaram, "KDB<sub>KD</sub>-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data," Information Technology: Coding and Computing, International Conference on, pp. 676, International Conference on Information Technology: Computers and Communications, 2003.

	BibTex	x
	@article{ 10.1109/ITCC.2003.1197612, author = {Byunggu Yu and Ratko Orlandic and Thomas Bailey and Jothi Somavaram}, title = {KDB<sub>KD</sub>-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data}, journal ={Information Technology: Coding and Computing, International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1916-4}, pages = {676}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197612}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: Coding and Computing, International Conference on TI - KDB<sub>KD</sub>-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data SN - 0-7695-1916-4 SP EP A1 - Byunggu Yu, A1 - Ratko Orlandic, A1 - Thomas Bailey, A1 - Jothi Somavaram, PY - 2003 KW - null VL - 0 JA - Information Technology: Coding and Computing, International Conference on ER -

Byunggu Yu, University of Wyoming

Ratko Orlandic, Illinois Institute of Technology

Thomas Bailey, University of Wyoming

Jothi Somavaram, University of Wyoming

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.

Citation:

Byunggu Yu, Ratko Orlandic, Thomas Bailey, Jothi Somavaram, "KDB_KD-Tree:A Compact KDB-Tree Structure for Indexing Multidimensional Data," itcc, pp.676, International Conference on Information Technology: Computers and Communications, 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.