Languages, automata, and logic
Handbook of formal languages, vol. 3
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantic characterizations of navigational XPath
ACM SIGMOD Record
Learning accurate, compact, and interpretable tree annotation
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Event queries on correlated probabilistic streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Information Processing Letters
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the expressiveness of probabilistic XML models
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Querying parse trees of stochastic context-free grammars
Proceedings of the 13th International Conference on Database Theory
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On models and query languages for probabilistic processes
ACM SIGMOD Record
Querying probabilistic business processes for sub-flows
Proceedings of the 14th International Conference on Database Theory
A probabilistic XML merging tool
Proceedings of the 14th International Conference on Extending Database Technology
Value joins are expensive over (probabilistic) XML
Proceedings of the 4th International Workshop on Logic in Databases
Efficient query evaluation over probabilistic XML with long-distance dependencies
Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
A quest for beauty and wealth (or, business processes for database researchers)
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Capturing continuous data and answering aggregate queries in probabilistic XML
ACM Transactions on Database Systems (TODS)
Finding optimal probabilistic generators for XML collections
Proceedings of the 15th International Conference on Database Theory
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
On the connections between relational and XML probabilistic data models
BNCOD'13 Proceedings of the 29th British National conference on Big Data
| Hi-index | 0.00 |
We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. We show that RMCs subsume several existing probabilistic XML models. In contrast to the latter, RMC models (i) capture probabilistic versions of XML schema languages such as DTDs, (ii) can be exponentially more succinct, and (iii) do not restrict the domain of probability distributions to be finite. We investigate RMC models for which tractability can be achieved, and identify several tractable fragments that subsume known tractable probabilistic XML models. We then look at the space of models between existing probabilistic XML formalisms and RMCs, giving results on the expressiveness and succinctness of RMC subclasses, both with each other and with prior formalisms.