Sciweavers

634 search results - page 9 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
ICDCS
2008
IEEE
14 years 2 months ago
Multi-query Optimization for Distributed Similarity Query Processing
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
Yi Zhuang, Qing Li, Lei Chen 0002
AAAI
2010
13 years 9 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
14 years 2 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
PVLDB
2010
134views more  PVLDB 2010»
13 years 6 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 8 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...