Sciweavers

368 search results - page 29 / 74
» Efficient exploitation of similar subexpressions for query p...
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 1 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
VLDB
2007
ACM
190views Database» more  VLDB 2007»
14 years 9 months ago
Request Window: an Approach to Improve Throughput of RDBMS-based Data Integration System by Utilizing Data Sharing Across Concur
This paper focuses on the problem of improving distributed query throughput of the RDBMS-based data integration system that has to inherit the query execution model of the underly...
Rubao Lee, Minghong Zhou, Huaming Liao
WWW
2005
ACM
14 years 9 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
SIGIR
2011
ACM
12 years 11 months ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...
GIS
1999
ACM
14 years 1 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas