Sciweavers

750 search results - page 68 / 150
» Aggregates in Possibilistic Databases
Sort
View
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
14 years 10 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 4 months ago
Region Sampling: Continuous Adaptive Sampling on Sensor Networks
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gaut...
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
14 years 3 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
VLDB
1999
ACM
133views Database» more  VLDB 1999»
14 years 2 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
VLDB
1998
ACM
105views Database» more  VLDB 1998»
14 years 2 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...