Sciweavers

316 search results - page 12 / 64
» Top-K aggregation queries over large networks
Sort
View
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
15 years 2 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 10 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
SENSYS
2004
ACM
15 years 3 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...
CLUSTER
2005
IEEE
15 years 3 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
SIGMOD
1997
ACM
180views Database» more  SIGMOD 1997»
15 years 1 months ago
Online Aggregation
Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventual...
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wan...