Weighted monadic datalog

Authors:
Torsten Stüber;Heiko Vogler
Affiliations:
Faculty of Computer Science, Technische Universität Dresden, D-01062 Dresden, Germany;Faculty of Computer Science, Technische Universität Dresden, D-01062 Dresden, Germany
Venue:
Theoretical Computer Science
Year:
2008

Citing 18
Cited 2

Weighted grammars and Kleene's theorem

Information Processing Letters
A query language and optimization techniques for unstructured data

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Cut and paste

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semiring-based constraint logic programming: syntax and semantics

ACM Transactions on Programming Languages and Systems (TOPLAS)
Query automata over finite trees

Theoretical Computer Science
Soft Constraint Logic Programming and Generalized Shortest Path Problems

Journal of Heuristics
Monadic Queries over Tree-Structured Data

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Automata, Logic, and XML

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Formal tree series

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
Weighted path queries on semistructured databases

Information and Computation
Weighted tree automata and weighted logics

Theoretical Computer Science
Weighted automata and weighted logics

Theoretical Computer Science
Handbook of Weighted Automata

Handbook of Weighted Automata
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
Tree acceptors and some of their applications

Journal of Computer and System Sciences
Weighted automata and weighted logics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Bisimulation Minimisation of Weighted Automata on Unranked Trees

Fundamenta Informaticae
Bisimulation Minimisation of Weighted Automata on Unranked Trees

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

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 S. 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) S is commutative and the underlying datalog program is non-circular or (ii) S is a finite and commutative @w-cpo semiring.