Sciweavers

6004 search results - page 146 / 1201
» Parallelizing query optimization
Sort
View
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 3 months ago
Optimizing Nested Queries with Parameter Sort Orders
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-n...
Ravindra Guravannavar, H. S. Ramanujam, S. Sudarsh...
DAWAK
2000
Springer
14 years 2 months ago
Optimal Multidimensional Query Processing Using Tree Striping
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
Stefan Berchtold, Christian Böhm, Daniel A. K...
SIGMOD
1994
ACM
99views Database» more  SIGMOD 1994»
14 years 2 months ago
Optimizing Queries on Files
We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
Mariano P. Consens, Tova Milo
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 10 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 12 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi