Sciweavers

197 search results - page 7 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
14 years 9 days ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
ICRA
2009
IEEE
196views Robotics» more  ICRA 2009»
13 years 5 months ago
CHOMP: Gradient optimization techniques for efficient motion planning
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...
ICLP
2007
Springer
13 years 11 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
14 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
VLDB
2005
ACM
112views Database» more  VLDB 2005»
14 years 29 days ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...