Skip to main content
SpringerLink
Log in

Plug&Join: An Easy-To-Use Generic Algorithm for Efficiently Processing Equi and Non-equi Joins

  • Conference paper
  • First Online:
Advances in Database Technology — EDBT 2000 (EDBT 2000)

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

Included in the following conference series:

Abstract

This paper presents Plug&Join, a new generic algorithm for efficiently processing a broad class of different join types in extensible database systems. Depending on the join predicate Plug&Join is called with a suitable type of index structure as a parameter. If the inner relation fits in memory, the algorithm builds a memory resident index of the desired type on the inner relation and probes all tuples of the outer relation against the index. Otherwise, a memory resident index is created by sampling the inner relation. The index is then used as a partitioning function for both relations.

In order to demonstrate the flexibility of Plug&Join, we present how to implement equi joins, spatial joins and subset joins by using memory resident B+-trees, R-trees and S-trees, respectively. Moreover, results obtained from different experiments for the spatial join show that Plug&Join is competitive to special- purpose methods like the Partition Based Spatial-Merge Join algorithm.

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

Access this chapter

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 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.

Similar content being viewed by others

References

  1. Aoki, P. M.: Generalizing “Search” in Generalized Search Trees (Extended Abstract). ICDE 1998: 380–389

    Google Scholar 

  2. Arge, L.; Procopiuc, O.; Ramaswamy, S.; Suel, T.; Vitter, J. S.: Scalable Sweeping-Based Spatial Join. VLDB 1998: 570–581

    Google Scholar 

  3. Becker, L.; Finke, U.; Hinrichs, K.: A New Algorithm for Computing Joins with Grid Files. ICDE 1993: 190–197

    Google Scholar 

  4. Becker, B.; Gschwind, S.; Ohler, T.; Seeger, B.; Widmayer, P.: An Asymptotically Optimal Multiversion B-Tree. VLDB Journal 5(4): 264–275 (1996)

    Article  Google Scholar 

  5. Brinkhoff, T.; Kriegel, H.-P.; Seeger, B.: Efficient Processing of Spatial Joins Using R-Trees. SIGMOD Conference 1993: 237–246

    Google Scholar 

  6. Beckmann, N.; Kriegel, H.-P.; Schneider, R.; Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322–331

    Google Scholar 

  7. Van den Bercken, J.; Seeger, B.; Widmayer, P.: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999: 257

    Google Scholar 

  8. Bureau of the Census: Tiger/Line Precensus Files: 1995 technical documentation. Bureau of the Census, Washington DC. 1996

    Google Scholar 

  9. Cattell, R. (editor): The Object Database Standard: ODMG-93, Release 1.2, Morgan Kaufmann, 1996

    Google Scholar 

  10. Ciaccia, P.; Patella, M.; Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB 1997: 426–435

    Google Scholar 

  11. Deppisch, U.: S-tree: A Dynamic Balanced Signature Index for Office Retrieval. SIGIR 1986: 77–87

    Google Scholar 

  12. DeWitt, D. J.; Naughton, J. F.; Schneider, D. A.: An Evaluation of Non-Equijoin Algorithms. VLDB 1991: 443–452

    Google Scholar 

  13. Dittrich, J.; Seeger, B.: Data Redundancy and Duplicate Detection in Spatial Join Processing. ICDE 2000: to appear

    Google Scholar 

  14. Graefe, G.: Query Evaluation Techniques for Large Databases. Computing Surveys 25(2): 73–170 (1993)

    Article  Google Scholar 

  15. Günther, O.: Efficient Computation of Spatial Joins. ICDE 1993: 50–59

    Google Scholar 

  16. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47–57

    Google Scholar 

  17. Hellerstein, J. M.; Naughton, J. F.; Pfeffer, A.: Generalized Search Trees for Database Systems. VLDB 1995: 562–573

    Google Scholar 

  18. Helmer, S.; Moerkotte, G.: Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. VLDB 1997: 386–395

    Google Scholar 

  19. Hoel, E. G.; Samet, H.: Benchmarking Spatial Join Operations with Spatial Output. VLDB 1995: 606–618

    Google Scholar 

  20. Henrich, A.; Six, H.-W.; Widmayer, P.: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45–53

    Google Scholar 

  21. Lomet, D. B.: Grow and Post Index Trees: Roles, Techniques and Future Potential. SSD 1991:183–206

    Google Scholar 

  22. Lo, M.-L.; Ravishankar, C. V.: Spatial Joins Using Seeded Trees. SIGMOD Conference 1994: 209–220

    Google Scholar 

  23. Lo, M.-L.; Ravishankar, C. V.: Spatial Hash-Joins. SIGMOD Conference 1996: 247–258

    Google Scholar 

  24. Koudas, N.; Sevcik, K. C: Size Separation Spatial Join. SIGMOD Conference 1997: 324–335

    Google Scholar 

  25. Mishra, P.; Eich, M. H.: Join Processing in Relational Databases. Computing Surveys 24(1):63–113 (1992)

    Article  Google Scholar 

  26. Mamoulis, N.; Papadias, D.: Integration of Spatial Join Algorithms for Processing Multiple Inputs. SIGMOD Conference 1999: 1–12

    Google Scholar 

  27. Orenstein, J.: Spatial Query Processing in an Object-Oriented Database System. SIGMOD Conference 1986: 326–336

    Google Scholar 

  28. Patel, J. M.; DeWitt, D. J.: Partition Based Spatial-Merge Join. SIGMOD Conference 1996: 259–270

    Google Scholar 

  29. Papadias, D.; Theodoridis, Y.; Sellis, T. K.; Egenhofer, M. J.: Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees. SIGMOD Conference 1995: 92–103

    Google Scholar 

  30. Shapiro, L. D.: Join Processing in Database Systems with Large Main Memories. TODS 11(3): 239–264 (1986)

    Article  Google Scholar 

  31. Soo, M. D.; Snodgrass, R. T.; Jensen, C. S.: Efficient Evaluation of the Valid-Time Natural Join. ICDE 1994: 282–292

    Google Scholar 

  32. Zurek, T.: Optimisation of Partitioned Temporal Joins. BNCOD 1997: 101–115

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Marburg, Hans-Meerwein-Straße, 35032, Marburg, Germany

    Jochen van den Bercken, Martin Schneider & Bernhard Seeger

Authors
  1. Jochen van den Bercken
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernhard Seeger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of California, Los Angeles, CA, 90095, USA

    Carlo Zaniolo

  2. Computer Science Department, University of Karlsruhe, P.O. Box 6980, 76128, Karlsruhe, Germany

    Peter C. Lockemann

  3. University of Konstanz, P.O. Box D188, 78457, Konstanz, Germany

    Marc H. Scholl  & Torsten Grust  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van den Bercken, J., Schneider, M., Seeger, B. (2000). Plug&Join: An Easy-To-Use Generic Algorithm for Efficiently Processing Equi and Non-equi Joins. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds) Advances in Database Technology — EDBT 2000. EDBT 2000. Lecture Notes in Computer Science, vol 1777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46439-5_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-46439-5_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46439-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation