Asymptotic conditional probabilities for conjunctive queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3363 LNCS, Issue , 2005, Pages 289-305

  Dalvi, Nilesh ^a   Miklau, Gerome ^a   Suciu, Dan ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PROBABILITIES; CONDITIONAL PROBABILITIES; CONJUNCTIVE QUERIES; DATABASE PROBLEMS; GRAPH SIZES; LIKE QUERIES; PROBABILISTIC MODELS;

ASYMPTOTIC ANALYSIS; DATABASE SYSTEMS;

PROBABILITY;

EID: 77049096943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_20     Document Type: Conference Paper

References (12)

1. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In Conference on Very Large Data Bases, 2004.
2. P. Erdös and A. Rényi. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kut. Int. Kozl., 5:17-61, 1960.
3. R. Fagin. Probabilities on finite models. Journal of Symbolic Logic, 41(1):50-58, 1976.
4. C. Fortuin, P. Kasteleyn, and J. Ginibre. Correlation inequalities on some partially ordered sets. Comm.in Math. Physics, 22:89-103, 1971.
5. N. Fuhr and T. Rlleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Transactions on Information Sysytems, 15(1):32-66, 1997.
6. Y. V. Glebskiǐ, D. I. Kogan, M. I. Liogon'kiǐ, and V. A. Talanov. Range and degree of realizability of formulas in the restricted predicate calculus. Kibernetika, 2:17-28, 1969. [Engl. Transl. Cybernetics, vol. 5, 142-154 (1972)].
7. A. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270-294, 2001.
8. M. I. Liogon'kiǐ. On the conditional satisfyability ratio of logical formulas. Mathematical Notes of the Academy of the USSR, 6:856-861, 1969.
9. J. F. Lynch. Probabilities of sentences about very sparse random graphs. Random Struct. Algorithms, 3(1):33-54, 1992.
10. G. Miklau and D. Suciu. A formal analysis of information disclosure in data exchange. In ACM SIGMOD International Conference on Management of Data, pages 563-574, June 2004.
11. C. E. Shannon. Communication theory of secrecy systems. In Bell System Technical Journal, 1949.
12. J. Spencer and S. Shelah. Zero-one laws for sparse random graphs. J. Amer. Math. Soc., pages 97-115, 1988.