Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Karp-Luby Sampling

  • Peter J. HaasEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80765



Karp-Luby (KL) sampling [1, 2] is a Monte Carlo algorithm that is used to estimate the number of truth assignments to a set of literals x = {x1, …, xk} that satisfy a logical expression L[x] having “disjunctive normal form” (DNF). That is, L[x] has the form C1C2 ∨⋯ ∨ Cm, where each clause Ci is a conjunction of the form \(C_i=y_{i_1}\wedge y_{i_2}\wedge \cdots \wedge y_{i_l}\)

This is a preview of subscription content, log in to check access.


  1. 1.
    Karp RM, Luby M. Monte-Carlo algorithms for enumeration and reliability problems. In: Proceedings of the IEEE Conference on Foundations of Computer Science; 1983. p. 56–64.Google Scholar
  2. 2.
    Karp RM, Luby M, Madras N. Monte-Carlo approximation algorithms for enumeration problems. J Algorithms. 1989;10(3):429–48.MathSciNetCrossRefGoogle Scholar
  3. 3.
    Vazirani VV. Approximation algorithms. Berlin/New York: Springer; 2001.zbMATHGoogle Scholar
  4. 4.
    Suciu D, Olteanu D, Ré C, Koch C. Probabilistic databases. Synthesis lectures on data management. Morgan & Claypool; 2011.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.IBM Almaden Research CenterSan JoseUSA