Sciweavers

2514 search results - page 176 / 503
» On the Computation of Approximations of Database Queries
Sort
View
VLDB
1995
ACM
132views Database» more  VLDB 1995»
15 years 10 months ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 6 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 6 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
ICDE
2009
IEEE
136views Database» more  ICDE 2009»
16 years 8 months ago
A Concise Representation of Range Queries
Abstract--With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
15 years 11 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan