Query evaluation on a database given by a random graph

Abstract. We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn −α, where n is the number of vertices, α, β are fixed and α> 1 (α> arity − 1 for structures of higher arity). We consider conjunctive properties over these random graphs, and investigate the problem of computing their asymptotic conditional probabilities. This provides us a novel approach to dealing with uncertainty in databases, with applications to data privacy and other database problems.