On the Complexity of Enumerating the Answers to Well-designed Pattern Trees

Well-designed pattern trees (wdPTs) have been introduced as an extension of conjunctive queries to allow for partial matching – analogously to the OPTIONAL operator of the semantic web query language SPARQL. Several computational problems of wdPTs have been studied in recent years, such as the evaluation problem in various settings, the counting problem, as well as static analysis tasks including the containment and equivalence problems. Also restrictions needed to achieve tractability of these tasks have been proposed. In contrast, the problem of enumerating the answers to a wdPT has been largely ignored so far. In this work, we embark on a systematic study of the complexity of the enumeration problem of wdPTs. As our main result, we identify several tractable and intractable cases of this problem both from a classical complexity point of view and from a parameterized complexity point of view. 1998 ACM Subject Classification H.2.3 Database Management – Languages Keywords and phr...

• Type: Journal
• Year: 2016
• Where: ICDT
• Authors: Markus Kröll, Reinhard Pichler, Sebastian Skritek
• Keywords: Database, ICDT 2016