Probabilistic counting algorithms for data base applications
From MaRDI portal
Publication:1069325
DOI10.1016/0022-0000(85)90041-8zbMATH Open0583.68059DBLPjournals/jcss/FlajoletM85OpenAlexW2025051251WikidataQ59831137 ScholiaQ59831137MaRDI QIDQ1069325FDOQ1069325
Authors: Philippe Flajolet, G. Nigel Martin 
Publication date: 1985
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00076244/file/RR-0313.pdf
Recommendations
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- A statistical analysis of probabilistic counting algorithms
- How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
- scientific article; zbMATH DE number 2019620
- A flexible way of counting large numbers approximately in small registers
Cites Work
Cited In (90)
- Efficient aggregation algorithms for probabilistic data
- Incremental delay enumeration: space and time
- Title not available (Why is that?)
- More infinite products: Thue-Morse and the gamma function
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- Efficient exact algorithm for count distinct problem
- Prefixes of infinite words and ambiguous context-free languages
- Mellin transforms and asymptotics: Harmonic sums
- Statistical estimation with bounded memory
- Accurate and precise aggregation counting
- Approximating the size of a radio network in beeping model
- On finding common neighborhoods in massive graphs.
- A note on compressed sensing and the complexity of matrix multiplication
- Title not available (Why is that?)
- Mellin transforms and asymptotics. The mergesort recurrence
- Analytical depoissonization and its applications
- Binary vectors for fast distance and similarity estimation
- Estimating hybrid frequency moments of data streams
- Sampling to estimate the number of duplicates in a database
- Gap-free compositions and gap-free samples of geometric random variables
- On adaptive sampling
- The largest missing value in a sample of geometric random variables
- Secure and efficient multiparty private set intersection cardinality
- A result in order statistics related to probabilistic counting
- A statistical analysis of probabilistic counting algorithms
- Hierarchical sampling from sketches: Estimating functions over data streams
- Combinatorics of geometrically distributed random variables: Left-to-right maxima
- Spatially-decaying aggregation over a network
- How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
- A general method for estimating correlated aggregates over a data stream
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- On the distribution for the duration of a randomized leader election algorithm
- Title not available (Why is that?)
- Streaming techniques and data aggregation in networks of tiny artefacts
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Algorithms and Computation
- Probabilistic analysis of adaptative sampling
- The visibility parameter for words and permutations
- A unified scheme for generalizing cardinality estimators to sum aggregation
- Streaming algorithms for multitasking scheduling with shared processing
- Paperfolding infinite products and the gamma function
- A flexible way of counting large numbers approximately in small registers
- The number of distinct values in a geometrically distributed sample
- Distinctness of compositions of an integer: A probabilistic analysis
- Two improved range-efficient algorithms for \(F_0\) estimation
- Occupancy schemes associated to Yule processes
- Model counting meets \(F_0\) estimation
- Distributed data clustering in sensor networks
- Combinatorics of geometrically distributed random variables: Run statistics
- LogLog counting of large cardinalities (extended abstract)
- The cost of fault tolerance in multi-party communication complexity
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
- Measuring the impact of MVC attack in large complex networks
- Efficient estimation of the cardinality of large data sets
- Automata theory on sliding windows
- Analytic analysis of algorithms
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
- A variation of the Newton-Pepys problem and its connections to size-estimation problems
- The zeta-regularized product of odious numbers
- Efficient sampling strategies for relational database operations
- Aggregate query processing in the presence of duplicates in wireless sensor networks
- Depth First Search in the Semi-streaming Model
- Distinct counting with a self-learning bitmap
- Granular counting of uncertain data
- Space‐efficient tracking of persistent items in a massive data stream
- A Note on Estimating Hybrid Frequency Moment of Data Streams
- Title not available (Why is that?)
- Transcendental infinite products associated with the \(\pm 1\) Thue-Morse sequence
- Title not available (Why is that?)
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
- Counting distinct items over update streams
- Estimation of the Density of Datasets with Decision Diagrams
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Simplified Planar Coresets for Data Streams
- Approximate counting with a floating-point counter
- On approximating matrix norms in data streams
- LiMoSense: live monitoring in dynamic sensor networks
- Philippe Flajolet's early work in combinatorics
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- Give me some slack: efficient network measurements
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Fast size approximation of a radio network in beeping model
- Continuous monitoring of \(\ell_p\) norms in data streams
- The online space complexity of probabilistic languages
- Summary data structures for massive data
- On the number of active nodes in a multicomputer system
- Adversarially robust streaming algorithms via differential privacy
- Accelerate the classification statistics in RFID systems
- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
This page was built for publication: Probabilistic counting algorithms for data base applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069325)
