Skip to main content
Springer Nature Link
Log in

View Disassembly

  • Conference paper
  • First Online:
Database Theory — ICDT’99 (ICDT 1999)

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

Included in the following conference series:

Abstract

We explore a new form of view rewrite called view disassembly. The objective is to rewrite views in order to “remove” certain sub-views (or unfoldings) of the view. This becomes pertinent for complex views which may defined over other views and which may involve union. Such complex views arise necessarily in environments as data warehousing and mediation over heterogeneous databases. View disassembly can be used for view and query optimization, preserving data security, making use of cached queries and materialized views, and view maintenance.

We provide computational complexity results of view disassembly. We show that the optimal rewrites for disassembled views is at least NP - hard. However, we provide good news too. We provide an approximation algorithm that has much better run-time behavior. We show a pertinent class of unfoldings for which their removal always results in a simpler disassembled view than the view itself. We also show the complexity to determine when a collection of unfoldings cover the view definition.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. U. Chakravarthy, J. Grant, and J. Minker. Logic-based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2):162–207, June 1990.

    Article  Google Scholar 

  2. S. Dar, M. Franklin, B. Jónsson, D. Srivastava, and M. Tan. Semantic data caching and replacement. In Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB), Bombay, India, Sept. 1996.

    Google Scholar 

  3. T. Feder and R. Motwani. Clique partitions, graph compressions and speeding-up algorithms. In Proceedings of the ACM Sumposium on Theory of Computing, pages 123–133, 1991.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  5. P. Godfrey. An Architecture and Implementation for a Cooperative Database System. PhD thesis, University of Maryland at College Park, College Park, Maryland 20742, 1998.

    Google Scholar 

  6. P. Godfrey and J. Gryz. Intensional query optimization. Technical Report CS-TR-3702, UMIACS-TR-96-72, Dept. of Computer Science, University of Maryland, College Park, MD 20742, Oct. 1996.

    Google Scholar 

  7. P. Godfrey and J. Gryz. Overview of dynamic query evaluation in intensional query optimization. In Proceedings of Fifth DOOD, pages 425–426, Montreux, Switzerland, Dec. 1997. Longer version appears as [6].

    Google Scholar 

  8. P. Godfrey, J. Gryz, and J. Minker. Semantic query optimization for bottom-up evaluation. In Z. W. Raś and M. Michalewicz, editors, Foundations of Intelligent Systems: Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence 1079, pages 561–571, Berlin, June 1996. Springer.

    Google Scholar 

  9. L. V. S. Lakshmanan and H. Hernandez. Structural query optimization: A uniform framework for semantic query optimization in deductive databases. In Proceedings of the ACM Symposium on the Principles of Database Systems, pages 102–114, Denver, Colorado, May 1991.

    Google Scholar 

  10. L. V. S. Lakshmanan and R. Missaoui. Pushing constraints inside recursion: A general framework for semantic optimization of recursive queries. In Proceedings of the International Conference on Data Engineering, Taipei, Taiwan, Feb. 1995.

    Google Scholar 

  11. S. Lee, L. J. Henschen, and G. Z. Qadah. Semantic query reformulation in deductive databases. In Proceedings of the IEEE International Conference on Data Engineering, pages 232–239. IEEE Computer Society Press, 1991.

    Google Scholar 

  12. A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. PODS, pages 95–104, 1995.

    Google Scholar 

  13. T. Sellis and S. Ghosh. On the multiple-query optimization problem. TKDE, 2(2):262–266, June 1990.

    Google Scholar 

  14. B. Thuraisingham and W. Ford. Security constraint processing in a multilevel secure distributed database management system. IEEE Transactions on Knowledge and Data Engineering, 7(2):274–293, Apr. 1995.

    Article  Google Scholar 

  15. J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volumes I & II. Principles of Computer Science Series. Computer Science Press, Incorporated, Rockville, Maryland, 1988/1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Maryland, College Park, MD, 20742, USA

    Parke Godfrey

  2. U.S. Army Research Laboratory, Adelphi, MD, 20783, USA

    Parke Godfrey

  3. York University, Toronto, ON, M3J-1P3, Canada

    Jarek Gryz

Authors
  1. Parke Godfrey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jarek Gryz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University, Givat-Ram, Jerusalem, 91940, Israel

    Catriel Beeri

  2. Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 19104-6389, USA

    Peter Buneman

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Godfrey, P., Gryz, J. (1999). View Disassembly. In: Beeri, C., Buneman, P. (eds) Database Theory — ICDT’99. ICDT 1999. Lecture Notes in Computer Science, vol 1540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49257-7_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-49257-7_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65452-0

  • Online ISBN: 978-3-540-49257-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation