Skip to main content

Static Analysis of Structural Recursion in Semistructured Databases and Its Consequences

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3255))

Abstract

Structural recursion is a graph traversing and restructuring operation in UnQL [7], [8], a query language for semistructured data. In this paper we consider satisfiability questions mainly in the presence of schema graphs [2], [9], which are used for describing the structure of semistructured data. We introduce a new kind of simulation between schema graphs, with which the relationships can be represented in more subtle ways. By means of operational graphs we also develop a new way for defining the semantics of structural recursions. Our results give us algorithms for checking whether a given query will satisfy the restrictions imposed by schema graphs and techniques with which these can be involved in queries. Query optimizing methods are also developed.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S.: Querying semi-structured data. In: Proceedings 6th International Conference on Database Theory, pp. 1–18 (1997)

    Google Scholar 

  2. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann Publishers, San Francisco (2000)

    Google Scholar 

  3. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  4. Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.: The Lorel query language for semistructured data. International journal on digital libraries 1(1), 68–88 (1997)

    Article  Google Scholar 

  5. Boag, S., Chamberlain, D., Fernandez, M., Florescu, D., Robie, J., Simeon, J.: XQuery 1.0: An XML query language. W3C Working Draft (2003), http://www.w3.org/TR/xquery/

  6. Bray, T., Paoli, J., Sperberg-McQueen, C.M.: Extensible Markup Language (XML) 1.0. W3C Recommendation REC-xml-19980210, Available as http://www.w3.org/REC-xml

  7. Buneman, P., Fernandez, M., Suciu, D.: UnQL: a query language and algebra for semistructured data based on structured recursion. The VLDB Journal 9, 76–110 (2000)

    Article  Google Scholar 

  8. Buneman, P., Davidson, S., Hillebrand, G., Suciu, D.: A query language and optimization techniques for unstructured data. In: Proceedings of ACM-SIGMOD International Conference on Management of Data, pp. 505–516 (1996)

    Google Scholar 

  9. Buneman, P., Davidson, S., Fernandez, M., Suciu, D.: Adding Structure to Unstructured Data. University of Pennsylvania, Computer and Information Science Department (1996)

    Google Scholar 

  10. Clark, J.: Xml path language, xpath (1999), http://www.w3.org/TR/xpath

  11. Clark, J.: XSL transformations (xslt) specification (1999), http://www.w3.org/TR/WD-xslt

  12. Deutsch, A., Fernandez, M., Florescu, D., Levy, A., Suciu, D.: A query language for XML. In: Proceedings of the Eights International World Wide Web Conference (WWW8), Toronto (1999)

    Google Scholar 

  13. Fan, W., Libkin, L.: On XML integrity constraints in the presence of DTDs. In: PODS 2001, pp. 114-125 (2001)

    Google Scholar 

  14. Fernandez, M., Suciu, D.: Optimizing regular path expressions using graph schemas. In: Proceedings of the International Conference on Data Engineering, pp. 14–23 (1998)

    Google Scholar 

  15. Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal of Computing 16, 973–988 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  17. Suciu, D.: Distributed Query Evaluation on Semistructured Data. ACM Transactions on Database Systems 27(1), 1–62 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benczúr, A., Kósa, B. (2004). Static Analysis of Structural Recursion in Semistructured Databases and Its Consequences. In: Benczúr, A., Demetrovics, J., Gottlob, G. (eds) Advances in Databases and Information Systems. ADBIS 2004. Lecture Notes in Computer Science, vol 3255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30204-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30204-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23243-8

  • Online ISBN: 978-3-540-30204-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics