Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston  Home/Search
Context Related
| cmu.edu/~olston/public...dfiicde05.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: cmu.edu/~olston...ibutedFreqItems (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na ve methods of combining approximate frequency counts from multiple nodes tend to result in excessively large data structures that are costly to transfer among nodes. To minimize communication requirements, the degree of precision maintained by each node while counting item frequencies must be managed carefully. We introduce the concept of a precision... (Update)
Cited by: More
Sketching Streams through the Net: Distributed Approximate .. - Cormode, Garofalakis (2005) (Correct)
Active bibliography (related documents): More All
1.3: Finding (Recently) Frequent Items in Distributed Data.. - Manjhi, Shkapenyuk.. (2005) (Correct)
0.3: Tributaries and Deltas: Efficient and Robust Aggregation.. - Manjhi, Nath, Gibbons (2005) (Correct)
0.2: Local Flow Separation - Liberatore (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. "Finding (Recently) Frequent Items in Distributed Data Streams". IEEE ICDE, 2005. http://citeseer.ist.psu.edu/article/manjhi05finding.html More
@misc{ manjhi05finding,
author = "A. Manjhi and V. Shkapenyuk and K. Dhamdhere and C. Olston",
title = "Finding (Recently) Frequent Items in Distributed Data Streams",
text = "A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (Recently)
Frequent Items in Distributed Data Streams. IEEE ICDE, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/article/manjhi05finding.html" }
Citations (may not include all citations):910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994
111 New sampling-based summary statistics for improving approxim.. - Gibbons, Matias - 1998
83 New directions in traffic measurement and accounting - Estan, Varghese - 2002
67 Approximate frequency counts over data streams - Manku, Motwani - 2002
52 Computing iceberg queries efficiently - Fang, Shivakumar et al. - 1998
48 Finding frequent items in data streams - Charikar, Chen et al. - 2002
31 Estimating simple functions on the union of data streams - Gibbons, Tirthapura - 2001
29 distributed worm signature detection (context) - Kim, Karp et al. - 2004
26 Frequency estimation of internet packet streams with limited.. (context) - Demaine, Lopez-Ortiz et al. - 2003
25 A simple algorithm for finding frequent elements in streams .. - Karp, Shenker et al. - 2003
23 Distributed top-k monitoring - Babcock, Olston - 2003
17 Maintaining time-decaying stream aggregates (context) - Cohen, Strauss - 2003
7 Detecting DDoS attacks on ISP networks - Akella, Bharambe et al. - 2003
7 Power-conserving computation of order-statistics over sensor.. - Greenwald, Khanna - 2004
6 frequent items in distributed data streams (context) - Manjhi, Shkapenyuk et al. - 2004
5 Efficient computation of iceberg queries with complex measur.. (context) - Han, Pei et al. - 2001
5 Approximate quantiles and frequency counts over sliding wind.. (context) - Arasu, Manku - 2004
5 What's hot and what's not: Tracking frequent items dynamical.. (context) - Cormode, Muthukrishnan - 2003
http://slashdot.org
http://www.cs
http://www.ebay.com
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC