Sciweavers

313 search results - page 56 / 63
» Data Sufficiency for Queries on Cache
Sort
View
IJCAI
2003
13 years 9 months ago
Learning Value Predictors for the Speculative Execution of Information Gathering Plans
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
ADL
2000
Springer
373views Digital Library» more  ADL 2000»
14 years 17 days ago
BlueView: Virtual Document Servers for Digital Libraries
In the BlueView project, digital library services are developed and partially implemented based on the architecture of virtual document servers. Using standard tools like fulltext...
Andreas Heuer, Holger Meyer, Beate Porst, Patrick ...
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 7 months ago
Generic Database Cost Models for Hierarchical Memory Systems
Accurate prediction of operator execution time is a prerequisite for database query optimization. Although extensively studied for conventional disk-based DBMSs, cost modeling in ...
Stefan Manegold, Peter A. Boncz, Martin L. Kersten
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 12 days ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 8 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel