A relaxed algorithm for similarity queries performed with high-dimensional access structures

DOI10.1007/3-540-36128-6_22MaRDI QIDQ4439711zbMATH OpenFDO

Authors Andreas Henrich

Publication date 15 December 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/2490/24900376.htm

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Approximate similarity search: a multi-faceted problem
• Similarity search in high-dimensional vector spaces (Thesis, ETH Zürich 2000)
• Index structures for fast similarity search for real vectors. II
• Ähnlichkeitssuche in Multimedia-Datenbanken
• Similarity-based ranking and query processing in multimedia databases

This page was built for publication: A relaxed algorithm for similarity queries performed with high-dimensional access structures

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