Sciweavers

316 search results - page 36 / 64
» Top-K aggregation queries over large networks
Sort
View
APWEB
2004
Springer
15 years 3 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
IMC
2004
ACM
15 years 3 months ago
Characterizing the query behavior in peer-to-peer file sharing systems
This paper characterizes the query behavior of peers in a peer-topeer (P2P) file sharing system. In contrast to previous work, which provides various aggregate workload statistics...
Alexander Klemm, Christoph Lindemann, Mary K. Vern...
EDBT
2002
ACM
141views Database» more  EDBT 2002»
15 years 10 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
15 years 10 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 1 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan