{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:49:36Z","timestamp":1745038176753,"version":"3.32.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10619-004-0234-6","type":"journal-article","created":{"date-parts":[[2005,2,28]],"date-time":"2005-02-28T19:54:18Z","timestamp":1109620458000},"page":"111-133","source":"Crossref","is-referenced-by-count":12,"title":["The PN-Tree: A Parallel and Distributed Multidimensional Index"],"prefix":"10.1007","volume":"17","author":[{"given":"M.H.","family":"Ali","sequence":"first","affiliation":[]},{"given":"A.A.","family":"Saad","sequence":"additional","affiliation":[]},{"given":"M.A.","family":"Ismail","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1012809914301","volume":"17","author":"W. Aref","year":"2001","unstructured":"W. Aref and I. Ilyas, ?SP-GiST: An extensible database index for supporting space partitioning trees,? Journal of Intelligent Information Systems (JIIS), vol. 17, pp. 215?240, 2001.","journal-title":"Journal of Intelligent Information Systems (JIIS)"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"R. Bayer, ?The universal B-Tree for multidimensional Indexing: General Concepts,? in World Wide Computing and its Applications (WWCA, 97), 1997, pp. 198?209.","DOI":"10.1007\/3-540-63343-X_48"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, ?The R*-tree: An efficient and robust access method for points and rectangles,? in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1990, pp. 322?331.","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"J.L. Bentley, ?Multidimensional binary search trees used for associative searching,? Communications of the ACM (CACM), vol. 18, no. 9, pp. 509?517, 1975.","journal-title":"Communications of the ACM (CACM)"},{"key":"CR5","unstructured":"S. Berchtold, D.A. Keim, and H.P. Kriegel, ?The X-tree: An index structure for high-dimensional data,? in Proceedings of the International Conference on Very Large Databases (VLDB), 1996, pp. 28?39."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"K. Chakrabarti and S. Mehrotra, ?High dimensional feature indexing using hybrid trees,? in Proceedings of the International Conference on Data Engineering (ICDE), 1999, pp. 440?447.","DOI":"10.1109\/ICDE.1999.754960"},{"issue":"3","key":"CR7","first-page":"28","volume":"16","author":"C. Faloutsos","year":"1993","unstructured":"C. Faloutsos and I. Kamel, ?High performance R-trees,? IEEE Data Eng. Bull, vol. 16, no. 3, pp. 28?33, 1993.","journal-title":"IEEE Data Eng. Bull"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"M. Freeston, ?The BANG file: A new kind of grid file,? in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1987, pp. 260?269.","DOI":"10.1145\/38713.38743"},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. G\u00fcnther, ?Multidimensional access methods,? ACM Computing Surveys, vol. 30, no. 2, pp. 170?231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"A. Guttman, ?R-Trees: A dynamic index structure for spatial searching,? in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1984, pp. 47?57.","DOI":"10.1145\/602259.602266"},{"key":"CR11","unstructured":"A. Henrich, H.W. Six, and P. Widmayer, ?The LSD tree: Spatial access to multidimensional point and nonpoint objects,? in Proceedings of the International Conference on Very Large Databases (VLDB), 1989, pp. 45?53."},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01936137","volume":"25","author":"K. Hinrichs","year":"1985","unstructured":"K. Hinrichs, ?Implementation of the grid file: Design concepts and experience,? BIT Journal, vol. 25, no. 4, pp. 569?592, 1985.","journal-title":"BIT Journal"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.W. Six, and P. Widmayer, ?Twin grid files: Space optimizing access schemes,? In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1988, pp. 183?190.","DOI":"10.1145\/50202.50222"},{"key":"CR14","unstructured":"H.V. Jagadish, ?On indexing line segments,? in Proceedings of the International Conference on Very Large Databases (VLDB), 1990, pp. 614?625."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos, ?Parallel R-trees,? in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1992, pp. 195?204.","DOI":"10.1145\/130283.130315"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"N. Katayama and S. Satoh, ?The SR-tree: An index structure for high-dimensional nearest neighbor queries,? in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1997, pp. 369?380.","DOI":"10.1145\/253260.253347"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/B978-0-12-604550-5.50019-5","volume-title":"Optimizing Methods in Statistics","author":"A. Klinger","year":"1971","unstructured":"A. Klinger, ?Patterns and search statistics,? in Optimizing Methods in Statistics, J.S. Rustagi (Ed.), Academic Press: NY, 1971, pp. 303?337."},{"issue":"4","key":"CR18","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.I. Lin","year":"1994","unstructured":"K.I. Lin, H.V. Jagadish, and C. Faloutsos, ?The TV-tree: An index structure for high-dimensional data,? VLDB Journal, vol. 3, no. 4, pp. 517?542 1994.","journal-title":"VLDB Journal"},{"issue":"4","key":"CR19","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"D.B. Lomet","year":"1990","unstructured":"D.B. Lomet and B. Salzberg, ?The hB-tree: A multiattribute indexing method with good guaranteed performance,? ACM Transaction on Database System (TODS), vol. 15, no. 4, pp. 625?658, 1990.","journal-title":"ACM Transaction on Database System (TODS)"},{"issue":"1","key":"CR20","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K. Sevick, ?The grid file: An adaptable, symmetric multikey file structure,? ACM Transactions On Database Systems (TODS), vol. 9, no. 1, pp. 38?71, 1984.","journal-title":"ACM Transactions On Database Systems (TODS)"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"J.T. Robinson, ?The K-D-B-tree: A search structure for large multidimensional dynamic indexes,? in Proceedings of the SIGMOD International Conference on Management of Data, 1981, pp. 10?18.","DOI":"10.1145\/582318.582321"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelly, and F. Vincent, ?Nearest neighbor queries,? in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1995, pp. 71?79.","DOI":"10.1145\/223784.223794"},{"key":"CR23","unstructured":"H. Samet, ?Spatial data structures,? Modern Database Systems: The Object Model, Interoperability, and Beyond, Addison Wesley\/ACM Press, 1995, pp. 361?385."},{"key":"CR24","unstructured":"B. Seeger and H.P. Kriegel, ?The buddy tree: an efficient and robust access method for spatial database systems,? in Proceedings of the International Conference on Very Large Databases (VLDB), 1990, pp. 590?601."},{"key":"CR25","unstructured":"T.K. Sellis, N. Roussopoulos, and C. Faloutsos, ?Multidimensional access methods: Trees have grown everywhere,? in Proceedings of the International Conference on Very Large Databases (VLDB), 1997, pp. 13?14."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"H.W. Six and P. Widmayer, ?Spatial searching in geometric databases,? in Proceedings of the International Conference on Data Engineering (ICDE), 1988, pp. 496?503.","DOI":"10.1109\/ICDE.1988.105496"},{"issue":"1","key":"CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01934393","volume":"22","author":"M. Tamminen","year":"1982","unstructured":"M. Tamminen, ?The extendible cell method for closest point problems,? BIT Journal, vol. 22, no. 1, pp. 27?41, 1982.","journal-title":"BIT Journal"},{"key":"CR28","unstructured":"R. Weber, H.J. Schek and S. Blott, ?A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces,? in Proceedings of the International Conference on Very Large Databases (VLDB), 1998, pp. 194?205."},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"D. White and R. Jain, ?Similarity indexing with the SS-tree,? in Proceedings of International Conference on Data Engineering (ICDE), 1996, pp. 516?523.","DOI":"10.1109\/ICDE.1996.492202"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-004-0234-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-004-0234-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-004-0234-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T04:47:24Z","timestamp":1735102044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-004-0234-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["NO00000234"],"URL":"https:\/\/doi.org\/10.1007\/s10619-004-0234-6","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}