Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 37, No. 2, pp. 359379
 

Summary: SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics
Vol. 37, No. 2, pp. 359­379
RANGE-EFFICIENT COUNTING OF DISTINCT ELEMENTS IN A
MASSIVE DATA STREAM
A. PAVAN AND SRIKANTA TIRTHAPURA
Abstract. Efficient one-pass estimation of F0, the number of distinct elements in a data stream,
is a fundamental problem arising in various contexts in databases and networking. We consider range-
efficient estimation of F0: estimation of the number of distinct elements in a data stream where each
element of the stream is not just a single integer but an interval of integers. We present a randomized
algorithm which yields an ( , )-approximation of F0, with the following time and space complexi-
ties (n is the size of the universe of the items): (1) The amortized processing time per interval is
O(log 1

log n
). (2) The workspace used is O( 1
2 log 1

log n) bits. Our algorithm improves upon a pre-
vious algorithm by Bar-Yossef, Kumar and Sivakumar [Proceedings of the 13th ACM­SIAM Sympo-
sium on Discrete Algorithms (SODA), 2002, pp. 623­632], which requires O( 1

  

Source: Aduri, Pavan - Department of Computer Science, Iowa State University
Tirthapura, Srikanta - Department of Electrical and Computer Engineering, Iowa State University

 

Collections: Computer Technologies and Information Sciences; Engineering