Please use this identifier to cite or link to this item:
Title: Dimensionality Curse, Concentration Phenomenon and the KDB-tree
Authors: Kouiroukidis, Nikolaos
Evangelidis, Georgios
Type: Conference Paper
Subjects: FRASCATI::Natural sciences::Computer and information sciences
Keywords: Dimensionality curse
KDB tree
Hypercube range queries
Issue Date: 2012
First Page: 46
Last Page: 49
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.
Electronic ISSN: 2623-4629
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
2011_ICININFO_Kouiroukidis.pdf562,33 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons