257 search results - page 35 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
155
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
PODS
2005
ACM
15 years 3 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
106
click to vote
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...