MKL-tree: A hierarchical data structure for indexing multidimensional data

DOI10.1007/3-540-46146-9_90MaRDI QIDQ4410741zbMATH OpenFDO

Authors Raffaele Cappelli, Alessandra Lumini, Dario Maio

Publication date 3 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2453/24530914.htm

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1374868
• A simple, compact and dynamic partition scheme based on co-centric spheres
• Efficient indexing of high-dimensional data through dimensionality reduction
• Hierarchical clustering-merging for multidimensional index structures
• High-dimensional indexing. Transformational approaches to high-dimensional range and similarity searches

Cited in

(4)

• The SH-tree: A super hybrid index structure for multidimensional data
• BR-Tree: A Scalable Prototype for Supporting Multiple Queries of Multidimensional Data
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• Generating High Dimensional Data and Query Sets

This page was built for publication: MKL-tree: A hierarchical data structure for indexing multidimensional data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410741)