Dynamic spatial approximation trees

DOI10.1145/1227161.1322337MaRDI QIDQ5269270zbMATH OpenOpenAlexFDO

Authors Nora Reyes, Gonzalo Navarro

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10533/172832

zbMATH Keywords

multidimensional searchmultimedia databasesproximity searchsimilarity searchspatial approximation treespatial search

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Database theory (68P15)

Recommendations

• Memory-adaptative dynamic spatial approximation trees.
• A Bottom-Up Distance-Based Index Tree for Metric Space
• Improved search heuristics for the sa-tree
• An Index Data Structure for Searching in Metric Space Databases
• New dynamic construction techniques for M-tree

Cited in

(9)

• Solving similarity joins and range queries in metric spaces with the list of twin clusters
• Distance-based index structures for fast similarity search
• Spatial CART classification trees
• An Index Data Structure for Searching in Metric Space Databases
• scientific article; zbMATH DE number 850290 (Why is no real title available?)
• New features for continuous exploratory landscape analysis based on the SOO tree
• Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
• A Bottom-Up Distance-Based Index Tree for Metric Space
• Memory-adaptative dynamic spatial approximation trees.

This page was built for publication: Dynamic spatial approximation trees

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