Go to main content

PDF

Description

We present a simple, intuitive algorithm for the problem of finding an approximate list of the k most frequent items in a data stream when the item frequencies are Zipf-distributed. Our result improves the previous result of Charikar, Chen and Farach-Colton for the same problem when the Zipf parameter is low. We also highlight an application of the algorithm to web caching that may be of practical interest.

Details

Title
An Improved Frequent Items Algorithm with Applications to Web Caching
Creator
Computer Science Division, Publisher
Rao, Satish, Author
Chen, Kevin, Author
Published
1905-06-27
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-05-1383
Type
Text
Format
technical reports
Extent
12 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
Collection

Files

Statistics

from
to
Export
Download Full History
Download
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket