• DocumentCode
    394097
  • Title

    KDBKD-tree: a compact KDB-tree structure for indexing multidimensional data

  • Author

    Yu, Byunggu ; Bailey, Thomas ; Orlandic, Ratko ; Somavaram, Jothi

  • Author_Institution
    Dept. of Comput. Sci., Wyoming Univ., WY, USA
  • fYear
    2003
  • fDate
    28-30 April 2003
  • Firstpage
    676
  • Lastpage
    680
  • 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 KDBKD-tree. The KDBKD-tree eliminates redundant information in KDB-trees by changing the representation of the index entries in the interior pages. Experimental evidence shows that the KDBKD-tree outperforms other recent variants of KDB-trees, such as KDBFD-trees and KDBHD-trees.
  • Keywords
    database indexing; information retrieval; tree data structures; KDBKD-tree; compact KDB-tree structure; data storage; high-dimensional data retrieval; interior pages; multidimensional data indexing; point access method; Computer science; Design automation; Geographic Information Systems; High definition video; Indexing; Information retrieval; Land mobile radio cellular systems; Multidimensional systems; Multimedia databases; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology: Coding and Computing [Computers and Communications], 2003. Proceedings. ITCC 2003. International Conference on
  • Print_ISBN
    0-7695-1916-4
  • Type

    conf

  • DOI
    10.1109/ITCC.2003.1197612
  • Filename
    1197612
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=394097