Sciweavers

197 search results - page 6 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 7 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
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 ...
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 7 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
PVLDB
2010
146views more  PVLDB 2010»
13 years 2 months ago
Generating Efficient Execution Plans for Vertically Partitioned XML Databases
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
Patrick Kling, M. Tamer Özsu, Khuzaima Daudje...
AAAI
2006
13 years 9 months ago
Efficient Active Fusion for Decision-Making via VOI Approximation
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...
Wenhui Liao, Qiang Ji