The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Improving Adaptable Similarity Query Processing by Using Approximations
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Efficient Similarity Search in Feature Spaces with the Q-Tree
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Region proximity in metric spaces and its use for approximate similarity search
ACM Transactions on Information Systems (TOIS)
Similarity Search for Multidimensional Data Sequences
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Query by image and video content: a colored-based stochastic model approach
Data & Knowledge Engineering
Array-index: a plug&search K nearest neighbors method for high-dimensional data
Data & Knowledge Engineering
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Filter ranking in high-dimensional space
Data & Knowledge Engineering
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
High dimensional nearest neighbor searching
Information Systems
Indexing schemes for similarity search: an illustrated paradigm
Fundamenta Informaticae
Efficient processing of complex similarity queries in RDBMS through query rewriting
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Image retrieval system using R-tree self-organizing map
Data & Knowledge Engineering
Finding near neighbors through cluster pruning
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
IEEE Transactions on Knowledge and Data Engineering
Distance browsing in distributed multimedia databases
Future Generation Computer Systems
MESSIF: metric similarity search implementation framework
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
The GC-tree: a high-dimensional index structure for similarity search in image databases
IEEE Transactions on Multimedia
Scaling-invariant boundary image matching using time-series matching techniques
Data & Knowledge Engineering
| Hi-index | 0.00 |
Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. ...