Back to Search
Start Over
Weighted monadic datalog
- Source :
-
Theoretical Computer Science . Aug2008, Vol. 403 Issue 2/3, p221-238. 18p. - Publication Year :
- 2008
-
Abstract
- Abstract: Based on monadic datalog, we introduce the concept of weighted monadic datalog over unranked trees. This provides a query language that can be used to extract quantitative information from semi-structured databases where the quantities are taken from some semiring . We show that weighted monadic datalog is as expressive as weighted tree automata on unranked trees. Moreover, we prove that a query can be evaluated efficiently on an unranked tree provided that (i) is commutative and the underlying datalog program is non-circular or (ii) is a finite and commutative -cpo semiring. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 403
- Issue :
- 2/3
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 33632072
- Full Text :
- https://doi.org/10.1016/j.tcs.2008.04.025