See this document in CiteSeerX!

Probabilistic Counting Algorithms for Data Base Applications (1985)  (Make Corrections)  (45 citations)
Philippe Flajolet, G. N. Martin
Journal of Computer and System Sciences



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
algo.inria.fr/flajolet/P...FlMa85.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help
Problem Downloading?
From:  algo.inria.fr/flajolet/...publist (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper introduces a class of probabilistic counting lgorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) and only a few operations per element scanned. The algorithms are based on statistical observations made on bits of hashed values of records. They are by con- struction totally insensitive to the... (Update)

Context of citations to this paper:   More

.... several large data set applications (e.g. the number of distinct queries made to a search engine over a week) Flajolet and Martin [FM85] designed the first algorithm for approximating F 0 in the data stream (or what was then thought of as a one pass) model. Unfortunately,...

Cited by:   More
Reversible Sketches for Efficient and Accurate Change .. - Schweller, Gupta.. (2004)   (Correct)
Mutable Strings in Java: Design, Implementation and.. - Boldi, Vigna   (Correct)
Spatio-Temporal Aggregation Using Sketches - Tao, Kollios, Considine, Li.. (2004)   (Correct)

Active bibliography (related documents):   More   All
0.5:   On Adaptive Sampling - Flajolet (1990)   (Correct)
0.1:   The Space Complexity of Approximating the Frequency Moments - Alon, Matias, Szegedy (1996)   (Correct)
0.1:   Aqua Project White Paper - Gibbons, Matias, Poosala (1997)   (Correct)

Similar documents based on text:   More   All
0.2:   Permutation Separations and Complete Bipartite Factorisations.. - Martin, Stong (2003)   (Correct)
0.2:   Analysis Of A Splitting Process Arising In.. - Kirschenhofer.. (1996)   (Correct)
0.2:   Non-Oscillatory Central Differencing For Hyperbolic.. - Nessyahu, Tadmor (1990)   (Correct)

Related documents from co-citation:   More   All
13:   The space complexity of approximating the frequency moments - Alon, Matias et al. - 1996
11:   Approximate counting: a detailed analysis (context) - Flajolet - 1985
10:   A linear-time probabilistic counting algorithm for db applications (context) - Whang, Vander-Zanden et al. - 1990

BibTeX entry:   (Update)

P. Flajolet and G.N. Martin. Probabilistic counting algorithms for database applications. Journal of Computer and System Sciences, 31(2):182--209, Oct. 1985. http://citeseer.ist.psu.edu/flajolet85probabilistic.html   More

@article{ flajolet85probabilistic,
    author = "Philippe Flajolet and G. Nigel Martin",
    title = "Probabilistic Counting Algorithms for Data Base Applications",
    journal = "Journal of Computer and System Sciences",
    volume = "31",
    number = "2",
    pages = "182-209",
    year = "1985",
    url = "citeseer.ist.psu.edu/flajolet85probabilistic.html" }
Citations (may not include all citations):
35   Handbuch der Laplace-Transformation (context) - DOETSCH - 1950
26   Probabilistic counting (context) - ANON - 1983  DBLP
25   Approximate counting: A detailed analysis (context) - FLAJOLET - 1985  ACM   DBLP
18   Counting large numbers of events in small registers (context) - MORRIS - 1978  ACM   DBLP
12   Sorting and searching in multisets (context) - MUNRO, SPIRA - 1976  DBLP
9   Access Path Selection in A Relational Database Management Sy.. (context) - SELINGER, ASTRAHAN et al. - 1979  ACM   DBLP
2   Key to address transformations: A fundamental study based on.. (context) - LUM, YUEN et al. - 1971
1   The Art of Computer Programming: Sorting and Searching (context) - KNUTn - 1973



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://algo.inria.fr/flajolet/Publications/publist.html):   More
Dynamical Sources in Information Theory: A General .. - Clément.. (1999)   (Correct)
Motif Statistics - Nicodème, Salvy, Flajolet (1999)   (Correct)
Hidden Pattern Statistics - Flajolet, Guivarc'h, al. (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC