Skip to main content

An Efficient Scalable Parallel View Maintenance Algorithm for Shared Nothing Multi-processor Machines

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1999)

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

Included in the following conference series:

Abstract

The problem of maintenance of materialized views has been the object of increased research activity recently mainly because of applications related to data warehousing. Many sequential view maintenance algorithms are developed in the literature. If the view is defined by a relational expression involving join operators, the cost of re-evaluating the view even incrementally may be unacceptable. Moreover, when views are materialized, parallelism can greatly increase processing power as necessary for view maintenance. In this paper, we present a new parallel join algorithm by partial duplication of data and a new parallel view maintenance algorithm where views can in- volve multi-joins. The performances of these algorithms are analyzed using the scalable and portable BSP 1 cost model which predicts a near-linear speedup.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. B. Moon A. Datta and H. Thomas. A case for Parallelism in Datawarehousing and OLAP. In Ninth International Workshop on Database and Expert Systems Applications, DEXA 98, IEEE Computer Society, Vienna, 1998.

    Google Scholar 

  2. Kien A. Hua and Chieng Lee. Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning. in Proc. 17th international conf. on very Large Data Bases, pp 525–535,, 1991.

    Google Scholar 

  3. M. Bamha, F. Bentayeb, and G. Hains. Un algorithme incrémental paralléle pour la maintenance des vues matérialisées. Technical Report RR99-3, LIFO, Université d’Orléans, 1999.

    Google Scholar 

  4. M. Bamha and G. Hains. A self-balancing join algorithm for Shared Nothing machines. In the Proc of the 10th International Conference on Parallel and Distributed Computing Systems, Las Vegas, Nevada, October 1998.

    Google Scholar 

  5. José A. Blakeley, Neil Coburn, and Per-Ake Larson. Updating derived relations: Detecting irrelevant and autonomously computable updates. ACM TODS, 14(3):369–400, September 1989.

    Article  MathSciNet  Google Scholar 

  6. José A. Blakeley, Per-Ake Larson, and Frank Wm. Tompa. Efficiently Updating Materialized Views. ACM SIGMOD, 1986.

    Google Scholar 

  7. David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider, and S. Seshrdri. Practical Skew Handling in Parallel Joins. In Proceedings of the 18th VLDB Conference, Vancouver, British Columbia, Canada, 1992.

    Google Scholar 

  8. Timothy Griffin and Leonid Libkin. Incremental maintenance of views with duplicates. In Proc. of ACM SIGMOD Int. Conf. on Management of Data, 1995.

    Google Scholar 

  9. K. A. Hua, W. Tavanapong, and H. C. Young. A Performance Evaluation of Load Balancing Techniques for Join Operations on Multicomputer Database systems. In Proc. of the 11th International Conference on Data Engineering, CA, USA, 1995.

    Google Scholar 

  10. Hongjun Lu, Beng-Chin Ooi, and Kian-Lee Tan. Query Processing in Parallel Relational Database Systems. IEEE Computer Society Press, California, 1994.

    Google Scholar 

  11. Viswanath Poosala and Yannis E. Ioannidis. Estimation of query-result distribution and its application in parallel-join load balancing. In: Proc. 22th Int. Conf. on Very Large Database Systems, VLDB’96, Bombay, India, 1996.

    Google Scholar 

  12. Donovan A. Schneider and David J. DeWitt. A performance of four parallel join algorithms in a shared-nothing multiprocessor environment. in the Proc ACM SIGMOD, pp. 110–121, 1989.

    Google Scholar 

  13. M. Seetha and Philip S. Yu. Effectiveness of Parallel Joins. published in the IEEE, Trans. Knowledge and Data Enginneerings, Vol. 2, No 4, pp 410–424, 1990.

    Article  Google Scholar 

  14. Leslie Valiant. A Bridging Model for Parallel Computation,. Communication of the ACM, Vol 33, No. 8., August 1990.

    Google Scholar 

  15. Annita N. Wilschut, Jan Flokstra, and Peter M.G. Apers. Parallel Evaluation of Multi-join Queries. In the Proc. Of the ACM-SIGMOD, California, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bamha, M., Bentayeb, F., Hains, G. (1999). An Efficient Scalable Parallel View Maintenance Algorithm for Shared Nothing Multi-processor Machines. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66448-2

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics