Skip to main content
SpringerLink
Log in

Hyperset Approach to Semi-structured Databases

Computation of Bisimulation in the Distributed Case

  • Conference paper
Book cover Dataspace: The Final Frontier (BNCOD 2009)

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

Included in the following conference series:

  • 918 Accesses

Abstract

We will briefly describe the recently implemented hyperset approach to semi-structured or Web-like and possibly distributed databases with the query system available online at http://www.csc.liv.ac.uk/~molyneux/t/ . As this approach is crucially based on the bisimulation relation, the main stress in this paper is on its computation in the distributed case by using a so called bisimulation engine and local approximations of the global bisimulation relation.

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. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web — From Relations to Semi-structured Data and XML. Morgan Kaufmann Publishers, San Francisco (2000)

    Google Scholar 

  2. Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The Lorel query language for semistructured data. International Journal on Digital Libraries 1(1), 68–88 (1997)

    Article  Google Scholar 

  3. Aczel, P.: Non-Well-Founded Sets. CSLI, Stanford (1988)

    MATH  Google Scholar 

  4. Barwise, J., Moss, L.: Vicious circles: on the mathematics of non-well-founded phenomena. Center for the Study of Language and Information (1996)

    Google Scholar 

  5. Benedikt, M., Libkin, L., Neven, F.: Logical definability and query languages over ranked and unranked trees. ACM Transactions on Computational Logic (TOCL) 8(2), 1–62 (2007)

    Article  MathSciNet  Google Scholar 

  6. Buneman, P., Fernández, M., Suciu, D.: UnQL: a query language and algebra for semistructured data based on structural recursion. The VLDB Journal 9(1), 76–110 (2000)

    Article  Google Scholar 

  7. Delta-WDB Site (2008), http://www.csc.liv.ac.uk/~molyneux/t/

  8. Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science 311(1-3), 221–256 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fernandez, J.-C.: An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13(1), 219–236 (1989)

    MathSciNet  MATH  Google Scholar 

  10. Jančar, P., Moller, F.: Techniques for decidability and undecidability of bisimilarity. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 30–45. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Leontjev, A., Sazonov, V.: Δ: Set-theoretic query language capturing logspace. Annals of Mathematics and Artificial Intelligence 33(2-4), 309–345 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lisitsa, A., Sazonov, V.: Bounded hyperset theory and web-like data bases. In: Proceedings of the Kurt Goedel Colloquium, vol. 1234, pp. 178–188 (1997)

    Google Scholar 

  13. Lisitsa, A., Sazonov, V.: Δ-languages for sets and LOGSPACE computable graph transformers. Theoretical Computer Science 175(1), 183–222 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lisitsa, A., Sazonov, V.: Linear ordering on graphs, anti-founded sets and polynomial time computability. Theoretical Computer Science 224(1–2), 173–213 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Molyneux, R.: Hyperset Approach to Semi-structured Databases and the Experimental Implementation of the Query Language Delta. PhD thesis, University of Liverpool, Liverpool, England (2008)

    Google Scholar 

  16. Molyneux, R., Sazonov, V.: Hyperset/web-like databases and the experimental implementation of the query language delta - current state of affairs. In: ICSOFT 2007 Proceedings of the Second International Conference on Software and Data Technologies, vol. 3, pp. 29–37, INSTICC (2007)

    Google Scholar 

  17. Sazonov, V.: Hereditarily-finite sets, data bases and polynomial-time computability. Theoretical Computer Science 119(1), 187–214 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sazonov, V.: Querying hyperset / web-like databases. Logic Journal of the IGPL 14(5), 785–814 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, UK

    Richard Molyneux & Vladimir Sazonov

Authors
  1. Richard Molyneux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Sazonov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Birmingham, B15 2TT, Edgbaston, Birmingham, UK

    Alan P. Sexton

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Molyneux, R., Sazonov, V. (2009). Hyperset Approach to Semi-structured Databases. In: Sexton, A.P. (eds) Dataspace: The Final Frontier. BNCOD 2009. Lecture Notes in Computer Science, vol 5588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02843-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02843-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02842-7

  • Online ISBN: 978-3-642-02843-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation