Sciweavers

624 search results - page 67 / 125
» Mutant Query Plans
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 4 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 4 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
BTW
2005
Springer
113views Database» more  BTW 2005»
14 years 3 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...
VLDB
2004
ACM
124views Database» more  VLDB 2004»
14 years 3 months ago
Automated Statistics Collection in DB2 UDB
The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably lo...
Ashraf Aboulnaga, Peter J. Haas, Sam Lightstone, G...
AIPS
1996
13 years 11 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe