Sciweavers

223 search results - page 24 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
VLDB
2006
ACM
190views Database» more  VLDB 2006»
15 years 10 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
67
Voted
FSTTCS
2009
Springer
15 years 4 months ago
Functionally Private Approximations of Negligibly-Biased Estimators
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
André Madeira, S. Muthukrishnan
90
Voted
ICDM
2007
IEEE
254views Data Mining» more  ICDM 2007»
15 years 3 months ago
Sampling for Sequential Pattern Mining: From Static Databases to Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to gro...
Chedy Raïssi, Pascal Poncelet
107
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 3 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park