NDLI: Range-efficient computation of F/sub 0/ over massive data streams

Content Provider	IEEE Xplore Digital Library
Author	Pavan, A. Tirthapura, S.
Copyright Year	2005
Description	Author affiliation: Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA (Pavan, A.)
Abstract	Efficient one-pass computation of F/sub 0/, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider the problem of efficiently estimating F/sub 0/ of a data stream where each element of the stream is an interval of integers. We present a randomized algorithm which gives an (/spl epsiv/, /spl delta/) approximation of F/sub 0/, with the following time complexity (n is the size of the universe of the items): (1) the amortized processing time per interval is O(log1//spl delta/ log n//spl epsiv/). (2) The time to answer a query for F/sub 0/ is O(log1//spl delta/). The workspace used is O(1//spl epsiv//sup 2/log1//spl delta/logn) bits. Our algorithm improves upon a previous algorithm by Bar-Yossef Kumar and Sivakumar (2002), which requires O(1//spl epsiv//sup 5/log1//spl delta/log/sup 5/n) processing time per item. Our algorithm can be used to compute the max-dominance norm of a stream of multiple signals, and significantly improves upon the current best bounds due to Cormode and Muthukrishnan (2003). This also provides efficient and novel solutions for data aggregation problems in sensor networks studied by Nath and Gibbons (2004) and Considine et. al. (2004).
Sponsorship	IEEE Comput. Soc. Database Soc. of Japan (DBSJ) Inf. Process. Soc. of Japan (IPSJ) Inst. of Electron., Inf. and Commun. Eng. (IEICE)
Starting Page	32
Ending Page	43
File Size	241012
Page Count	12
File Format	PDF
ISBN	0769522858
ISSN	10844627
DOI	10.1109/ICDE.2005.118
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-04-05
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Aggregates Frequency estimation Computer networks Databases Algorithm design and analysis Approximation algorithms Query processing
Content Type	Text
Resource Type	Article
Subject	Signal Processing Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Sketching Sampled Data Streams

A Chaos-Based Predictive Algorithm for Continuous Aggregate Queries over Data Streams

Evaluating Probabilistic Queries over Uncertain Matching

An Information Divergence Estimation over Data Streams

Data Streams Join Aggregate Algorithms Based on Compound Sliding Window

Space-Efficient Estimation of Statistics Over Sub-Sampled Streams

Stabbing the sky: efficient skyline computation over sliding windows

and S.Tirthapura, “Range-efficient computation of F0 over massive data streams

Processing of Rank Joins in Highly Distributed Systems

Range-efficient computation of F/sub 0/ over massive data streams

Similar Documents

Sketching Sampled Data Streams

A Chaos-Based Predictive Algorithm for Continuous Aggregate Queries over Data Streams

Evaluating Probabilistic Queries over Uncertain Matching

An Information Divergence Estimation over Data Streams

Data Streams Join Aggregate Algorithms Based on Compound Sliding Window

Space-Efficient Estimation of Statistics Over Sub-Sampled Streams

Stabbing the sky: efficient skyline computation over sliding windows

and S.Tirthapura, “Range-efficient computation of F0 over massive data streams

Processing of Rank Joins in Highly Distributed Systems

Range-efficient computation of F/sub 0/ over massive data streams