Abstract
This paper proposes a restricted class of DTDs, called MDC? + #-DTDs, such that the absolute consistency problem of XML schema mappings is solvable in polynomial time. To the best of the authors’ knowledge, tractability results on absolute consistency have been obtained only for XML schema mappings between nested-relational DTDs, which are a proper subclass of non-recursive, disjunction-free DTDs. MDC? + #-DTDs are a proper superclass of nested-relational DTDs, where recursion and disjunction are allowed but every label can appear at most once or unboundedly many times as children of a node. We show that the absolute consistency problem of XML schema mappings between MDC? + #-DTDs is solvable in polynomial time if the dependencies are specified by (1) self, child, parent, following-sibling, preceding-sibling, and data value equality operators; or (2) self, child, following-sibling, preceding-sibling, qualifier, and data value equality operators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amano, S., Libkin, L., Murlak, F.: XML schema mappings. In: Proc. 28th PODS, pp. 33–42 (2009)
Ishihara, Y., Kuwada, H., Fujiwara, T.: The absolute consistency problem of XML schema mappings with data values between restricted DTDs (2014), http://www-infosec.ist.osaka-u.ac.jp/~ishihara/papers/dexa14-full.pdf
Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. Journal of the ACM 55(2) (2008)
Arenas, M., Libkin, L.: XML data exchange: Consistency and query answering. Journal of the ACM 55(2) (2008)
Arenas, M., Barcelo, P., Libkin, L., Murlak, F.: Relational and XML Data Exchange. Morgan & Claypool (2010)
Kuwada, H., Hashimoto, K., Ishihara, Y., Fujiwara, T.: The consistency and absolute consistency problems of XML schema mappings between restricted dTDs. In: Ishikawa, Y., Li, J., Wang, W., Zhang, R., Zhang, W. (eds.) APWeb 2013. LNCS, vol. 7808, pp. 228–239. Springer, Heidelberg (2013); (An extended version is to appear in World Wide Web Journal)
Ishihara, Y., Morimoto, T., Shimizu, S., Hashimoto, K., Fujiwara, T.: A tractable subclass of dTDs for xPath satisfiability with sibling axes. In: Gardner, P., Geerts, F. (eds.) DBPL 2009. LNCS, vol. 5708, pp. 68–83. Springer, Heidelberg (2009)
Ishihara, Y., Suzuki, N., Hashimoto, K., Shimizu, S., Fujiwara, T.: XPath satisfiability with parent axes or qualifiers is tractable under many of real-world DTDs. In: Proc. 14th DBPL (2013), http://arxiv.org/abs/1308.0769
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ishihara, Y., Kuwada, H., Fujiwara, T. (2014). The Absolute Consistency Problem of XML Schema Mappings with Data Values between Restricted DTDs. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 2014. Lecture Notes in Computer Science, vol 8644. Springer, Cham. https://doi.org/10.1007/978-3-319-10073-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-10073-9_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10072-2
Online ISBN: 978-3-319-10073-9
eBook Packages: Computer ScienceComputer Science (R0)