Query Evaluation on a Database Given by a Random Graph

  • Authors:

  • Nilesh Dalvi

  • Affiliations:

  • Yahoo! Research, Santa Clara, CA, USA

  • Venue:
  • Theory of Computing Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.