Sciweavers

634 search results - page 6 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
WWW
2005
ACM
14 years 8 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 9 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
WWW
2010
ACM
13 years 6 months ago
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patt...
Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldat...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 17 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
WWW
2007
ACM
14 years 8 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li