1007 search results - page 95 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
162
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
322
click to vote
SIGIR
2011
ACM
14 years 9 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
265
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
176
click to vote
IEEEPACT
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the Cameron Project 1 , which aims to provide a high level, algorithmic language and optimizing compiler for the development of image processing applications o...