Abstract
In this paper we introduce named expressions, with which a name can be assigned to an XPath expression, and then this name can be used wherever a location step may occur. Named expressions may contain other named expressions or themselves, which gives rise to a new kind of recursivity different from the recursivity already involved in axis descendant, ancestor etc. The idea was inspired by the possibility of defining functions in XQuery, which may call other user-defined functions in their body. Named expressions can be regarded as a simplified version of user-defined functions in the context of XPath. We only consider downward axis with and without negations. We clarify the relationship between the different types of recursions, including transitive closure, and we also establish complexity results for the satisfiability and containment problem for different fragments of this enhanced XPath language. These results are based on the results of the static analysis of structural recursions [11,10].
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
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann (1999)
Benedikt, M., Fan, W., Geerts, F.: Xpath satisfiability in the presence of dtds. J. ACM 55, 1–79 (2008)
Berglund, A., Boag, S., Chamberlin, D., Mary Fernández, F., Kay, M., Robie, J., Siméon, J.: Xml path language (xpath) 2.0 (w3c recommendation) (2010), http://www.w3.org/TR/xpath20/
Buneman, P., Fernandez, M., Suciu, D.: Unql: a query language and algebra for semistructured data based on structural recursion. The VLDB Journal 9, 76–110 (2000)
ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of xpath 2.0. J. ACM 56, 31:1–31:48 (2009)
Comon, H., Dauchet, M., Gilleron, R., Löding, F., Jacquemard, C., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata
Deutsch, A., Sui, L., Vianu, V.: Xml path language (xpath) version 1.0. w3c recommendation, the world wide web consortium (1999)
Gruber, H., Holzer, M.: Finite Automata, Digraph Connectivity, and Regular Expression Size. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 39–50. Springer, Heidelberg (2008)
Kósa, B.: Containment and satisfiability problem for xpath with recursion (extended version) (from May 8), http://people.inf.elte.hu/balhal/publications/RecursiveXPath.pdf
Kósa, B.: Structural recursions with conditions and negations (from May 15), http://people.inf.elte.hu/balhal/publications/StructuralRecursions.pdf
Kósa, B., Benczúr, A., Kiss, A.: Satisfiability and Containment Problem of Structural Recursions with Conditions. In: Catania, B., Ivanović, M., Thalheim, B. (eds.) ADBIS 2010. LNCS, vol. 6295, pp. 336–350. Springer, Heidelberg (2010)
Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of xml schema. ACM Trans. Database Syst. 31, 770–813 (2006)
Miklau, G., Suciu, D.: Containment and equivalence for a fragment of xpath. J. ACM 51, 2–45 (2004)
Milo, T., Suciu, D.: Index Structures for Path Expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)
Neven, F., Schwentick, T.: XPath Containment in the Presence of Disjunction, DTDs, and Variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 312–326. Springer, Heidelberg (2002)
Christos Papadimitriou, M.: Computational complexity. Addison-Wesley (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kósa, B. (2012). Containment and Satisfiability Problem for XPath with Recursion. In: Morzy, T., Härder, T., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2012. Lecture Notes in Computer Science, vol 7503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33074-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-33074-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33073-5
Online ISBN: 978-3-642-33074-2
eBook Packages: Computer ScienceComputer Science (R0)