Sciweavers

47 search results - page 5 / 10
» Query Planning with Limited Source Capabilities
Sort
View
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
15 years 7 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
APWEB
2010
Springer
14 years 13 days ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
IJCAI
2003
13 years 9 months ago
Combining Classification and Transduction for Value Prediction in Speculative Plan Execution
Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is clos...
Greg Barish, Craig A. Knoblock
AAAI
1996
13 years 9 months ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld
VLDB
1999
ACM
89views Database» more  VLDB 1999»
13 years 12 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen