{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:29Z","timestamp":1725488249133},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679776"},{"type":"electronic","value":"9783540444725"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44472-6_9","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T01:16:06Z","timestamp":1185844566000},"page":"107-116","source":"Crossref","is-referenced-by-count":1,"title":["2-D Spatial Indexing Scheme in Optimal Time"],"prefix":"10.1007","author":[{"given":"Nectarios","family":"Kitsios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanassios","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Tsaknakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Vassiliadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"unstructured":"Agarwal, P.K.: Range searching, Technical Report CS-1996-05, Dept. of Computer Science, Duke University (1996)","key":"9_CR1"},{"doi-asserted-by":"crossref","unstructured":"Arge, L., Vitter, J.S.:Optimal dynamic interval management in external memory, Proceedings of the IEEE Symposium on Foundations of Computer Science (1996)","key":"9_CR2","DOI":"10.1109\/SFCS.1996.548515"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. R. Driscoll","year":"1989","unstructured":"Driscoll, J. R., Sarnak, N., Sleator, D. D., Tarjan, R. E.: Making data structures persistent, J. Comp. Syst. Sci. 38 pp. 86\u2013124 (1989)","journal-title":"J. Comp. Syst. Sci"},{"doi-asserted-by":"crossref","unstructured":"Comer, D.: The ubiquitous B-tree, ACM Computing Surveys, 11(2) (1979)","key":"9_CR4","DOI":"10.1145\/356770.356776"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(87)90174-8","volume":"25","author":"F. O","year":"1987","unstructured":"Fries, O., Mehlhorn, K., Naher, S. and Tsakalidis, A.: A loglogn data structure for three sided rane queries, Inform. Process. Lett. 25, pp. 269\u2013273 (1987)","journal-title":"Inform. Process. Lett"},{"doi-asserted-by":"crossref","unstructured":"Gabow, H. N., Bentley, J. L., and Tarjan, R. E.: Scaling and related techniques for geometry problems, in Proceedings, l6th Annual ACM Symp. on Theory of Computing, pp. 135\u2013143 (1984)","key":"9_CR6","DOI":"10.1145\/800057.808675"},{"doi-asserted-by":"crossref","unstructured":"Gupta, P., Janardan, R., Smid, M. and Dasgupta, B.: The rectangle enclosure and point dominance problem revisited, in, Proceedings, 11th Annual ACM Symp. on Comp. Geometry, pp. 162\u2013171 (1995)","key":"9_CR7","DOI":"10.1145\/220279.220297"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1994","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor, SIAM J. Comput. 13, pp. 338\u2013355 (1994)","journal-title":"SIAM J. Comput."},{"unstructured":"Karlsson, R.G. and Overmars, M. H.: Scanline algorithms on a grid, Technical Rep. RUU-CS-86-18, Dept. of Computer Science, University of Utrecht (1986)","key":"9_CR9"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/197405.197408","volume":"26","author":"J. Matousek","year":"1994","unstructured":"Matousek, J.: Geometric range searching, ACM Computing Surveys 26, pp. 421\u2013561 (1994)","journal-title":"ACM Computing Surveys"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees, SIAM J. Comput. 14, pp. 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0196-6774(88)90041-7","volume":"9","author":"M.H. Overmars","year":"1988","unstructured":"Overmars, M.H.: Efficient data structures for range searching on a grid, J. Algorithms 9, pp. 254\u2013275 (1988)","journal-title":"J. Algorithms"},{"key":"9_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P. and Shamos, M. I.: Computational Geometry, Springer-Verlag, New York, (1985)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures, C. ACM 23 pp. 229\u2013239 (1980)","journal-title":"C. ACM"},{"unstructured":"Grossi, R., Italiano, G., F.: Efficient cross-trees for external memory, In J. Abello and J.S. Vitter, editors, External Algorithms and Visualization (1998)","key":"9_CR15"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching, ACM SIGMOD, (1984)","key":"9_CR16","DOI":"10.1145\/602259.602266"},{"unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.,: The R+-tree: A Dynamic Index for Multidimensional Objects, VLDB (1987)","key":"9_CR17"},{"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, ACM SIGMOD (1990)","key":"9_CR18","DOI":"10.1145\/93597.98741"},{"doi-asserted-by":"crossref","unstructured":"Papadias, D., Theodoridis, Y.: Spatial Relations, Minimum Bounding Rectangles, and Spatial Data Structures, International Journal of Geographic Information Science, Vol. 11(2) (1997)","key":"9_CR19","DOI":"10.1080\/136588197242428"},{"doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Papadias, D., Stefanakis, E., Sellis, T.: Direction Relations and Two-Dimensional Range Queries: Optimization Techniques, Data & Knowledge Engineering, vol. 27(3) (1998)","key":"9_CR20","DOI":"10.1016\/S0169-023X(97)00060-8"},{"doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Vazirgiannis, M., Sellis, T.:Spatio-Temporal Indexing for Large Multimedia Applications, 3\u201d IEEE Conference on Multimedia Computing and Systems, (1996)","key":"9_CR21","DOI":"10.1109\/MMCS.1996.535011"},{"doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.: A Model for The Prediction of R-Tree Performance, ACM PODS(1996)","key":"9_CR22","DOI":"10.1145\/237661.237705"},{"doi-asserted-by":"crossref","unstructured":"Gaede, V.: Optimal Redundancy in Spatial Database Systems, International Symposium on Spatial Databases (SSD) (1995)","key":"9_CR23","DOI":"10.1007\/3-540-60159-7_7"},{"unstructured":"Hoel, E., Samet, H.: Benchmarking Spatial Join Operations with Spatial Output, VLDB Conference (1995)","key":"9_CR24"},{"doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Ramaswamy, S., Vengroff, D.E., Vitter, J.S.: Indexing for data models with constraints and classes, Journal of Computer and System Sciences, 52(3) (1996)","key":"9_CR25","DOI":"10.1006\/jcss.1996.0043"},{"doi-asserted-by":"crossref","unstructured":"Mehlhorn., K., Data Structures and Algorithms 3-Multidimensional Searching and Computational Geometry, Springer Verlag (1984)","key":"9_CR26","DOI":"10.1007\/978-3-642-69900-9_2"},{"unstructured":"Ramaswamy, S., Subramanian, S.: Path Caching: a technique for optimal external searching in Proceedings of the 13th ACM Conference on Principles of Database Systems (1994)","key":"9_CR27"},{"unstructured":"Subramanian, S., Ramaswamy, S.: The P-range tree: a new data structure for range searching in secondary memeory, ACM-SIAM Symposium on Discrete Algorithms (1995)","key":"9_CR28"},{"doi-asserted-by":"crossref","unstructured":"Vengroff, D.,E., Vitter, J.,S., Efficient 3-d range searching in external memory, ACM Symposium on Theory of Computation (1996)","key":"9_CR29","DOI":"10.1145\/237814.237864"},{"doi-asserted-by":"crossref","unstructured":"Vitter, J.S.: External Memory Algorithms invited paper in European Symposium on Algorithms (1998)","key":"9_CR30","DOI":"10.1145\/275487.275501"},{"doi-asserted-by":"crossref","unstructured":"Beam, P., Fich, F.: Optimal Bounds for the Predecessor Problem, In Proceedings of the Thirty First Annual ACM Symposium on Theory of Computing, Atlanta, GA (1999)","key":"9_CR31","DOI":"10.1145\/301250.301323"},{"doi-asserted-by":"crossref","unstructured":"Arge, L., Samoladas, V., Vitter, J.S.: Two dimensional indexability and optimal range search indexing, in Proceedings of the ACM Symposium on Principles of Database Systems, (1999)","key":"9_CR32","DOI":"10.1145\/303976.304010"}],"container-title":["Lecture Notes in Computer Science","Current Issues in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44472-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:50:49Z","timestamp":1556711449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44472-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679776","9783540444725"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-44472-6_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}