{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T04:07:25Z","timestamp":1742184445395,"version":"3.38.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1109\/tkde.2002.1047776","type":"journal-article","created":{"date-parts":[[2003,1,3]],"date-time":"2003-01-03T17:55:00Z","timestamp":1041616500000},"page":"1400-1421","source":"Crossref","is-referenced-by-count":10,"title":["Efficient join-index-based spatial-join processing: a clustering approach"],"prefix":"10.1109","volume":"14","author":[{"given":"S.","family":"Shekhar","sequence":"first","affiliation":[]},{"family":"Chang-Tien Lu","sequence":"additional","affiliation":[]},{"given":"S.","family":"Chawla","sequence":"additional","affiliation":[]},{"given":"S.","family":"Ravada","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680020402"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1993.344063"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/363011.363155"},{"volume-title":"Graphs and Hypergraphs","year":"1976","author":"Berge","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191880"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170075"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/69.649322"},{"key":"ref8","first-page":"127","article-title":"An Evaluation of Buffer Management Strategies for Relational Database Systems","author":"Chou","year":"1985","journal-title":"Proc. 11th Int\u2019l Conf. Very Large Data Bases"},{"volume-title":"Introduction to Algorithms","year":"1991","author":"Cormen","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60119-4_9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/69.87978"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1993","author":"Garey","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989427470X"},{"article-title":"Scheduling of Page Fetches in Join Operation Using Bc-Trees","volume-title":"Proc. Int\u2019l Conf. Data Eng.","author":"Goyal","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152611"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1993.344078"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1991.185177"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"volume-title":"Informix, White Papers","year":"1999","key":"ref19"},{"volume-title":"Building the Data Warehouse","year":"1992","author":"Inmon","key":"ref20"},{"article-title":"hMetis Home Page","year":"2002","author":"Karypis","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1997.597203"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"article-title":"Metis Home Page","year":"2002","author":"Karypis","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1996.508075"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02510240"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380370"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191881"},{"article-title":"Scheduling of Page-Fetches in Join Operations","volume-title":"Proc. Seventh Int\u2019l Conf. Very Large Databases","author":"Merrett","key":"ref31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/128762.128764"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/32.21722"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3148.3325"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1991.131499"},{"key":"ref36","first-page":"257","article-title":"A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model","volume-title":"Proc. Eighth Int\u2019l Conf. Very Large Data Bases","author":"Sacco"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/69.755614"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/69.567054"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/358699.358703"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56869-7_22"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/22952.22955"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/22458\/01047776.pdf?arnumber=1047776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T05:06:45Z","timestamp":1742101605000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1047776\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,11]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2002.1047776","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}