Computing on Data Streams (1998) [126 citations — 2 self]
Download:
http://gatekeeper.research.compaq.com/pub/DEC/SRC/
http://gatekeeper.research.compaq.com/pub/DEC/SRC/
http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-T
CACHED:
|
http://gatekeeper.research.compaq.com/pub/DEC/SRC/
http://gatekeeper.research.compaq.com/pub/DEC/SRC/
http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-T
CACHED:
|
by
Monika Rauch Henzinger
,
Prabhakar Raghavan
,
Sridar Rajagopalan
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Henzinger98computingon,
author = {Monika Rauch Henzinger and Prabhakar Raghavan and Sridar Rajagopalan},
title = {Computing on Data Streams},
year = {1998}
}
author = {Monika Rauch Henzinger and Prabhakar Raghavan and Sridar Rajagopalan},
title = {Computing on Data Streams},
year = {1998}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
In this paper we study the space requirement of algorithms that make only one (or a small number of) pass(es) over the input data. We study such algorithms under a model of data streams that we introduce here. We give a number of upper and lower bounds for problems stemming from queryprocessing, invoking in the process tools from the area of communication complexity.
