Skip to main content
SpringerLink
Log in

Partial Evaluations in a Set-Theoretic Query Language for the WWW

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2000)

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

Abstract

We present an approach to handle unavailable data sources during query execution over WWW which is based on partial evaluations. Syntax of the set-theoretic query language Δ and some examples of queries are given. We define an ordinary and a lazy semantics for this language. Moreover, we introduce a universe of non-well-founded hereditarily finite protosets and an approximation relation on this universe in order to compare the partial answers to a query. A theorem about properties of the above semantics, in particular about correctness of lazy semantics is formulated.

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. Querying semistructured data, in: ICDT’97, LNCS, vol. 1186, Springer, 1997, pp. 1–18.

    Google Scholar 

  2. Aczel P. Non-Well-Founded Sets. CSLI Lecture Notes, no. 14, 1988.

    Google Scholar 

  3. Aliffi D., Dovier A., Rossi G. From set to hyperset unification, The Journal of Functional and Logic Programming, Volume 1999, no. 11, pp. 1–48.

    Google Scholar 

  4. Bonnet P., Tomasic A. Partial answers for unavailable data sources, in: Proceedings of the Conference on Flexible Query Answering Systems, Roskilde, Denmark, 1998, pp. 43–54.

    Google Scholar 

  5. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Maier, D. Suciu. Querying XML Data, IEEE Data Engineering Bulletin, September 1999, vol. 22, no. 3, pp.10–18.

    Google Scholar 

  6. Dovier A., Piazza C., Policriti A. Fast (hyper)set equivalence, in: B. Jayaraman, G. Rossi, eds., DPS’99 Workshop on Declarative Programming with Sets, Paris, September 28, 1999.

    Google Scholar 

  7. Lisitsa A.P., Sazonov V.Yu. Bounded hyperset theory and Web-like data bases, in: 5th Kurt Gödel Colloquium, KGC’97, LNCS, vol. 1289, Springer,1997, pp.172–185.

    Google Scholar 

  8. Lisitsa A.P., Sazonov V.Yu. Δ-languages for sets and LOGSPACE-computable graph transformers, Theoretical Computer Science, vol. 175, no. 1, 1997, pp. 183–222.

    Article  MATH  MathSciNet  Google Scholar 

  9. Lisitsa A.P., Sazonov V.Yu. Linear ordering on graphs, anti-founded sets and polynomial time computability, Theoretical Computer Science, vol. 224, no. 1–2, 1999, pp. 173–213.

    Article  MATH  MathSciNet  Google Scholar 

  10. Mislove M.W., Moss L.S., Oles F.J. Non-well-founded sets modeled as ideal fixed points, Information and Computation, vol. 93, no. 1, 1991, pp.16–54.

    Article  MATH  MathSciNet  Google Scholar 

  11. Moschovakis Y.N. Notes in set theory, Springer-Verlag, New York, 1994.

    Google Scholar 

  12. Neven J., Van den Bussche J., Van Gucht D., Vossen G. Typed query languages for databases containing queries, Information Systems, 1999, to appear.

    Google Scholar 

  13. Sazonov V.Yu. Hereditarily finite sets, data bases and polynomial-time computability, Theoretical Computer Science, vol. 119, no. 2, 1993, pp. 187–214.

    Article  MATH  MathSciNet  Google Scholar 

  14. Vrbsky S.V., Liu J.W.S. APPROXIMATE: A query processor that produces monotonically improving approximate answers, Transactions on Knowledge and Data Engineering, vol. 5, no. 6, December 1993, pp. 1056–1068.

    Article  Google Scholar 

  15. Van den Bussche J., Van Guch D., Vossen G. Reflective programming in the relational algebra, Journal of Computer and System Sciences, vol. 52, no. 3, pp. 537–549, 1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Program Systems Institute of Russian Academy of Sciences, Pereslavl-Zalessky, 152140, Russia

    Yury P. Serdyuk

Authors
  1. Yury P. Serdyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität Clausthal, Julius-Albert-Str. 4, 38678, Clausthal-Zellerfeld, Germany

    Klaus-Dieter Schewe

  2. Institut für Informatik, Technische Universität Cottbus, Postfach 101344, 03013, Cottbus, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Serdyuk, Y.P. (2000). Partial Evaluations in a Set-Theoretic Query Language for the WWW. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46564-2_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46564-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation