Efficient inclusion for a class of XML types with interleaving and counting

DOI10.1016/J.IS.2008.10.001zbMath1294.68067OpenAlexW1989200519MaRDI QIDQ964806

Giorgio Ghelli, Carlo Sartiani, Dario Colazzo

Publication date: 21 April 2010

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: http://eprints.adm.unipi.it/552/1/GheColSar08%2Dis.pdf

zbMATH Keywords

XMLregular expressionssubtypingXML schema

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (6)

Deciding definability by deterministic regular expressions ⋮ Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking ⋮ Schemas for unordered XML on a DIME ⋮ Efficient inclusion for a class of XML types with interleaving and counting ⋮ Weak Inclusion for XML Types ⋮ Regular Expressions with Counting: Weak versus Strong Determinism

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient inclusion for a class of XML types with interleaving and counting
• Tree pattern query minimization
• Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
• Mathematical Foundations of Computer Science 2004

This page was built for publication: Efficient inclusion for a class of XML types with interleaving and counting