Sciweavers

619 search results - page 67 / 124
» Query Planning in Infomaster
Sort
View
130
Voted
ECAI
2010
Springer
15 years 4 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
16 years 5 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
227
Voted
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 5 months ago
Put a Tree Pattern in Your Algebra
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
George A. Mihaila, Jérôme Simé...
122
Voted
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 8 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
15 years 10 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee