Sciweavers

624 search results - page 79 / 125
» Mutant Query Plans
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 10 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
XIMEP
2004
ACM
108views Database» more  XIMEP 2004»
14 years 3 months ago
The Joy of SAX
Most current XQuery implementations require that all XML data reside in memory in one form or another before they start processing the data. This is unacceptable for large XML doc...
Leonidas Fegaras
EDBT
2010
ACM
151views Database» more  EDBT 2010»
14 years 3 months ago
Warm cache costing: a feedback optimization technique for buffer pool aware costing
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution plan for a given query. Since the physical IO (PIO) is a costly operation to...
H. S. Ramanujam, Edwin Seputis
EDBT
2009
ACM
165views Database» more  EDBT 2009»
13 years 7 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 10 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...