{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:07:38Z","timestamp":1725768458541},"reference-count":22,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ideas.2002.1029653","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:14:31Z","timestamp":1056564871000},"page":"23-32","source":"Crossref","is-referenced-by-count":1,"title":["Graph partition based multi-way spatial joins"],"prefix":"10.1109","author":[{"family":"Xuemin Lin","sequence":"first","affiliation":[]},{"family":"Hai-Xin Lu","sequence":"additional","affiliation":[]},{"family":"Qing Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1145\/233269.233337","article-title":"Spatial Hash Joins","author":"lo","year":"1996","journal-title":"ACM SIGMOD '96"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/128762.128764"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304183"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16886"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98743"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1145\/233269.233338","article-title":"Partition Based Spatial-Merge Join","author":"patel","year":"1996","journal-title":"ACM SIGMOD '96"},{"key":"ref16","article-title":"Algorithms for Querying by Spatial Structure","author":"papadias","year":"1998","journal-title":"VLDB'98"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303981"},{"key":"ref18","first-page":"229","article-title":"Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation","author":"park","year":"1999","journal-title":"SSD'99"},{"journal-title":"Computational Geometry","year":"1988","author":"preparata","key":"ref19"},{"journal-title":"Computers and Intractability a guide to the theory of the NP-Completeness","year":"1979","author":"garey","key":"ref4"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276326"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref8","article-title":"Graph Partition Based Multi-Way Spatial Joins","author":"lin","year":"2001","journal-title":"Full paper"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253340"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170075"},{"key":"ref1","article-title":"Scalable Sweeping-Based Spatial Join","author":"arge","year":"1998","journal-title":"VLDB'98"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191881"},{"key":"ref20","first-page":"16","article-title":"Filter Trees for Managing Spatial Over a Range of Size Granularities","author":"sevcik","year":"1996","journal-title":"VLDB'96"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47724-1_12"},{"journal-title":"Technical Report","article-title":"Tiger\/Line files (Redestricting Census) (tm). 2000","year":"2000","key":"ref21"}],"event":{"name":"International Database Engineering and Applications","acronym":"IDEAS-02","location":"Edmonton, Alta., Canada"},"container-title":["Proceedings International Database Engineering and Applications Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7997\/22119\/01029653.pdf?arnumber=1029653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:42:22Z","timestamp":1497552142000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/ideas.2002.1029653","relation":{},"subject":[]}}