Output details
11 - Computer Science and Informatics
University of Oxford
Return to search
Output 0 of 0 in the submission
Article title
Probabilistic XML via Markov chains
Type
D - Journal article
DOI
-
Title of journal
Proceedings of the VLDB Endowment
Article number
-
Volume number
3
Issue number
1-2
First page of article
770
ISSN of journal
2150-8097
Year of publication
2010
Number of additional authors
3
Additional information
<15>
Traditional probabilistic models for databases rely on the idea of probabilistic annotations over data fragments. For example, in probabilistic XML the annotations are over nodes of data trees and they define probability distributions over the children of annotated nodes. This paper proposes a different approach to probabilistic XML databases: to use probabilistic tree generators based on Recursive Markov Chains (RMCs). To this effect RMCs are slightly extended to allow for tree generation. For the proposed model and its restrictions the paper studies query answering with monadic second-order logic. This significantly extends complexity results on query answering over RMCs.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
11
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
