Towards Enhanced Compression Techniques for Efficient High-Dimensional Similarity Search in Multimedia Databases

Authors:
Sören Balko;Ingo Schmitt;Gunter Saake
Affiliations:
-;-;-
Venue:
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Year:
2002

Citing 5
Cited 0

The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
Searching Multimedia Databases by Content

Searching Multimedia Databases by Content
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new efficient compression technique for high-dimensional similarity search in MMDBS. We propose the Active Vertice Tree which is based on concave cluster geometries. Furthermore, we briefly sketch a model for high-dimensional point alignments and specify basic requirements for high-dimensional cluster shapes. Finally, we compare the Active Vertice Tree with other methods for high-dimensional similarity search in terms of their retrieval performance.