Abstract
Simulation unification is a special kind of unification adapted to retrieving semi-structured data on the Web. This article introduces simulation subsumption, or containment, that is, query subsumption under simulation unification. Simulation subsumption is crucial in general for query optimization, in particular for optimizing pattern-based search engines, and for the termination of recursive rule-based web languages such as the XML and RDF query language Xcerpt. This paper first motivates and formalizes simulation subsumption. Then, it establishes decidability of simulation subsumption for advanced query patterns featuring descendant constructs, regular expressions, negative subterms (or subterm exclusions), and multiple variable occurrences. Finally, we show that subsumption between two query terms can be decided in \(\mathcal{O}(n!^n)\) where n is the sum of the sizes of both query terms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Schaffert, S., Bry, F.: Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In: Proc. Extreme Markup Languages (Int’l. Conf. on Markup Theory & Practice) (2004)
Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking forward. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002. LNCS, vol. 2490. Springer, Heidelberg (2002)
Schaffert, S.: Xcerpt: A Rule-Based Query and Transformation Language for the Web. PhD thesis, University of Munich (2004)
Tamaki, H., Sato, T.: OLD resolution with tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 84–98. Springer, Heidelberg (1986)
Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. Journal of the ACM 43(1), 20–74 (1996)
Schwentick, T.: XPath query containment. SIGMOD Record 33(1), 101–109 (2004)
Wei, F., Lausen, G.: Containment of conjunctive queries with safe negation. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 343–357. Springer, Heidelberg (2002)
Björklund, H., Martens, W., Schwentick, T.: Conjunctive Query Containment over Trees. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797, pp. 66–80. Springer, Heidelberg (2007)
Klug, A.: On Conjunctive Queries containing Inequalities. Journal of the ACM 35(1), 146–160 (1988)
Koch, C.: On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values. Transactions on Database Systems 31(4) (2006)
Pohl, A.: RDF Querying in Xcerpt: Language Constructs and Implementation. Deliverable I4-Dx2, REWERSE (2008)
Bry, F., Furche, T., Linse, B.: Simulation subsumption or déjà vu on the web (extended version), http://www.pms.ifi.lmu.de/mitarbeiter/linse/bry-simulation.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bry, F., Furche, T., Linse, B. (2008). Simulation Subsumption or Déjà vu on the Web. In: Calvanese, D., Lausen, G. (eds) Web Reasoning and Rule Systems. RR 2008. Lecture Notes in Computer Science, vol 5341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88737-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-88737-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88736-2
Online ISBN: 978-3-540-88737-9
eBook Packages: Computer ScienceComputer Science (R0)