On the Complexity of Enumerating the Answers to Well-designed Pattern Trees
ICDT, pp. 22:1-22:18, 2016.
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 c...More
Full Text (Upload PDF)
PPT (Upload PPT)