Challenges for Efficient Query Evaluation on Structured Probabilistic Data

Query answering over probabilistic data is an important task but is generally intractable. However, a new approach for this problem has recently been proposed, based on structural decompositions of input databases, following, e.g., tree decompositions. This paper presents a vision for a database management system for probabilistic data built following this structural approach. We review our existing and ongoing work on this topic and highlight many theoretical and practical challenges that remain to be addressed.

[1]  Fang Wei-Kleiner,et al.  TEDI: Efficient Shortest Path Query Answering on Graphs , 2010, Graph Data Management.

[2]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs VIII: Orientations , 1995, Ann. Pure Appl. Log..

[3]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[4]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[5]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[6]  Michael Benedikt,et al.  A Step Up in Expressiveness of Decidable Fixpoint Logics , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[7]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[8]  A. Amarilli,et al.  Leveraging the structure of uncertain data , 2016 .

[9]  Sergio Greco,et al.  Querying Graph Databases , 2000, EDBT.

[10]  Arie M. C. A. Koster,et al.  Treewidth computations II. Lower bounds , 2011, Inf. Comput..

[11]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[12]  Reynold Cheng,et al.  ProbTree: a query-efficient representation of probabilistic graphs , 2014 .

[13]  Dan Olteanu,et al.  MayBMS: a probabilistic database management system , 2009, SIGMOD Conference.

[14]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[15]  Pierre Senellart,et al.  Tractable Lineages on Treelike Instances: Limits and Extensions , 2016, PODS.

[16]  Pierre Senellart,et al.  Provenance Circuits for Trees and Treelike Instances , 2015, ICALP.

[17]  W. Marsden.  I and J , 2012 .

[18]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[19]  Dietmar Berwanger,et al.  Games and Model Checking for Guarded Logics , 2001, LPAR.

[20]  Arie M. C. A. Koster,et al.  Treewidth computations I. Upper bounds , 2010, Inf. Comput..

[21]  Thomas Colcombet,et al.  The Complexity of Boundedness for Guarded Logics , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[22]  Dan Suciu,et al.  Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.

[23]  Adnan Darwiche,et al.  On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision , 2001, J. Appl. Non Class. Logics.

[24]  Mikaël Monet,et al.  Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances , 2016, SIGMOD PhD Symposium.