Parallelisierung von Anfragen auf komplexen Objekten durch Hash Joins | SpringerLink
Skip to main content
Springer Nature Link
Log in

Parallelisierung von Anfragen auf komplexen Objekten durch Hash Joins

  • Conference paper
Datenbanksysteme in Büro, Technik und Wissenschaft

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

Zusammenfassung

Relationale Datenbanksysteme sind von ihrer Leistungsfähigkeit her noch nicht für den Einsatz in technischen Datenbanken geeignet. Dieser Artikel befaßt sich mit Techniken zur Parallelisierung von Datenbankanfragen durch Hash Joins. Ein Schwerpunkt liegt auf der Untersuchung der Eigenschaften des Hash Join-Algorithmus’ zur Verwendung für Anfragen auf komplexe Objekte. Neben Performanceaspekten werden auch Möglichkeiten zur Bearbeitung rekursiver Strukturen untersucht.

Abstract

Relational Databases currently do not provide the performance to be used in technical applications. This paper is concerned with methods for the use of hash joins for database queries. A major point in this paper is the application of hash join techniques in databases containing complex objects. Besides a discussion of performance aspects, the paper focuses on the usage of hash joins to process recursive joins.

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
¥17,985 /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
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7349
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

Literatur

  1. D. Bitton, D. J. DeWitt, C. Turbyfill Benchmarking Database Systems — A Systematic Approach Proc. VLDB 1983, pp. 8–19

    Google Scholar 

  2. M. W. Blasgen, K. P. Eswaran Storage and Access in Relational Data Bases IBM Systems Journal No. 4, 1977, pp. 363–377

    Google Scholar 

  3. D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. Stonebraker, D. Wood Implementation Techniques for Main Memory Database Systems Proc. ACM SIGMOD Conference, 1984, pp. 1–8

    Google Scholar 

  4. D. J. DeWitt, R. H. Gerber Multiprocessor Hash-Based Join Algorithms Proc. 1985 VLDB, pp. 151–164

    Google Scholar 

  5. N. Duppel, P. Peinl, G. Schiele, H. Zeller Progress Report #2 of PROSPECT University of Stuttgart, Department of Computer Science, Internal Report

    Google Scholar 

  6. R. J. Enbody, H. C. Du Dynamic Hashing Schemes ACM Computing Surveys 20, 2 (1988), pp. 85–113

    Article  Google Scholar 

  7. Gerber, Robert Howard Dataflow Query Processing Using Multiprocessor Hash-Partitioned Algorithms Dissertation, University of Wisconsin-Madison, Computer Sciences Technical Report #672, Oct.86

    Google Scholar 

  8. Th. Härder, A. Reuter Architektur von Datenbanksystemen für Non-Standard-Anwendungen Proc. GI-Fachtagung Karlsruhe, Springer Informatik-Fachberichte Nr. 94

    Google Scholar 

  9. A. Reuter, N. Duppel, P. Peinl, G. Schiele, H. Zeller An Outlook on PROSPECT University of Stuttgart, Department of Computer Science, Internal Report

    Google Scholar 

  10. S. W. Thompson (Ed.) TANDEM Systems Review (Several Papers on NonStop SQL) Vol. 4, No. 2, (July 1988): TANDEM Computers, 18922 Forge Drive, LOC 216–05, Cupertino, CA 95014

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Azenbergstr. 12, D-7000, Stuttgart 1, Deutschland

    H. Zeller

Authors
  1. H. Zeller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, Erwin-Schrödinger-Straße, D-6750, Kaiserslautern, Deutschland

    Theo Härder

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zeller, H. (1989). Parallelisierung von Anfragen auf komplexen Objekten durch Hash Joins. In: Härder, T. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik-Fachberichte, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74571-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74571-3_33

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-74571-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation