Skip to main content

Relational Completeness of Query Languages for Annotated Databases

  • Conference paper
Database Programming Languages (DBPL 2007)

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

Included in the following conference series:

Abstract

Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so that they have an implicit effect also on the annotations. We compare the expressive power of these two approaches. As a formal model for the implicit approach we propose the color algebra, an adaptation of the relational algebra to deal with the annotations. We show that the color algebra is relationally complete: it is equivalent to the relational algebra on the explicit annotations. Our result extends a similar completeness result established for the query algebra of the MONDRIAN annotation system, from unions of conjunctive queries to the full relational algebra.

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

Access this chapter

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., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Bhagwat, D., Chiticariu, L., Tan, W.-C., Vijayvargiya, G.: An annotation management system for relational databases. The VLDB Journal 14(4), 373–396 (2005)

    Article  Google Scholar 

  3. Buneman, P., Cheney, J., Vansummeren, S.: On the expressiveness of implicit provenance in query and update languages. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 209–223. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Buneman, P., Khanna, S., Tan, W.-C.: On propagation of deletions and annotations through views. In: Proceedings 21st ACM Symposium on Principles of Database Systems, pp. 150–158. ACM Press, New York (2002)

    Google Scholar 

  5. Chiticariu, L., Tan, W.-C., Vijayvargiya, G.: DBNotes: A post-it system for relational databases based on provenance. In: Proceedings 2005 ACM SIGMOD International Conference on Management of Data, pp. 942–944. ACM Press, New York (2005)

    Chapter  Google Scholar 

  6. Cong, G., Fan, W., Geerts, F.: Annotation propagation revisited for key preserving views. In: Proceedings 15th ACM International Conference on Information and Knowledge Management, pp. 632–641. ACM Press, New York (2006)

    Chapter  Google Scholar 

  7. Geerts, F., Kementsietsidis, A., Milano, D.: iMONDRIAN: A visual tool to annotate and query scientific databases. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Boehm, K., Kemper, A., Grust, T., Boehm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 1168–1171. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Geerts, F., Kementsietsidis, A., Milano, D.: MONDRIAN: Annotating and querying databases through colors and blocks. In: Proceedings 22th International Conference on Data Engineering, p. 82. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  9. Van den Bussche, J., Cabibbo, L.: Converting untyped formulas into typed ones. Acta Informatica 35(8), 637–643 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wang, Y.R., Madnick, S.E.: A polygen model for heterogeneous database systems: the source taging perspective. In: McLeod, D., Sacks-Davis, R., Schek, H. (eds.) Proceedings of the 16th International Conference on Very Large Data Bases, pp. 518–538. Morgan Kaufmann, San Francisco (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marcelo Arenas Michael I. Schwartzbach

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geerts, F., Van den Bussche, J. (2007). Relational Completeness of Query Languages for Annotated Databases. In: Arenas, M., Schwartzbach, M.I. (eds) Database Programming Languages. DBPL 2007. Lecture Notes in Computer Science, vol 4797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75987-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75987-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75986-7

  • Online ISBN: 978-3-540-75987-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics