Location of Repository

MSO Querying over Trees via Datalog Evaluation

By Eugénie Foustoucos and Labrini Kalantzi

Abstract

Abstract. The MSO evaluation problem on trees is the problem of computing, for any MSO formula φ and any finite tree T,thesetofsatisfying assignments of φ(X1,...,Xk) overT. In [3] we considered the MSO evaluation problem on full binary trees as a Datalog query evaluation problem, and gave a Datalog-theoretic solution to it for any MSO formula φ; we thus subsumed previous results obtained for a restricted class of MSO, namely for unary MSO queries. In the present paper we extend the results of [3] both to r-ary trees and to unranked trees, thus providing a general Datalog-theoretic solution to the problem for the class of finite trees.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.373.2021
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.softlab.ntua.gr/~ni... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.