Sciweavers

624 search results - page 39 / 125
» Mutant Query Plans
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 12 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 11 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
DBISP2P
2004
Springer
111views Database» more  DBISP2P 2004»
14 years 4 months ago
Processing and Optimization of Complex Queries in Schema-Based P2P-Networks
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
Hadhami Dhraief, Alfons Kemper, Wolfgang Nejdl, Ch...
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
15 years 17 days ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
AAAI
2008
14 years 1 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor