























|
 |
|
Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
|
 |
Jochen Van den Bercken,
Martin Schneider, and
Bernhard Seeger
View Paper (PDF)
Return to Query Systems
 |
|
References
|
 |
Note: References link to DBLP on the Web.
-
[1]
-
Paul M. Aoki
: Generalizing ``Search'' in Generalized Search Trees (Extended Abstract).
ICDE 1998
: 380-389
-
[2]
-
Lars Arge
,
Octavian Procopiuc
,
Sridhar Ramaswamy
,
Torsten Suel
,
Jeffrey Scott Vitter
: Scalable Sweeping-Based Spatial Join.
VLDB 1998
: 570-581
-
[3]
-
Ludger Becker
,
Klaus Hinrichs
,
Ulrich Finke
: A New Algorithm for Computing Joins with Grid Files.
ICDE 1993
: 190-197
-
[4]
-
Bruno Becker
,
Stephan Gschwind
,
Thomas Ohler
,
Bernhard Seeger
,
Peter Widmayer
: An Asymptotically Optimal Multiversion B-Tree.
VLDB Journal 5(4)
: 264-275(1996)
-
[5]
-
Thomas Brinkhoff
,
Hans-Peter Kriegel
,
Bernhard Seeger
: Efficient Processing of Spatial Joins Using R-Trees.
SIGMOD Conference 1993
: 237-246
-
[6]
-
Norbert Beckmann
,
Hans-Peter Kriegel
,
Ralf Schneider
,
Bernhard Seeger
: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.
SIGMOD Conference 1990
: 322-331
-
[7]
-
Jochen Van den Bercken
,
Bernhard Seeger
,
Peter Widmayer
: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins.
ICDE 1999
: 257
-
[8]
-
...
-
[9]
-
R. G. G. Cattell
: The Object Database Standard: ODMG-93 (Release 1.2).
Morgan Kaufmann
1996
-
[10]
-
Paolo Ciaccia
,
Marco Patella
,
Pavel Zezula
: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces.
VLDB 1997
: 426-435
-
[11]
-
Uwe Deppisch
: S-Tree: A Dynamic Balanced Signature Index for Office Retrieval.
SIGIR 1986
: 77-87
-
[12]
-
David J. DeWitt
,
Jeffrey F. Naughton
,
Donovan A. Schneider
: An Evaluation of Non-Equijoin Algorithms.
VLDB 1991
: 443-452
-
[13]
-
Jens-Peter Dittrich
,
Bernhard Seeger
: Data Redundancy and Duplicate Detection in Spatial Join Processing.
ICDE 2000
: 535-546
-
[14]
-
Goetz Graefe
: Query Evaluation Techniques for Large Databases.
ACM Computing Surveys 25(2)
: 73-170(1993)
-
[15]
-
Oliver Günther
: Efficient Computation of Spatial Joins.
ICDE 1993
: 50-59
-
[16]
-
Antonin Guttman
: R-Trees: A Dynamic Index Structure for Spatial Searching.
SIGMOD Conference 1984
: 47-57
-
[17]
-
Joseph M. Hellerstein
,
Jeffrey F. Naughton
,
Avi Pfeffer
: Generalized Search Trees for Database Systems.
VLDB 1995
: 562-573
-
[18]
-
Sven Helmer
,
Guido Moerkotte
: Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates.
VLDB 1997
: 386-395
-
[19]
-
Erik G. Hoel
,
Hanan Samet
: Benchmarking Spatial Join Operations with Spatial Output.
VLDB 1995
: 606-618
-
[20]
-
Andreas Henrich
,
Hans-Werner Six
,
Peter Widmayer
: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects.
VLDB 1989
: 45-53
-
[21]
-
David B. Lomet
: Grow and Post Index Trees: Roles, Techniques and Future Potential.
SSD 1991
: 183-206
-
[22]
-
Ming-Ling Lo
,
Chinya V. Ravishankar
: Spatial Joins Using Seeded Trees.
SIGMOD Conference 1994
: 209-220
-
[23]
-
Ming-Ling Lo
,
Chinya V. Ravishankar
: Spatial Hash-Joins.
SIGMOD Conf. 1996
: 247-258
-
[24]
-
Nick Koudas
,
Kenneth C. Sevcik
: Size Separation Spatial Join.
SIGMOD Conference 1997
: 324-335
-
[25]
-
Priti Mishra
,
Margaret H. Eich
: Join Processing in Relational Databases.
ACM Computing Surveys 24(1)
: 63-113(1992)
-
[26]
-
Nikos Mamoulis
,
Dimitris Papadias
: Integration of Spatial Join Algorithms for Processing Multiple Inputs.
SIGMOD Conference 1999
: 1-12
-
[27]
-
Jack A. Orenstein
: Spatial Query Processing in an Object-Oriented Database System.
SIGMOD Conference 1986
: 326-336
-
[28]
-
Jignesh M. Patel
,
David J. DeWitt
: Partition Based Spatial-Merge Join.
SIGMOD Conf. 1996
: 259-270
-
[29]
-
Dimitris Papadias
,
Yannis Theodoridis
,
Timos K. Sellis
,
Max J. Egenhofer
: Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees.
SIGMOD Conference 1995
: 92-103
-
[30]
-
Leonard D. Shapiro
: Join Processing in Database Systems with Large Main Memories.
TODS 11(3)
: 239-264(1986)
-
[31]
-
Michael D. Soo
,
Richard T. Snodgrass
,
Christian S. Jensen
: Efficient Evaluation of the Valid-Time Natural Join.
ICDE 1994
: 282-292
-
[32]
-
Thomas Zurek
: Optimisation of Partitioned Termporal Joins.
BNCOD 1997
: 101-115
Referenced by
-
Jochen Van den Bercken
,
Jens-Peter Dittrich
,
Bernhard Seeger
: javax.XXL: A prototype for a Library of Query processing Algorithms.
SIGMOD Conference 2000
: 588
 |
|
BIBTEX
|
 |
@inproceedings{DBLP:conf/edbt/BerckenSS00,
author = {Jochen Van den Bercken and
Martin Schneider and
Bernhard Seeger},
editor = {Carlo Zaniolo and
Peter C. Lockemann and
Marc H. Scholl and
Torsten Grust},
title = {Plug{\&}Join: An easy-to-use Generic Algorithm for Efficiently
Processing Equi and Non-Equi Joins},
booktitle = {Advances in Database Technology - EDBT 2000, 7th International
Conference on Extending Database Technology, Konstanz, Germany,
March 27-31, 2000, Proceedings},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1777},
year = {2000},
isbn = {3-540-67227-3},
pages = {495-509},
crossref = {DBLP:conf/edbt/2000},
bibsource = {DBLP, http://dblp.uni-trier.de} } },
DiSC'01 Copyright ©2002 ACM Inc.
|