Random databases and threshold for monotone non-recursive datalog

Authors:
Konstantin Korovin;Andrei Voronkov
Affiliations:
School of Computer Science, The University of Manchester;School of Computer Science, The University of Manchester
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 7
Cited 0

Threshold functions

Combinatorica
The reliability of queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A probabilistic view of Datalog parallelization

Theoretical Computer Science - Special issue: database theory
The complexity of query reliability

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Web as a graph

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
The Strange Logic of Random Graphs

The Strange Logic of Random Graphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we define a model of randomly generated databases and show how one can compute the threshold functions for queries expressible in monotone non-recursive datalog≠. We also show that monotone non-recursive datalog≠ cannot express any property with a sharp threshold. Finally, we show that non-recursive datalog≠ has a 0–1 law for a large class of probability functions, defined in the paper.