A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes

Authors:
Yasunori Ishihara;Takuji Morimoto;Shougo Shimizu;Kenji Hashimoto;Toru Fujiwara
Affiliations:
Osaka University, Japan;Osaka University, Japan;Advanced Institute of Industrial Technology, Japan;Nara Institute of Science and Technology, Japan;Osaka University, Japan
Venue:
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Year:
2009

Citing 10
Cited 4

Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
XPath satisfiability in the presence of DTDs

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Taxonomy of XML schema languages using formal language theory

ACM Transactions on Internet Technology (TOIT)
A system for the static analysis of XPath

ACM Transactions on Information Systems (TOIS)
Efficient static analysis of XML paths and types

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Deciding XPath containment with MSO

Data & Knowledge Engineering
On testing satisfiability of tree pattern queries

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
XPath satisfiability in the presence of DTDs

Journal of the ACM (JACM)
Satisfiability of XPath queries with sibling axes

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
XPath query satisfiability is in PTIME for real-world DTDs

XSym'07 Proceedings of the 5th international conference on Database and XML Technologies

Extending the tractability results on XPath satisfiability with sibling axes

XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
XPath satisfiability with downward and sibling axes is tractable under most of real-world DTDs

Proceedings of the twelfth international workshop on Web information and data management
Model-Checking Parse Trees

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a tractable subclass of DTDs, called DC-DTDs, for XPath satisfiability with sibling axes. A DC-DTD is a DTD such that each content model is in the form of a concatenation of single tag names and Kleene-starred regular expressions. DC-DTDs are a proper subclass of covering DTDs proposed by Montazerian et al., and a proper superclass of disjunction-free DTDs. In this paper, it is shown that tractability by covering DTDs is fragile against sibling axes. Then, tractability of XPath satisfiability with sibling axes under DC-DTDs is demonstrated. Finally, as a limitation of the tractability of DC-DTDs, it is shown that upward axes appearing in qualifiers bring intractability under even disjunction-free DTDs.