Sciweavers

620 search results - page 94 / 124
» Algorithms for Rewriting Aggregate Queries Using Views
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 8 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
SIGMOD
2009
ACM
167views Database» more  SIGMOD 2009»
16 years 3 months ago
HDSampler: revealing data behind web form interfaces
A large number of online databases are hidden behind the web. Users to these systems can form queries through web forms to retrieve a small sample of the database. Sampling such h...
Anirban Maiti, Arjun Dasgupta, Nan Zhang, Gautam D...
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
15 years 10 months ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 3 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
DCOSS
2006
Springer
15 years 7 months ago
Distance-Sensitive Information Brokerage in Sensor Networks
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu ...