NDLI: On the tractability of query compilation and bounded treewidth

Please wait, while we are loading the content...

Graph pattern matching revised for social network analysis

On the data complexity of consistent query answering

Highly expressive query languages for unordered data trees

Deciding eventual consistency for a simple class of relational transducer networks

Finding optimal probabilistic generators for XML collections

On the complexity of query answering over incomplete XML documents

Representation systems for data exchange

On the tractability of query compilation and bounded treewidth

Factorised representations of query results: size bounds and readability

Validating XML documents in the streaming model with external memory

Deciding twig-definability of node selecting tree automata

Win-move is coordination-free (sometimes)

Learning twig and path queries

Learning schema mappings

Computing universal models under guarded TGDs

Equivalence and minimization of conjunctive queries under combined semantics

Differentially private summaries for sparse data

Regular path queries on graphs with data

A normal form for preventing redundant tuples in relational databases

Bounded repairability for regular tree languages

Combining dependent annotations for relational algebra

Dynamic definability

Parallel skyline queries

On the tractability of query compilation and bounded treewidth

Content Provider	ACM Digital Library
Author	Jha, Abhay Suciu, Dan
Abstract	We consider the problem of computing the probability of a Boolean function, which generalizes the model counting problem. Given an OBDD for such a function, its probability can be computed in linear time in the size of the OBDD. In this paper we investigate the connection between treewidth and the size of the OBDD. Bounded treewidth has proven to be applicable to many graph problems, which are NP-hard in general but become tractable on graphs with bounded treewidth. However, it is less well understood how bounded treewidth can be used for the probability computation problem of a Boolean function. We introduce a new notion of treewidth of a Boolean function, called the expression treewidth, as the smallest treewidth of any DAG-expression representing the function. Our new notion of bounded treewidth includes some previously known tractable cases: all read-once Boolean functions, and all functions having a bounded treewidth of the primal graph or of the incidence graph also have a bounded expression treewidth. We show that bounded expression treewidth implies the existence of a polynomial size OBDD, and that bounded expression pathwidth implies the existence of a constant-width OBDD. We also show a converse of the latter result: constant-width OBDD imply bounded expression pathwidth. We then study the implications of these results to query compilation, where the Boolean function is the lineage of a fixed query on varying input databases. We give a syntactic characterizations of all UCQ≠ queries that admit a polynomial size OBDD, showing that these are precisely inversion-free queries with unrestricted use of ≠. It was previously known that inversion-free queries characterize precisely those UCQ queries that have a polynomial size OBDD, and that these also have a constant width OBDD: in contrast, inversion-free queries with ≠ have polynomial-width OBDD, thus using the full power of OBDD. Finally, we show that in the case of UCQ, the four classes studied in this paper collapse: bounded expression pathwidth, bounded expression treewidth, constant-width OBDD, and polynomial size OBDD.
Starting Page	249
Ending Page	261
Page Count	13
File Format	PDF
ISBN	9781450307918
DOI	10.1145/2274576.2274603
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-03-26
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Obdd Probabilistic databases Binary decision diagrams Knowledge compilation Treewidth
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in