Sciweavers

119 search results - page 4 / 24
» Benchmarking Query Execution Robustness
Sort
View
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 10 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,...
DASFAA
2010
IEEE
179views Database» more  DASFAA 2010»
14 years 4 months ago
Scalable Splitting of Massive Data Streams
Scalable execution of continuous queries over massive data streams often requires splitting input streams into parallel sub-streams over which query operators are executed in paral...
Erik Zeitler, Tore Risch
ISICT
2004
13 years 11 months ago
The design of the IPACS distributed software architecture
The IPACS-project (Integrated Performance Analysis of Computer Systems) was founded by the Federal Department of Education, Science, Research and Technology (BMBF) in the program ...
Heinz Kredel, Matthias Merz
COMPGEOM
1997
ACM
14 years 2 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 10 months ago
Query Processing for SQL Updates
A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused...
César A. Galindo-Legaria, Stefano Stefani, ...