Sciweavers

624 search results - page 42 / 125
» Mutant Query Plans
Sort
View
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
13 years 10 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein
ICDE
2005
IEEE
114views Database» more  ICDE 2005»
14 years 4 months ago
VAMANA - A Scalable Cost-Driven XPath Engine
¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes ...
Venkatesh Raghavan, Kurt W. Deschler, Elke A. Rund...
JACM
2012
12 years 1 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
ICDE
2007
IEEE
207views Database» more  ICDE 2007»
15 years 16 days ago
SIGOPT: Using Schema to Optimize XML Query Processing
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
Stelios Paparizos, Jignesh M. Patel, H. V. Jagadis...
VLDB
2002
ACM
91views Database» more  VLDB 2002»
13 years 10 months ago
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
Arvind Hulgeri, S. Sudarshan