{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:02:04Z","timestamp":1648918924772},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data &amp; Knowledge Engineering"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0169-023x(02)00021-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"67-83","source":"Crossref","is-referenced-by-count":1,"title":["Tie-breaking strategies for fast distance join processing"],"prefix":"10.1016","volume":"41","author":[{"given":"Hyoseop","family":"Shin","sequence":"first","affiliation":[]},{"given":"Bongki","family":"Moon","sequence":"additional","affiliation":[]},{"given":"Sukho","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(02)00021-6_BIB1","series-title":"Proceedings of the 24th VLDB Conference, New York, USA","first-page":"259","article-title":"Scalable sweeping-based spatial join","author":"Arge","year":"1998"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB2","series-title":"Proceedings of the 1990 ACM-SIGMOD Conference, Atlantic City, NJ","first-page":"322","article-title":"The R*-tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB3","unstructured":"S. Berchtold, D.A. Keim, H.-P. Kriegel, The X-tree: An index structure for high-dimensional data, in: Proceedings of the 22nd VLDB Conference, Bombay, India, September 1996"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB4","series-title":"Proceedings of the 1994 ACM-SIGMOD Conference, Minneapolis, Minnesota","first-page":"197","article-title":"Multi-step processing of spatial joins","author":"Brinkhoff","year":"1994"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB5","series-title":"Proceedings of the 1993 ACM-SIGMOD Conference, Washington, DC","first-page":"237","article-title":"Efficient processing of spatial joins using R-trees","author":"Brinkhoff","year":"1993"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB6","series-title":"Proceedings of the 1997 ACM-SIGMOD Conference, Tucson, AZ","first-page":"219","article-title":"On saying \u201cenough already!\u201d in SQL","author":"Carey","year":"1997"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB7","series-title":"Proceedings of the 24th VLDB Conference, New York, NY","first-page":"158","article-title":"Reducing the braking distance of an SQL query engine","author":"Carey","year":"1998"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB8","series-title":"Proceedings of the 2000 ACM-SIGMOD Conference, Dallas, TX","first-page":"189","article-title":"Closest pair queries in spatial databases","author":"Corral","year":"2000"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB9","series-title":"Proceedings of the 9th International Conference on Data Engineering","first-page":"50","article-title":"Efficient computation of spatial joins","author":"G\u00fcnther","year":"1993"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB10","series-title":"Proceedings of the 1984 ACM-SIGMOD Conference, Boston, MA","first-page":"47","article-title":"R-Trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB11","series-title":"Proceedings of the 1998 ACM-SIGMOD Conference, Seattle, WA","first-page":"237","article-title":"Incremental distance join algorithms for spatial databases","author":"Hjaltason","year":"1998"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB12","series-title":"Proceedings of the 23rd VLDB Conference","first-page":"396","article-title":"Spatial joins using R-Tree: Breadth-first traversal with global optimization","author":"Huang","year":"1997"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB13","series-title":"Proceedings of the 1994 ACM-SIGMOD Conference, Minneapolis, Minnesota","first-page":"209","article-title":"Spatial joins using seeded trees","author":"Lo","year":"1994"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB14","series-title":"Proceedings of the 1996 ACM-SIGMOD Conference, Montreal, Canada","first-page":"247","article-title":"Spatial hash-join","author":"Lo","year":"1996"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB15","unstructured":"Bureau of the Census, Tiger\/Line Precensus Files: 1997 technical documentation, Washington, DC, 1997"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB16","series-title":"Proceedings of the 1996 ACM-SIGMOD Conference, Montreal, Canada","first-page":"259","article-title":"Partition based spatial-merge join","author":"Patel","year":"1996"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB17","series-title":"Computational Geometry: an Introduction","author":"Preparata","year":"1991"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB18","series-title":"Proceedings of the 7th International Conference on Data Engineering","first-page":"500","article-title":"Spatial join indices","author":"Rotem","year":"1991"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB19","series-title":"Proceedings of the 13th VLDB Conference","first-page":"507","article-title":"The R+-Tree: A dynamic index for multi-dimensional objects","author":"Sellis","year":"1987"},{"key":"10.1016\/S0169-023X(02)00021-6_BIB20","series-title":"Proceedings of the 2000 ACM-SIGMOD Conference, Dallas, TX","first-page":"343","article-title":"Adaptive multi-stage distance join processing","author":"Shin","year":"2000"}],"container-title":["Data &amp; Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X02000216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X02000216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:26:07Z","timestamp":1556850367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X02000216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0169023X02000216"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(02)00021-6","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}