A Bottom-Up Distance-Based Index Tree for Metric Space

DOI10.1007/11795131_64zbMATH Open1196.68073OpenAlexW1555592023MaRDI QIDQ5757979FDOQ5757979

Authors: Bing Liu, Zhi-Hui Wang, Xiaoming Yang, Wei Wang, Baile Shi 

Publication date: 7 September 2007

Published in: Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11795131_64

Recommendations

• Dynamic spatial approximation trees
• Distance-based index structures for fast similarity search
• An Index Data Structure for Searching in Metric Space Databases
• Similarity search. The metric space approach.
• Improved search heuristics for the sa-tree

zbMATH Keywords

clusteringsimilarity searchMetric space

Mathematics Subject Classification ID

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

Cited In (4)

• Dynamic spatial approximation trees
• Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
• Satisfying general proximity/similarity queries with metric trees
• An Index Data Structure for Searching in Metric Space Databases

This page was built for publication: A Bottom-Up Distance-Based Index Tree for Metric Space

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