Page Header Logo
TEI of Athens eJournals

Dimensionality Curse, Concentration Phenomenon and the KDB-tree

Nikolaos Kouiroukidis, Georgios Evangelidis

Abstract


The problem of indexing large volumes of high dimensional data is an important and popular issue in the area of database management. There are many indexing methods that behave well in low dimensional spaces, but, in high dimensionalities, the phenomenon of the curse of dimensionality renders all indexes useless. For example, when issuing range queries almost all of the index pages have to be retrieved for answering these queries. In this paper we review the state-of-the-art research regarding high dimensional spaces and we demonstrate the dimensionality curse phenomenon using the TPIE KDBtree implementation

Keywords


Dimensionality curse, KDB tree, Hypercube range queries

Full Text: PDF

Refbacks

  • There are currently no refbacks.

The application for presenting electronic journals TEI developed within subproject 2 "electronic publishing service" the Act "Development Services Digital Library of TEI" and financed by the operational program "Digital Convergence", NSRF 2007-2013.