{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:10:22Z","timestamp":1737339022057,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672272"},{"type":"electronic","value":"9783540464396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46439-5_34","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:09:46Z","timestamp":1185934186000},"page":"495-509","source":"Crossref","is-referenced-by-count":1,"title":["Plug&Join: An Easy-To-Use Generic Algorithm for Efficiently Processing Equi and Non-equi Joins"],"prefix":"10.1007","author":[{"given":"Jochen","family":"van den Bercken","sequence":"first","affiliation":[]},{"given":"Martin","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Seeger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Aoki, P. M.: Generalizing \u201cSearch\u201d in Generalized Search Trees (Extended Abstract). ICDE 1998: 380\u2013389","DOI":"10.1109\/ICDE.1998.655801"},{"key":"34_CR2","unstructured":"Arge, L.; Procopiuc, O.; Ramaswamy, S.; Suel, T.; Vitter, J. S.: Scalable Sweeping-Based Spatial Join. VLDB 1998: 570\u2013581"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Becker, L.; Finke, U.; Hinrichs, K.: A New Algorithm for Computing Joins with Grid Files. ICDE 1993: 190\u2013197","DOI":"10.1109\/ICDE.1993.344063"},{"issue":"4","key":"34_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"Becker, B.; Gschwind, S.; Ohler, T.; Seeger, B.; Widmayer, P.: An Asymptotically Optimal Multiversion B-Tree. VLDB Journal 5(4): 264\u2013275 (1996)","journal-title":"VLDB Journal"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T.; Kriegel, H.-P.; Seeger, B.: Efficient Processing of Spatial Joins Using R-Trees. SIGMOD Conference 1993: 237\u2013246","DOI":"10.1145\/170035.170075"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013331","DOI":"10.1145\/93597.98741"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Van den Bercken, J.; Seeger, B.; Widmayer, P.: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999: 257","DOI":"10.1109\/ICDE.1999.754937"},{"key":"34_CR8","volume-title":"Tiger\/Line Precensus Files: 1995 technical documentation","author":"Bureau of the Census","year":"1996","unstructured":"Bureau of the Census: Tiger\/Line Precensus Files: 1995 technical documentation. Bureau of the Census, Washington DC. 1996"},{"key":"34_CR9","unstructured":"Cattell, R. (editor): The Object Database Standard: ODMG-93, Release 1.2, Morgan Kaufmann, 1996"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Ciaccia, P.; Patella, M.; Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB 1997: 426\u2013435","DOI":"10.1145\/275487.275495"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Deppisch, U.: S-tree: A Dynamic Balanced Signature Index for Office Retrieval. SIGIR 1986: 77\u201387","DOI":"10.1145\/253168.253189"},{"key":"34_CR12","unstructured":"DeWitt, D. J.; Naughton, J. F.; Schneider, D. A.: An Evaluation of Non-Equijoin Algorithms. VLDB 1991: 443\u2013452"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Dittrich, J.; Seeger, B.: Data Redundancy and Duplicate Detection in Spatial Join Processing. ICDE 2000: to appear","DOI":"10.1109\/ICDE.2000.839452"},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G. Graefe","year":"1993","unstructured":"Graefe, G.: Query Evaluation Techniques for Large Databases. Computing Surveys 25(2): 73\u2013170 (1993)","journal-title":"Computing Surveys"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, O.: Efficient Computation of Spatial Joins. ICDE 1993: 50\u201359","DOI":"10.1109\/ICDE.1993.344078"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"34_CR17","unstructured":"Hellerstein, J. M.; Naughton, J. F.; Pfeffer, A.: Generalized Search Trees for Database Systems. VLDB 1995: 562\u2013573"},{"key":"34_CR18","unstructured":"Helmer, S.; Moerkotte, G.: Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. VLDB 1997: 386\u2013395"},{"key":"34_CR19","unstructured":"Hoel, E. G.; Samet, H.: Benchmarking Spatial Join Operations with Spatial Output. VLDB 1995: 606\u2013618"},{"key":"34_CR20","unstructured":"Henrich, A.; Six, H.-W.; Widmayer, P.: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45\u201353"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Lomet, D. B.: Grow and Post Index Trees: Roles, Techniques and Future Potential. SSD 1991:183\u2013206","DOI":"10.1007\/3-540-54414-3_38"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Lo, M.-L.; Ravishankar, C. V.: Spatial Joins Using Seeded Trees. SIGMOD Conference 1994: 209\u2013220","DOI":"10.1145\/191839.191881"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Lo, M.-L.; Ravishankar, C. V.: Spatial Hash-Joins. SIGMOD Conference 1996: 247\u2013258","DOI":"10.1145\/233269.233337"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Koudas, N.; Sevcik, K. C: Size Separation Spatial Join. SIGMOD Conference 1997: 324\u2013335","DOI":"10.1145\/253260.253340"},{"issue":"1","key":"34_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/128762.128764","volume":"24","author":"P. Mishra","year":"1992","unstructured":"Mishra, P.; Eich, M. H.: Join Processing in Relational Databases. Computing Surveys 24(1):63\u2013113 (1992)","journal-title":"Computing Surveys"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Mamoulis, N.; Papadias, D.: Integration of Spatial Join Algorithms for Processing Multiple Inputs. SIGMOD Conference 1999: 1\u201312","DOI":"10.1145\/304182.304183"},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Orenstein, J.: Spatial Query Processing in an Object-Oriented Database System. SIGMOD Conference 1986: 326\u2013336","DOI":"10.1145\/16894.16886"},{"key":"34_CR28","doi-asserted-by":"crossref","unstructured":"Patel, J. M.; DeWitt, D. J.: Partition Based Spatial-Merge Join. SIGMOD Conference 1996: 259\u2013270","DOI":"10.1145\/233269.233338"},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013103","DOI":"10.1145\/223784.223798"},{"issue":"3","key":"34_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/6314.6315","volume":"11","author":"L. D. Shapiro","year":"1986","unstructured":"Shapiro, L. D.: Join Processing in Database Systems with Large Main Memories. TODS 11(3): 239\u2013264 (1986)","journal-title":"TODS"},{"key":"34_CR31","doi-asserted-by":"crossref","unstructured":"Soo, M. D.; Snodgrass, R. T.; Jensen, C. S.: Efficient Evaluation of the Valid-Time Natural Join. ICDE 1994: 282\u2013292","DOI":"10.1109\/ICDE.1994.283042"},{"key":"34_CR32","doi-asserted-by":"crossref","unstructured":"Zurek, T.: Optimisation of Partitioned Temporal Joins. BNCOD 1997: 101\u2013115","DOI":"10.1007\/3-540-63263-8_7"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46439-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:36:57Z","timestamp":1737337017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46439-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672272","9783540464396"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-46439-5_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}