Dimensionality curse, concentration phenomenon and the KDB-tree

dc.contributor.author	Κουϊρουκίδης, Νικόλαος	el
dc.contributor.author	Ευαγγελίδης, Γεώργιος	el
dc.contributor.author	Kouiroukidis, Nikolaos	en
dc.contributor.author	Evangelidis, Georgios	en
dc.date.accessioned	2015-04-25T09:36:33Z
dc.date.available	2015-04-25T09:36:33Z
dc.date.issued	2015-04-25
dc.identifier.uri	http://hdl.handle.net/11400/8914
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://history.icininfo.net/2011/	el
dc.source	http://history.icininfo.net/2011/FileStore/procs_INFO_2011.pdf	el
dc.subject	Dimensionality curse
dc.subject	KDB δέντρο
dc.subject	KDB tree
dc.subject	Hypercube range queries
dc.subject	Υπερκύβος επερωτήσεις εύρους
dc.title	Dimensionality curse, concentration phenomenon and the KDB-tree	en
heal.type	conferenceItem
heal.classification	Computer science
heal.classification	Computer programming
heal.classification	Πληροφορική
heal.classification	Προγραμματισμός
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://skos.um.es/unescothes/C00749
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Προγραμματισμός
heal.contributorName	Γιαννακόπουλος, Γεώργιος Α. (συντ.)	el
heal.contributorName	Σακκάς, Δαμιανός Π. (συντ.)	el
heal.language	en
heal.access	free
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Διοίκησης και Οικονομίας. Τμήμα Βιβλιοθηκονομίας και Συστημάτων Πληροφόρησης	el
heal.publicationDate	2011-09
heal.bibliographicCitation	Kouiroukidis, N. and Evangelidis, G. (2011). Dimensionality curse, concentration phenomenon and the KDB-tree. International Conference on Integrated Information (IC-ININFO 2011), Kos Island, Greece, 29 September - 3 Octomber 2011. pp. 46-49. Available from: http://history.icininfo.net/2011/FileStore/procs_INFO_2011.pdf	en
heal.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.	en
heal.fullTextAvailability	true
heal.conferenceName	International Conference on Integrated Information (IC-ININFO 2011)	en
heal.conferenceItemType	full paper