Sciweavers

950 search results - page 64 / 190
» Evaluation over thousands of queries
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
12 years 17 days ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny

Publication
309views
15 years 10 months ago
SOLE: Scalable On-Line Execution of Continuous Queries on Spatio-temporal Data Streams
This paper presents the Scalable On-Line Execution algorithm (SOLE, for short) for continuous and on-line evaluation of concurrent continuous spatio- temporal queries over data str...
Mohamed F. Mokbel, Walid G. Aref
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 3 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
PVLDB
2010
84views more  PVLDB 2010»
13 years 8 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
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...