Skip to main content
SpringerLink
Log in

View-Based Tree-Language Rewritings for XML

  • Conference paper
Foundations of Information and Knowledge Systems (FoIKS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8367))

Abstract

We study query rewriting using views (QRV) for XML. Our queries and views are regular tree languages (RTLs) represented by tree automata over marked alphabets, where the markers serve as “node selectors”. We formally define query rewriting using views for RTLs and give an automata-based algorithm to compute the maximally contained rewriting. The formalism we use is equal in power with Monadic Second Order (MSO) logic, and our algorithm for computing QRV is the first to target this expressive class. Furthermore we prove a tight lower bound, thus showing that our algorithm is optimal. Another strength of our automata-based approach is that we are able to cast computing QRV into executing a sequence of intuitive operations on automata, thus rendering our approach practical as it can be easily implemented utilizing off-the-shelf automata toolboxes. Finally, we generalize our framework to account for more complex queries in the spirit of the FOR clause in XQuery. For this generalization as well, we give an optimal algorithm for computing the maximally contained rewriting of queries using views.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afanasiev, L., Blackburn, P., Dimitriou, I., Gaiffe, B., Goris, E., Marx, M., de Rijke, M.: PDL for ordered trees. Journal of Applied Non-Classical Logics 15(2), 115–135 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Afrati, F.N., Chirkova, R., Gergatsoulis, M., Kimelfeld, B., Pavlaki, V., Sagiv, Y.: On rewriting XPath queries using views. In: EDBT (2009)

    Google Scholar 

  3. Arenas, M., Barceló, P., Libkin, L.: Combining temporal logics for querying XML documents. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 359–373. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Arion, A., Benzaken, V., Manolescu, I., Papakonstantinou, Y.: Structured materialized views for XML queries. In: VLDB (2007)

    Google Scholar 

  5. Balmin, A., Özcan, F., Beyer, K.S., Cochrane, R., Pirahesh, H.: A framework for using materialized XPath views in XML query processing. In: VLDB (2004)

    Google Scholar 

  6. Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: An automata-theoretic approach to regular XPath. In: Gardner, P., Geerts, F. (eds.) DBPL 2009. LNCS, vol. 5708, pp. 18–35. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Node selection query languages for trees. In: AAAI (2010)

    Google Scholar 

  8. Cautis, B., Deutsch, A., Onose, N.: XPath rewriting using multiple views: Achieving completeness and efficiency. In: WebDB (2008)

    Google Scholar 

  9. Claves, P., Jansen, D., Holtrup, S.J., Mohr, M., Reis, A., Schatz, M., Thesing, I.: LETHAL: Library for working with finite tree and hedge automata (2009), http://lethal.sf.net

  10. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)

    Google Scholar 

  11. Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Rewriting regular XPath queries on XML views. In: ICDE (2007)

    Google Scholar 

  12. Filiot, E.: Ranked and unranked tree automata libraries (grappa), http://www.grappa.univ-lille3.fr/~filiot/tata

  13. Filiot, E., Niehren, J., Talbot, J.-M., Tison, S.: Composing monadic queries in trees. In: PLAN-X (2006)

    Google Scholar 

  14. Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: LICS (2003)

    Google Scholar 

  15. Lakshmanan, L.V.S., Thomo, A.: View-based tree-language rewritings for XML (2013), http://webhome.cs.uvic.ca/~thomo/tarewfull.pdf

  16. Lakshmanan, L.V.S., Wang, H., Zhao, Z.J.: Answering tree pattern queries using views. In: VLDB (2006)

    Google Scholar 

  17. Libkin, L., Sirangelo, C.: Reasoning about XML with temporal logics and automata. J. Applied Logic 8(2), 210–232 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  18. Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. JACM 51(1), 2–45 (2004)

    Article  MathSciNet  Google Scholar 

  19. Neven, F.: Design and Analysis of Query Languages for Structured Documents–A Formal and Logical Approach. PhD thesis. Limburgs Universitair Centrum (1999)

    Google Scholar 

  20. Neven, F., Schwentick, T.: Expressive and efficient pattern languages for tree-structured data. In: PODS (2000)

    Google Scholar 

  21. Neven, F., Schwentick, T.: Query automata over finite trees. TCS 275(1-2), 633–674 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  22. Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3) (2006)

    Google Scholar 

  23. Niehren, J., Planque, L., Talbot, J.-M., Tison, S.: N-ary queries by tree automata. In: DBPL (2005)

    Google Scholar 

  24. Onose, N., Deutsch, A., Papakonstantinou, Y., Curtmola, E.: Rewriting nested XML queries using nested views. In: SIGMOD Conf. (2006)

    Google Scholar 

  25. Schwentick, T.: On diving in trees. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 660–669. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  26. Schwentick, T.: Automata for XML - a survey. J. Comput. Syst. Sci. 73(3), 289–315 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  27. ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: PODS (2008)

    Google Scholar 

  28. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57–81 (1968)

    Article  MathSciNet  Google Scholar 

  29. Thomo, A., Venkatesh, S.: Rewriting of VPLs for XML data integration. In: CIKM (2008)

    Google Scholar 

  30. Wang, J., Li, J., Yu, J.X.: Answering tree pattern queries using views: A revisit. In: EDBT (2011)

    Google Scholar 

  31. Xu, W., Özsoyoglu, Z.M.: Rewriting XPath queries using materialized views. In: VLDB (2005)

    Google Scholar 

  32. Yu, C., Popa, L.: Constraint-based XML query rewriting for data integration. In: SIGMOD (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of British Columbia, Vancouver, BC, Canada

    Laks V. S. Lakshmanan

  2. University of Victoria, Victoria, BC, Canada

    Alex Thomo

Authors
  1. Laks V. S. Lakshmanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alex Thomo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik und Informatik, FernUniversität in Hagen, Universitätstrasse 1, 58084, Hagen, Germany

    Christoph Beierle

  2. Istituto di Scienza e Tecnologie della Informazione, Consiglio Nazionale delle Ricerche, Via G. Moruzzi 1, 56124, Pisa, Italy

    Carlo Meghini

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lakshmanan, L.V.S., Thomo, A. (2014). View-Based Tree-Language Rewritings for XML. In: Beierle, C., Meghini, C. (eds) Foundations of Information and Knowledge Systems. FoIKS 2014. Lecture Notes in Computer Science, vol 8367. Springer, Cham. https://doi.org/10.1007/978-3-319-04939-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04939-7_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04938-0

  • Online ISBN: 978-3-319-04939-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation