Distributed XML design
From MaRDI portal
Publication:657904
DOI10.1016/j.jcss.2011.02.003zbMath1246.68066arXiv1012.2648OpenAlexW4206399782WikidataQ59259518 ScholiaQ59259518MaRDI QIDQ657904
Georg Gottlob, Marco Manna, Serge Abiteboul
Publication date: 11 January 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.2648
Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Internet topics (68M11)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
- Distributed XML design
- On the minimization of XML schemas and tree automata for unranked trees
- Space-bounded reducibility among combinatorial problems
- Deciding Equivalence of Finite Tree Automata
- Constructions for alternating finite automata∗
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
- Problems complete for deterministic logarithmic space
- Minimal NFA Problems are Hard
- Translating regular expressions into small ε-free nondeterministic finite automata
- Mathematical Foundations of Computer Science 2004
- One-unambiguous regular languages
This page was built for publication: Distributed XML design
