Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Database Programming Languages

DBPL 2003: Database Programming Languages pp 37–53Cite as

Containment of Relational Queries with Annotation Propagation

  • Conference paper

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

Abstract

We study the problem of determining whether a query is contained in another when queries can carry along annotations from source data. We say that a query is annotation-contained in another if the annotated output of the former is contained in the latter on every possible annotated input databases. We study the relationship between query containment and annotation-containment and show that annotation-containment is a more refined notion in general. As a consequence, the usual equivalences used by a typical query optimizer may no longer hold when queries can carry along annotations from the source to the output. Despite this, we show that the same annotated result is obtained whether intermediate constructs of a query are evaluated with set or bag semantics. We also give a necessary and sufficient condition, via homomorphisms, that checks whether a query is annotation-contained in another. Even though our characterization suggests that annotation-containment is more complex than query containment, we show that the annotation-containment problem is NP-complete, thus putting it in the same complexity class as query containment. In addition, we show that the annotation placement problem, which was first shown to be NP-hard in [7], is in fact DP-hard and the exact complexity of this problem still remains open.

This is a preview of subscription content, 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

Learn about 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 Publishing Co., Reading (1995)

    MATH  Google Scholar 

  2. Bairoch, A., Apweiler, R.: The SWISS-PROT protein sequence database and its supplement TrEMBL. Nucleic Acids Research 28, 45–48 (2000)

    Article  Google Scholar 

  3. Benson, D., Karsch-Mizrachi, I., Lipman, D., Ostell, J., Rapp, B., Wheeler, D.: GenBank. Nucleic Acids Research 28(1), 15–18 (2000)

    Article  Google Scholar 

  4. Bernstein, P., Bergstraesser, T.: Meta-Data Support for Data Transformations Using Microsoft Repository. IEEE Data Engineering Bulletin 22(1), 9–14 (1999)

    Google Scholar 

  5. biodas.org, http://biodas.org

  6. Buneman, P., Khanna, S., Tan, W.: Why and Where: A Characterization of Data Provenance. In: Proceedings of the International Conference on Database Theory (ICDT), London, United Kingdom, pp. 316–330 (2001)

    Google Scholar 

  7. Buneman, P., Khanna, S., Tan, W.: On Propagation of Deletions and Annotations Through Views. In: Proceedings of the ACM Symposium on Principles of Database Systems (PODS), Wisconsin, Madison, pp. 150–158 (2002)

    Google Scholar 

  8. Chandra, K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the ninth annual ACM symposium on Theory of computing, Boulder, Colorado, pp. 77–90 (1977)

    Google Scholar 

  9. Chaudhuri, S., Vardi, M.Y.: Optimization of real conjunctive queries. In: Proceedings of the ACM Symposium on Principles of Database Systems (PODS), Washington, DC, pp. 59–70 (1993)

    Google Scholar 

  10. Chekuri, C., Rajaraman, A.: Conjunctive Query Containment Revisited. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 56–70. Springer, Heidelberg (1996)

    Google Scholar 

  11. Cosmadakis, S.S.: The Complexity of Evaluating Relational Queries. Information and Control 58(1-3), 101–112 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  12. Davidson, S.B., Crabtree, J., Bunk, B.P., Schug, J., Tannen, V., Overton, G.C., Stoeckert Jr., C.J.: K2/Kleisli and GUS: Experiments in integrated access to genomic data sources - Author bios. IBM Systems Journal 40(2), 512–531 (2001)

    Article  Google Scholar 

  13. Denning, D.E., Lunt, T.F., Schell, R.R., Shockley, W.R., Heckman, M.: The SeaView Security Model. In: IEEE Symposium on Security and Privacy, Washington, DC, pp. 218–233 (1988)

    Google Scholar 

  14. Dowell, R.: A Distributed Annotation System. Technical report, Department of Computer Science, Washington University in St. Louis (2001)

    Google Scholar 

  15. Fernández, M., Kadiyska, Y., Morishima, A., Suciu, D., Tan, W.: SilkRoute: A Framework for Publishing Relational Data in XML. ACM Transactions on Database Systems (TODS) 27(4), 438–493 (2002)

    Article  Google Scholar 

  16. Hell, P., Nešetřil, J.: The Core of a Graph. Discrete Mathematics 109, 117–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Jajodia, S., Sandhu, R.S.: Polyinstantiation integrity in multilevel relations. In: IEEE Symposium on Security and Privacy, Oakland, California, pp. 104–115 (1990)

    Google Scholar 

  18. Kahan, J., Koivunen, M., Prud’Hommeaux, E., Swick, R.: Annotea: An open rdf infrastructure for shared web annotations. In: Proceedings of the International World Wide Web Conference(WWW10), Hong Kong, China, pp. 623–632 (2001)

    Google Scholar 

  19. Kent, W.J., Sugnet, C.W., Furey, T.S., Roskin, K.M., Pringle, T.H., Zahler, A.M., Haussler, D.: The Human Genome Browser at UCSC. Genome Research 12(5), 996–1006 (2002)

    Google Scholar 

  20. LaLiberte, D., Braverman, A.: A Protocol for Scalable Group and Public Annotations. In: Proceedings of the International World Wide Web Conference(WWW3), Darmstadt, Germany (1995)

    Google Scholar 

  21. Lee, T., Bressan, S., Madnick, S.: Source Attribution for Querying Against Semistructured Documents. In: Workshop on Web Information and Data Management (WIDM), Washington, DC (1998)

    Google Scholar 

  22. Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: Proceedings of the ACM Symposium on Principles of Database Systems (PODS), San Jose, California, pp. 95–104 (1995)

    Google Scholar 

  23. Maier, D., Delcambre, L.: Superimposed Information for the Internet. In: Proceedings of the International Workshop on the Web and Databases (WebDB), Philadelphia, Pennsylvania, pp. 1–9 (1999)

    Google Scholar 

  24. Myers, C., Liskov, B.: A decentralized model for information control. In: Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), Saint-Malo, France, pp. 129–142 (1997)

    Google Scholar 

  25. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  26. Phelps, T.A., Wilensky, R.: Multivalent Annotaions. In: Proceedings of the First European Conference on Research and Advanced Technology for Digital Libraries, Pisa, Italy, pp. 287–303 (1997)

    Google Scholar 

  27. Phelps, T.A., Wilensky, R.: Multivalent documents. In: Proceedings of the Communications of the Association for Computing Machinery (CACM), vol. 43(6), pp. 82–90 (2000)

    Google Scholar 

  28. Phelps, T.A., Wilensky, R.: Robust intra-document locations. In: Proceedings of the International World Wide Web Conference(WWW9), Amsterdam, Netherlands, pp. 105–118 (2000)

    Google Scholar 

  29. Schickler, M.A., Mazer, M.S., Brooks, C.: Pan-Browser Support for Annotations and Other Meta-Information on the World Wide Web. In: Proceedings of the International World Wide Web Conference(WWW5), Paris, France (1996)

    Google Scholar 

  30. Shanmugasundaram, J., Shekita, E., Barr, R., Carey, M., Lindsay, B., Pirahesh, H., Reinwald, B.: Efficiently Publishing Relational Data as XML Documents. VLDB Journal 10(2-3), 133–154 (2001)

    MATH  Google Scholar 

  31. Tan, W.: Containment of Relational Queries with Annotation Propagation. Technical report, Dept. of Computer Science, University of California, Santa Cruz (2003)

    Google Scholar 

  32. W3C. Annotea Project, http://www.w3.org/2001/Annotea

  33. Wang, Y.R., Madnick, S.E.: A Polygen Model for Heterogeneous Database Systems: The Source Tagging Perspective. In: Proceedings of the International Conference on Very Large Data Bases (VLDB), Brisbane, Queensland, Australia, pp. 519–538 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Santa Cruz

    Wang-Chiew Tan

Authors
  1. Wang-Chiew Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Angewandte Wissenschaften, Institut für Informatik, Georges-Köhler-Allee, Albert-Ludwigs-Universität Freiburg, Gebäude 51, 79110, Freiburg, Germany

    Georg Lausen

  2. Department of Computer Science and Engineering, University of Washington,  

    Dan Suciu

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, WC. (2004). Containment of Relational Queries with Annotation Propagation. In: Lausen, G., Suciu, D. (eds) Database Programming Languages. DBPL 2003. Lecture Notes in Computer Science, vol 2921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24607-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24607-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20896-9

  • Online ISBN: 978-3-540-24607-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation