Abstract
XML data can be modeled as node-labeled graphs and XML queries can be expressed by structural relationships between labeled elements. XML query evaluation has been addressed using mainly database, and in some cases graph search, techniques. We propose an alternative method that models and solves such queries as constraint satisfaction problems (CSPs). We describe common constraint types occurring in XML queries and show how query evaluation can benefit from methods for preprocessing and solving CSPs. We identify an important non-binary constraint that is a common module of XML queries and describe a generalized arc consistency algorithm with low cost that can ensure polynomial query evaluation. Finally, we demonstrate that maintaining the consistency of such non-binary constraints can greatly accelerate search in intractable queries that include referential relationships.
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.
References
Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural joins: A primitive for efficient XML query pattern matching. In: Proceedings of IEEE ICDE (2002)
Bessière, C., Régin, J.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI (2001)
Chaudhri, A.B., Rashid, A., Zicari, R.: XML Data Management: Native XML and XMLEnabled Database Systems. Addison-Wesley, Reading (2003)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Freuder, E.: A sufficient condition for backtrack-free search. Journal of the ACM 29(1), 24–32 (1982)
Gent, I., Smith, B.: Symmetry Breaking in Constraint Programming. In: Proceedings of ECAI, pp. 599–603 (2000)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: Proceedings of VLDB (2002)
Gottlob, G., Koch, C., Pichler, R.: XPath query evaluation: Improving time and space efficiency. In: Proceedings of ICDE (2003)
Grust, T.: Accelerating XPath location steps. In: Proceedings of ACM SIGMOD (2002)
Jiang, H., Lu, H., Wang, W.: Efficient processing of XML twig queries with or-predicates. In: Proceedings of ACM SIGMOD (2004)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: Proceedings of ACM SIGMOD (2002)
Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2–45 (2004)
Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI (1994)
Régin, J.C., Rueher, M.: A global constraint combining a sum constraint and difference constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, p. 384. Springer, Heidelberg (2000)
Shanmugasundaram, J., Tufte, K., Zhang, C., He, G., DeWitt, D.J., Naughton, J.F.: Relational databases for querying XML documents: Limitations and opportunities. In: Proceedings of the VLDB Conference (1999)
Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of ACM PODS (2002)
Smith, B., Stergiou, K., Walsh, T.: Using auxiliary variables and implied constraints to model non-binary problems. In: Proceedings of AAAI (2000)
van Hentenryck, P., Deville, Y., Teng, C.-M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (1992)
WWWConsortium. XML Path Language (XPath) 2.0, W3C Working Draft (November 2003), http://www.w3.org/TR/xpath20/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mamoulis, N., Stergiou, K. (2004). Constraint Satisfaction in Semi-structured Data Graphs. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive