Blog
About


  • Record: found
  • Abstract: found
  • Article: found
Is Open Access

Dissociation and Propagation for Efficient Query Evaluation over Probabilistic Databases

,

1310.6257

Read Bookmark
      There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

      Abstract

      Probabilistic inference over large data sets is a challenging data management problem as exact inference is generally #P-hard and requires sampling-based methods. This paper proposes an alternative approach for approximate evaluation of queries with probabilistic databases: In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum. We provide an algorithm that takes into account important schema information to enumerate only the minimal necessary plans among all possible plans. Importantly, this algorithm is a strict generalization of all known PTIME self-join-free conjunctive queries: A query is in PTIME if and only if our algorithm returns one single plan. Furthermore, our approach is a generalization of a family of efficient ranking functions from graphs to hypergraphs. We also apply three relational query optimization techniques to evaluate all minimal plans very fast. We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers. We also note that the techniques developed in this paper apply immediately to lifted inference from statistical relational models since lifted inference corresponds to PTIME plans in probabilistic databases.

      Related collections

      Author and article information

      Journal
      2013-10-23
      2016-01-02

      http://arxiv.org/licenses/nonexclusive-distrib/1.0/

      Custom metadata
      32 pages, 25 figures, full version of arXiv:1412.1069 [ PVLDB 8(5):629-640, 2015: "Approximate lifted inference with probabilistic databases", http://www.vldb.org/pvldb/vol8/p629-gatterbauer.pdf ]
      cs.DB cs.AI
      ScienceOpen disciplines:

      Comments

      Comment on this article

      Register to benefit from advanced discovery features on more than 34,000,000 articles

      Already registered?

      Email*:
      Password*: