{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T10:53:37Z","timestamp":1793530417720,"version":"4.5.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent Information Systems"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1012809914301","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T15:09:07Z","timestamp":1040656147000},"page":"215-240","source":"Crossref","is-referenced-by-count":42,"title":["SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees"],"prefix":"10.1007","volume":"17","author":[{"given":"Walid G.","family":"Aref","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ihab F.","family":"Ilyas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"382055_CR1","doi-asserted-by":"crossref","unstructured":"Aref, W.G., Barbar\u00e1, D., and Vallabhaneni, P. (1995). The Handwritten Trie: Indexing Electronic Ink. In Proceedings of SIGMOD'95, San Jose, California.","DOI":"10.1145\/223784.223811"},{"key":"382055_CR2","doi-asserted-by":"crossref","unstructured":"Barclay, T., Gray, J., and Slutz, D. (2000). Microsoft Terraserver: A Tpatial Data Warehouse. In Proceedings of SIGMOD'00, Dallas, TX.","DOI":"10.1145\/342009.335424"},{"key":"382055_CR3","volume-title":"Lecture Notes in Computer Science, Vol. 1274","author":"R. Bayer","year":"1997","unstructured":"Bayer, R. (1997). The Universal B-Tree for Multidimensional Indexing: General Concepts. In Lecture Notes in Computer Science, Vol. 1274. Berlin: Springer-Verlag."},{"key":"382055_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., and Seeger, B. (1990). The R*-Tree: An Efficient Robust Access Method for Points and Rectangles. SIGMOD Record, 19(2).","DOI":"10.1145\/93605.98741"},{"key":"382055_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"19","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L. (1975). Multidimensional Binary Search Trees used for Associative Searching. Communications of the ACM, 19, 509-517.","journal-title":"Communications of the ACM"},{"key":"382055_CR6","volume-title":"Lecture Notes in Computer Science, Vol. 1377","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., Boehm, C., and Kriegel, H.-P. (1998). Improving the Query Performance of High-Dimensional Index Structures by Bulk Load Operations. In Lecture Notes in Computer Science, Vol. 1377. Berlin: Springer-Verlag."},{"key":"382055_CR7","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.-P., and Seeger, B. (1996). Parallel Processing of Spatial Joins using R-Trees. In Proceedings of ICDE'96, New Orleans, Louisiana.","DOI":"10.1109\/ICDE.1996.492114"},{"key":"382055_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K. and Mehrotra, S. (1998). Dynamic Granular Locking Approach to Phantom Protection in R-Trees. In Proceedings of ICDE'98, Orlando, Florida, USA (pp. 446-454).","DOI":"10.1109\/ICDE.1998.655807"},{"key":"382055_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K. and Mehrotra, S. (1999a). Efficient Concurrency Control in Multidimensional Access Methods. In Proceedings of SIGMOD'99, Philadephia, Pennsylvania, USA (pp. 25-36).","DOI":"10.1145\/304182.304185"},{"key":"382055_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K. and Mehrotra, S. (1999b). The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces. In Proceedings of ICDE'99, Sydney, Australia.","DOI":"10.1109\/ICDE.1999.754960"},{"key":"382055_CR11","unstructured":"Oracle Corporation. (1999). Oracle Spatial (Data Sheet). http:\/\/www.oracle.com\/database\/ documents\/spatiald-pdf."},{"key":"382055_CR12","doi-asserted-by":"crossref","unstructured":"de la Briandais, R. (1959). File Searching using Variable Length Keys. In Proceedings of the Western Joint Computer Conference(pp. 295-298).","DOI":"10.1145\/1457838.1457895"},{"key":"382055_CR13","unstructured":"DeWitt, D.J., Kabra, N., Luo, J., Patel, J.M., and Yu, J.-B. (1994). Client-Server Paradise. In Proceedings of VLDB'94, Santiago, Chile (pp. 558-569)."},{"key":"382055_CR14","unstructured":"Diwan, A.A., Rane, S., Seshadri, S., and Sudarshan, S. (1996).Clustering Techniques for Minimizing External Path Length. In Proceedings of VLDB'96, Mumbai, India (pp. 342-353)."},{"key":"382055_CR15","unstructured":"Esperanca, C. and Samet, H. (1996). Spatial Database Programming using Sand. In Proceedings of the Seventh International Symposium on Spatial Data Handling."},{"key":"382055_CR16","doi-asserted-by":"crossref","unstructured":"Eswaran, K.P., Gray, J.N., Lorie, R.A., and Traiger, I.L. (1976). The Notions of Concurrency and Predicate Locks in a Data Base System. Communications of the ACM, 19(11).","DOI":"10.1145\/360363.360369"},{"key":"382055_CR17","unstructured":"Faloutsos, C. and Gaede, V. (1996). Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension. In Proceedings of VLDB'96(pp. 40-50)."},{"issue":"3","key":"382055_CR18","first-page":"373","volume":"9","author":"C. Faloutsos","year":"1997","unstructured":"Faloutsos, C., Jagadish, H.V., and Manolopoulos, Y. (1997). Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperectangles. TKDE, 9(3), 373-383.","journal-title":"TKDE"},{"issue":"1","key":"382055_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A. and Bentley, J.L. (1974). Quad Trees: A Data Structure for Retrieval on Composite Key. Acta Informatica, 4(1), 1-9.","journal-title":"Acta Informatica"},{"key":"382055_CR20","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E. (1960). Trie Memory. Communications of the ACM, 3, 490-500.","journal-title":"Communications of the ACM"},{"issue":"2","key":"382055_CR21","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V. and Gunther, O. (1998). Multidimensional Access Methods. ACM Computer Surveys, 30(2), 170-231.","journal-title":"ACM Computer Surveys"},{"issue":"12","key":"382055_CR22","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","volume":"25","author":"I. Gargantini","year":"1982","unstructured":"Gargantini, I. (1982). An Effective Way to Represent Quadtrees. Communications ACM, 25(12), 905-910.","journal-title":"Communications ACM"},{"key":"382055_CR23","volume-title":"LNCS, 'Operating Systems, an Advanced Course'","author":"J.N. Gray","year":"1978","unstructured":"Gray, J.N. (1978). Notes on Data Base Operating Systems. In R. Bayer, R.M. Graham, and G. Seegm\u00fcller (Eds.), LNCS, 'Operating Systems, an Advanced Course', (Heidelberg, FRG and NewYork NY, USA: Springer Verlag, Vol. 60."},{"key":"382055_CR24","series-title":"Data Management Systems","volume-title":"Transaction Processing: Concepts and Techniques","author":"J.N. Gray","year":"1993","unstructured":"Gray, J.N. and Reuter, A. (1993). Transaction Processing: Concepts and Techniques. Data Management Systems. San Mateo, CA: Morgan Kaufmann Publishers."},{"issue":"4","key":"382055_CR25","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01231602","volume":"3","author":"R.H. G\u00fcting","year":"1994","unstructured":"G\u00fcting, R.H. (1994). An Introduction to Spatial Database Systems. VLDB Journal, 3(4), 357-399.","journal-title":"VLDB Journal"},{"key":"382055_CR26","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984). R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of SIGMOD'84(pp. 47-57).","DOI":"10.1145\/602259.602266"},{"key":"382055_CR27","unstructured":"Hellerstein, J.M., Naughton, J.F., and Pfeffer, A. (1995). Generalized Search Trees for Database System. In Proceedings of VLDB'95."},{"key":"382055_CR28","unstructured":"Hellerstein, J.M. and Pfeffer, A. (1994). The RD-Tree: An Index Structure for Sets. Technical Report, University of Wisconsin Computer Science."},{"key":"382055_CR29","doi-asserted-by":"crossref","unstructured":"Kedem, G. (1982). The quad-CIF Tree: A Data Structure for Hierarchical on-line Algorithms. In ACM IEEE Nineteenth Design Automation Conference Proceedings, Los Alamitos, CA, USA (pp. 352-357).","DOI":"10.1109\/DAC.1982.1585523"},{"key":"382055_CR30","doi-asserted-by":"crossref","unstructured":"Klinger, A. (1971). Pattern and Search Statistics. In S. Rustagi (Ed.), Optimizing Methods in Statistics(pp. 303-337).","DOI":"10.1016\/B978-0-12-604550-5.50019-5"},{"key":"382055_CR31","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming, Vol. 3","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E. (1973). The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA: Addison-Wesley."},{"key":"382055_CR32","unstructured":"Kornacker,M. and Banks, D. (1995). High-Concurrency Locking in R-Trees. In Proceedings of VLDB'95, Zurich, Switzerland."},{"key":"382055_CR33","doi-asserted-by":"crossref","unstructured":"Kornacker, M., Mohan, C., and Hellerstein, J.M. (1998). Concurrency and Recovery in Generalized Search Trees. Proceedings of SIGMOD'98(pp. 62-72).","DOI":"10.1145\/253262.253272"},{"issue":"4","key":"382055_CR34","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"Lin, K.-I., Jagadish, H.V., and Faloutsos, C. (1994). The TV-Tree: An Index Structure for High-Dimensional Data. VLDB Journal, 3(4), 517-542.","journal-title":"VLDB Journal"},{"issue":"4","key":"382055_CR35","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R. (1968). PATRICIA-Practical Algorithm to Retrieve Coded in Alphanumeric. J. Assoc. Comput. Mach., 15(4), 514-534.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"382055_CR36","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/15886.15908","volume":"20","author":"R.C. Nelson","year":"1986","unstructured":"Nelson, R.C. and Samet, H. (1986). A Consistent Hierarchical Representation for Vector Data. Computer Graphics, 20(4), 197-206. SIGGRAPH '86 Proceedings.","journal-title":"Computer Graphics"},{"issue":"1","key":"382055_CR37","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., and Sevcik, K. (1984). The Grid File: An Adaptable Symmetric Multi-Key File Structure. ACM Transactions on Database Systems, 9(1), 38-71.","journal-title":"ACM Transactions on Database Systems"},{"issue":"4","key":"382055_CR38","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0020-0190(82)90027-8","volume":"14","author":"J.A. Orenstein","year":"1982","unstructured":"Orenstein, J.A. (1982). Multidimensional Tries used for Associative Searching. Information Processing Letters, 14(4), 150-157.","journal-title":"Information Processing Letters"},{"issue":"5","key":"382055_CR39","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/32.6139","volume":"14","author":"J.A. Orenstein","year":"1988","unstructured":"Orenstein, J.A. and Manola, F. (1988). PROBE Spatial Data Modeling and Query Processing in an Image Database Application. IEEE Transactions on Software Engineering, 14(5), 611-629.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"382055_CR40","unstructured":"Papadias, D., Mamoulis, N., and Delis, V. (1998). Algorithms for Querying by Spatial Structure. In Proceedings of VLDB'98, New York City, New York, USA (pp. 546-557)."},{"key":"382055_CR41","volume-title":"Applications of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet, H. (1990a). Applications of Spatial Data Structures. Reading, MA: Addison-Wesley."},{"key":"382055_CR42","volume-title":"The Design and Analysis of Spatial Data Structure","author":"H. Samet","year":"1990","unstructured":"Samet, H. (1990b). The Design and Analysis of Spatial Data Structure. Reading, MA: Addison-Wesley."},{"issue":"3","key":"382055_CR43","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/282957.282966","volume":"4","author":"H. Samet","year":"1985","unstructured":"Samet, H. and Webber, R.E. (1985). Storing a Collection of Polygons using Quadtrees. ACM Transactions on Graphics4(3), 182-222.","journal-title":"ACM Transactions on Graphics"},{"key":"382055_CR44","unstructured":"Seeger, B. and Kriegel, H.-P. (1990). The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. In Proceedings of VLDB'90, Queensland, Australia."},{"key":"382055_CR45","unstructured":"Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987). The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In Proceedings of VLDB'87, Brighton, UK."},{"key":"382055_CR46","unstructured":"Sellis, T.K., Roussopoulos, N., and Faloutsos, C. (1997). Multidimensional Access Methods: Trees Have Grown Everywhere. In Proceedings of VLDB'97(pp. 13-14)."},{"key":"382055_CR47","doi-asserted-by":"crossref","unstructured":"Szalay, A., Kunszt, P., Thakar, A., Gray, J., Slutz, D., and Brunner, R. (2000). Designing and Mining Multi-terabyte Astronomy Archives: The Sloan Digital Sky Survey. In Proceedings of SIGMOD'00, Dallas TX (pp. 451-462).","DOI":"10.1145\/342009.335439"},{"issue":"2","key":"382055_CR48","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0146-664X(75)80003-7","volume":"4","author":"S. Tanimoto","year":"1975","unstructured":"Tanimoto, S. and Pavlidis, T. (1975). A Hierarchical Data Structure for Picture Processing. Computer Graphics and Image Processing, 4(2), 104-119.","journal-title":"Computer Graphics and Image Processing"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012809914301.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012809914301\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012809914301.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:25:31Z","timestamp":1749219931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012809914301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":48,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["382055"],"URL":"https:\/\/doi.org\/10.1023\/a:1012809914301","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}