{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:08Z","timestamp":1775282288843,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0925-7721(97)00020-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:57:07Z","timestamp":1051127827000},"page":"211-236","source":"Crossref","is-referenced-by-count":7,"title":["Experiments on the practical I\/O efficiency of geometric algorithms: Distribution sweep versus plane sweep"],"prefix":"10.1016","volume":"9","author":[{"given":"Yi-Jen","family":"Chiang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0925-7721(97)00020-5_BIB1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The input\/output complexity of sorting and related problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Commun. ACM"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB2","series-title":"Proceedings Workshop on Algorithms and Data Structures","first-page":"334","article-title":"The buffer tree: A new technique for optimal I\/O-algorithms","volume":"955","author":"Arge","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB3","series-title":"Proceedings International Symposium on Algorithms and Computation","first-page":"82","article-title":"The I\/O-complexity of ordered binary-decision diagram manipulation","volume":"1004","author":"Arge","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB4","series-title":"Proceedings Workshop on Algorithms and Data Structures","first-page":"83","article-title":"A general lower bound on the I\/O-complexity of comparison-based algorithms","volume":"709","author":"Arge","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB5","series-title":"Proceedings European Symposium Algorithms","first-page":"295","article-title":"External-memory algorithms for processing line segments in geographic information systems","volume":"979","author":"Arge","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB7","series-title":"Proceedings 1st ACM-SIAM Symposium on Discrete Algorithms","first-page":"91","article-title":"Experiments on traveling salesman heuristics","author":"Bentley","year":"1990"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB8","series-title":"Proceedings 6th Annual ACM Symposium on Computational Geometry","first-page":"187","article-title":"K-d trees for semidynamic point sets","author":"Bentley","year":"1990"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB9","series-title":"Proceedings CMU 25th Anniversary Symposium","article-title":"Tools for experiments on algorithms","author":"Bentley","year":"1990"},{"issue":"4","key":"10.1016\/S0925-7721(97)00020-5_BIB10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","article-title":"Fast algorithms for geometric traveling salesman problems","volume":"4","author":"Bentley","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB11","series-title":"Proceedings Workshop on Algorithms and Data Structures","first-page":"381","article-title":"Topology B-trees and their applications","volume":"955","author":"Callahan","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB12","series-title":"Proceedings ACM-SIAM Symposium on Discrete Algorithms","first-page":"139","article-title":"External-memory graph algorithms","author":"Chiang","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB14","article-title":"Virtual memory for data parallel computing","author":"Cormen","year":"1992"},{"issue":"1\u20132","key":"10.1016\/S0925-7721(97)00020-5_BIB15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/jpdc.1993.1004","article-title":"Fast permuting in disk arrays","volume":"17","author":"Cormen","year":"1993","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB16","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB17","article-title":"Asymptotically tight bounds for performing BMMC permutations on parallel disk systems","author":"Cormen","year":"1994"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB18","unstructured":"T. Doeppner, Personal communication, 1995."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB19","series-title":"Proceedings International Symposium on Algorithms and Computation","article-title":"Memory paging for connectivity and path problems in graphs","author":"Feuerstein","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB20","series-title":"Proceedings Workshop on Orders, Algorithms and Applications (ORDAL '94)","first-page":"117","article-title":"Orders, implicit k-sets representation and fast halfplane searching","author":"Franciosa","year":"1994"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB21","series-title":"Proceedings ACM-SIAM Symposium on Discrete Algorithms","first-page":"175","article-title":"A data structure for dynamically maintaining rooted trees","author":"Frederickson","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB22","unstructured":"P. Galvin, Personal communication, 1995."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB23","series-title":"Proceedings ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"222","article-title":"Blocking for external graph searching","author":"Goodrich","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB24","series-title":"Proceedings IEEE Symposium on Foundations of Computer Science","first-page":"714","article-title":"External-memory computational geometry","author":"Goodrich","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB25","series-title":"Proceedings ACM Symposium on Principles of Database Systems","first-page":"233","article-title":"Indexing for data models with constraints and classes","author":"Kanellakis","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB26","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0220050","article-title":"The maximum size of dynamic data structures","volume":"20","author":"Kenyon-Mathieu","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB27","series-title":"Proceedings ACM Symposium on Parallel Algorithms and Architectures","first-page":"120","article-title":"Deterministic distribution sort in shared and distributed memory multiprocessors","author":"Nodine","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB28","series-title":"Proceedings of the 26th Hawaii International Conference on Systems Sciences","article-title":"Paradigms for optimal sorting with multiple disks","author":"Nodine","year":"1993"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB29","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB30","series-title":"Proceedings ACM SIGMOD International Conference on Management of Data","first-page":"139","article-title":"OODB indexing by class-division","author":"Ramaswamy","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB31","series-title":"Proceedings ACM Symposium on Principles of Database Systems","first-page":"25","article-title":"Path caching: A technique for optimal external searching","author":"Ramaswamy","year":"1994"},{"issue":"3","key":"10.1016\/S0925-7721(97)00020-5_BIB32","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.268881","article-title":"An introduction to disk drive modeling","volume":"27","author":"Ruemmler","year":"1994","journal-title":"IEEE Comput."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB33","series-title":"Operating System Concepts","author":"Silberschatz","year":"1991"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB34","series-title":"Proceedings ACM-SIAM Symposium on Discrete Algorithms","first-page":"378","article-title":"The P-range tree: A new data structure for range searching in secondary memory","author":"Subramanian","year":"1995"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB35","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01530929","article-title":"The input\/output complexity of transitive closure","volume":"3","author":"Ullman","year":"1991","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/S0925-7721(97)00020-5_BIB36","series-title":"Proceedings DAGS Symposium on Parallel Computation","article-title":"A transparent parallel I\/O environment","author":"Vengroff","year":"1994"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB37","series-title":"Proceedings IEEE Symposium on Parallel and Distributed Computing","article-title":"I\/O-efficient scientific computation using TPIE","author":"Vengroff","year":"1995"},{"issue":"2\u20133","key":"10.1016\/S0925-7721(97)00020-5_BIB38","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01185207","article-title":"Algorithms for parallel memory I: Two-level memories","volume":"12","author":"Vitter","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(97)00020-5_BIB39","series-title":"Proceedings International Symposium on Algorithms and Computation","article-title":"Further computational geometry in secondary memory","author":"Zhu","year":"1994"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T12:26:12Z","timestamp":1556367972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0925772197000205"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00020-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}