The eternal sunshine of the sketch data structure
Authors:
- Xenofontas DimitropoulosXDXenofontas Dimitropoulos
- Marc StoecklinMSMarc Stoecklin
- Paul HurleyPHPaul Hurley
- Andreas KindAKAndreas Kind
- 1 December 2008
- journal article
- Published by Elsevier in Computer Networks
- Vol. 52 (17) , 3248-3257
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection2006
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- Improving sketch reconstruction accuracy using linear least squares method2005
- Data streaming algorithms for efficient and accurate estimation of flow size distribution2004
- Sketch-based change detection2003
- New directions in traffic measurement and accountingACM SIGCOMM Computer Communication Review, 2002
- Finding Frequent Items in Data Streams2002
- How to Summarize the Universe2002
- Tracking join and self-join sizes in limited storage1999
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970