Sciweavers

750 search results - page 112 / 150
» Aggregates in Possibilistic Databases
Sort
View
SIGMOD
2004
ACM
95views Database» more  SIGMOD 2004»
14 years 10 months ago
Querying at Internet-Scale
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its comm...
Brent N. Chun, Joseph M. Hellerstein, Ryan Huebsch...
SIGMOD
2002
ACM
91views Database» more  SIGMOD 2002»
14 years 10 months ago
A scalable hash ripple join algorithm
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey ...
SIGMOD
2001
ACM
147views Database» more  SIGMOD 2001»
14 years 10 months ago
Optimizing Queries Using Materialized Views: A practical, scalable solution
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
Jonathan Goldstein, Per-Åke Larson
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 10 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
PODS
2005
ACM
128views Database» more  PODS 2005»
14 years 10 months ago
Operator placement for in-network stream query processing
In sensor networks, data acquisition frequently takes place at lowcapability devices. The acquired data is then transmitted through a hierarchy of nodes having progressively incre...
Utkarsh Srivastava, Kamesh Munagala, Jennifer Wido...