Sciweavers

116 search results - page 5 / 24
» Measuring the Complexity of Join Enumeration in Query Optimi...
Sort
View
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
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 9 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
161
Voted
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
15 years 11 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 1 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
95
Voted
DKE
2006
123views more  DKE 2006»
14 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...