Skip to main content

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 61))

  • 42 Accesses

Abstract

VIDEBAS is a relational multi-user database management system. Relations are stored, in general, more than one time, each time however in a different sort order. The main goal of this approach is to reduce the number of accesses necessary to handle a query at the cost of a higher charge on external memory. The consistency problems connected to redundancy are prevented by inserting all subsequent changes to a relation in the corresponding differential file. In this paper the performance of VIDEBAS will be compared with SYSTEM R. The only operations considered are an one-relational query and an equijoin of two relations. The differential files will not be taken into account. The criteria for comparison are the internal and external memory occupation and the number of page accesses needed to obtain the answer.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Astrahan, et al., “A relational database management system”, ACM Transactions on Database Systems, vol 1, no 2, june 1976, pp97–137.

    Article  Google Scholar 

  2. Blanken, H. M., “The architecture of VIDEBAS, a relational database management system”, Intern. Conference on Systems Architecture, 1981, London.

    Google Scholar 

  3. Blasgen, M. W. and K. P. Eswaran, “Storage and access in relational databases”, IBM Systems Journal, 1977, pp 363–377.

    Google Scholar 

  4. Selinger, P. G. ėt al., “Access path selection in a relational database management system”, Proc. of the 1979 SIGMOD Conference.

    Google Scholar 

  5. Astrahan, M. M. et al., “Performance of the SYSTEM R access path selection mechanism”, Information Processing 80, S. H. Lavington (ed), IFIP, 1980, pp487–491.

    Google Scholar 

  6. King, W., “Relational database systems: where we stand today” Information Processing 80, S. H. Lavington (ed), IFIP, 1980, pp370–381

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Blanken, H.M. (1983). Performance Evaluation of Videbas. In: Kühn, P.J., Schulz, K.M. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68830-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68830-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11990-6

  • Online ISBN: 978-3-642-68830-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics