Fast Evaluation Techniques for Complex Similarity Queries
Explore this paper's citation graph
Summary
A new evaluation technique called Generalized VA-File-based Search (GeVAS) is described, which builds on the VA- File, supports queries over several feature types, and borrows the idea to search an index structure with several query objects in parallel from Ciaccia et al.
- Type
- article
- Published
- 2001-09-11
- Cited by
- 43
- References
- 35
- OpenAlex
- https://openalex.org/W2145789701
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:13298418
Keywords
Computer science, Information retrieval, Relevance feedback, Feature (linguistics), Relevance (law)
References
- Relevance Feedback and Other Query Modification Techniques
- A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
- The SMART Retrieval System—Experiments in Automatic Document Processing
- What Is the Nearest Neighbor in High Dimensional Spaces?
- Single-feature query by multi-examples in image databases
- Information Retrieval: Data Structures and Algorithms
- A formula for incorporating weights into scoring rules
- Combining fuzzy information from multiple systems (extended abstract)
- Combining Fuzzy Information from Multiple Systems
- Using Fagin's algorithm for merging ranked results in multimedia middleware
- Relevance feedback techniques in interactive content-based image retrieval
- Spectral covariance and fuzzy regions for image indexing
- QBIC project: querying images by content, using color, texture, and shape
- Independent quantization: an index compression technique for high-dimensional data spaces
- The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
- Texture Features for Browsing and Retrieval of Image Data
- Strategies for positive and negative relevance feedback in image retrieval
- Optimizing Multi-Feature Queries for Image Databases
- The SR-tree: an index structure for high-dimensional nearest neighbor queries
- The R*-tree: an efficient and robust access method for points and rectangles
Cited by
- Pyragrid: Bringing Peer-to-Peer and Grid Architectures Together
- Performance and Quality Evaluation of a Personalized Route Planning System
- Hyperdatabase Infrastructure for Management and Search of Multimedia Collections
- Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
- A linear transform scheme for building weighted scoring rules
- Flexible integration of multimedia sub-queries with qualitative preferences
- DelosDLMS: From the DELOS vision to the implementation of a future digital library management system
- Bitmap indexing method for complex similarity queries with relevance feedback
- ADAM - A Database and Information Retrieval System for Big Multimedia Collections
- Partial query resolution for animation authoring
- Searching in metric spaces with user-defined and approximate distances
- Non-uniform partition strategies for indexing high-dimensional data with different distributions
- Efficient processing of complex similarity queries in RDBMS through query rewriting
- Reducing I/O Cost of Similarity Queries by Processing Several at a Time
- Smart search & retrieval on video databases
- Efficient Algorithms to Execute Complex Similarity Queries in RDBMS
- Flexible Indexierung für Ähnlichkeitssuche mit logikbasierten Multi-Feature-Anfragen
- Solving approximate similarity queries
- A new indexing method for complex similarity queries in immersive multimedia systems
- Nonlinear Approximate Indexing for Multimedia Data
Related papers
- A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
- Combining Fuzzy Information from Multiple Systems.
- Optimal aggregation algorithms for middleware
- M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
- Optimizing Multi-Feature Queries for Image Databases
- Combining fuzzy information from multiple systems (extended abstract)
- Supporting Ranked Boolean Similarity Queries in MARS
- Nearest neighbor queries
- Atomicity and isolation for transactional processes