ACM Computing Surveys (CSUR)
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Signature Quadratic Form Distance
Proceedings of the ACM International Conference on Image and Video Retrieval
Constraint models for reasoning on unification in inductive logic programming
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Ptolemaic indexing of the signature quadratic form distance
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Controllable combinatorial coverage in grammar-based testing
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Fractional distance measures for content-based image retrieval
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
Non-metric similarity search of tandem mass spectra including posttranslational modifications
Journal of Discrete Algorithms
Efficient indexing of similarity models with inequality symbolic regression
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Towards efficient indexing of arbitrary similarity: vision paper
ACM SIGMOD Record
Universal indexing of arbitrary similarity models
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Similarity search is becoming popular in even more disciplines, such as multimedia databases, bioinformatics, social networks, to name a few. The existing indexing techniques often assume the metric space model that could be too restrictive from the domain point of view. Hence, many modern applications that involve complex similarities do not use any indexing and use just sequential search, so they are applicable only to small databases. In this paper we revisit the assumptions which persist in the mainstream research of content-based retrieval. Leaving the traditional indexing paradigms such as the metric space model, our goal is to propose alternative methods for indexing that shall lead to high-performance similarity search. We introduce the design of the algorithmic framework SIMDEX for exploration of analytical properties (axioms) useful for indexing that hold in a given complex similarity space but were not discovered so far. Consequently, the known axioms will be localized as a subset within the universe of all axioms suitable for indexing. Speaking in a hyperbole, for database research the discovery of new axioms valid in some similarity space might have an impact comparable to the discovery of new laws of physics holding in parallel universes.