Sciweavers

26 search results - page 4 / 6
» Improved Unnesting Algorithms for Join Aggregate SQL Queries
Sort
View
101
Voted
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 10 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
15 years 10 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
122
Voted
SIGMOD
2011
ACM
331views Database» more  SIGMOD 2011»
14 years 1 months ago
Query optimization techniques for partitioned tables
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
Herodotos Herodotou, Nedyalko Borisov, Shivnath Ba...
88
Voted
DMDW
2000
161views Management» more  DMDW 2000»
14 years 11 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 2 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass