132 search results - page 7 / 27 » Optimal approximations of the frequency moments of data stre... |
114
click to vote
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
101
click to vote
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
88
Voted
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...
61
Voted
ICDM
2007
IEEE
15 years 3 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...