{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:47:38Z","timestamp":1770490058174,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s41060-020-00208-2","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T09:03:00Z","timestamp":1585904580000},"page":"25-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Grid-R-tree: a data structure for efficient neighborhood and nearest neighbor queries in data mining"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1556-9905","authenticated-orcid":false,"given":"Poonam","family":"Goyal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-0087","authenticated-orcid":false,"given":"Jagat Sesh","family":"Challa","sequence":"additional","affiliation":[]},{"given":"Dhruv","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Anuvind","family":"Bhat","sequence":"additional","affiliation":[]},{"given":"Sundar","family":"Balasubramaniam","sequence":"additional","affiliation":[]},{"given":"Navneet","family":"Goyal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"key":"208_CR1","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2005)","edition":"1"},{"key":"208_CR2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s41060-019-00188-y","volume":"9","author":"P Goyal","year":"2020","unstructured":"Goyal, P., Kumari, S., Sharma, S., et al.: Parallel SLINK for big data. Int J Data Sci Anal 9, 339\u2013359 (2020)","journal-title":"Int J Data Sci Anal"},{"issue":"3","key":"208_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s41060-017-0067-9","volume":"4","author":"PK Sharma","year":"2017","unstructured":"Sharma, P.K., Holness, G.: Erratum to: L2-norm transformation for improving k-means clustering. Int. J. Data Sci. Anal. 4(3), 233\u2013234 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"4","key":"208_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s41060-018-0147-5","volume":"8","author":"N Albarakati","year":"2019","unstructured":"Albarakati, N., Obradovic, Z.: Multi-domain and multi-view networks model for clustering hospital admissions from the emergency department. Int. J. Data Sci. Anal. 8(4), 385\u2013403 (2019)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"1","key":"208_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"208_CR6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s41060-017-0064-z","volume":"4","author":"DC Anastasiu","year":"2017","unstructured":"Anastasiu, D.C., Karypis, G.: Efficient identification of tanimoto nearest neighbors. Int. J. Data Sci. Anal. 4(3), 153\u2013172 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"key":"208_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, AAAI Press, KDD\u201996, pp. 226\u2013231 (1996)"},{"issue":"2","key":"208_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. SIGMOD Rec. 28(2), 49\u201360 (1999)","journal-title":"SIGMOD Rec."},{"key":"208_CR9","doi-asserted-by":"crossref","unstructured":"Goyal, P., Kumari, S., Kumar, D., Balasubramaniam, S., Goyal, N., Islam, S., Challa, J.S.: Parallelizing optics for commodity clusters. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking, ACM, New York, NY, USA, ICDCN \u201915, pp. 1\u201310 (2015)","DOI":"10.1145\/2684464.2684477"},{"issue":"2","key":"208_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14(2), 47\u201357 (1984)","journal-title":"SIGMOD Rec."},{"key":"208_CR11","volume-title":"R-Trees: Theory and Applications","author":"Y Manolopoulos","year":"2005","unstructured":"Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, Berlin (2005)"},{"issue":"9","key":"208_CR12","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"208_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Inf. 4(1), 1\u20139 (1974)","journal-title":"Acta Inf."},{"issue":"1","key":"208_CR14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst."},{"key":"208_CR15","volume-title":"Database Systems: The Complete Book","author":"H Garcia-Molina","year":"2008","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book, 2nd edn. Prentice Hall Press, Upper Saddle River (2008)","edition":"2"},{"key":"208_CR16","first-page":"133","volume-title":"Advances in Intelligent and Soft Computing","author":"Guobin Li","year":"2011","unstructured":"Li, G., Tang, J.: A new r-tree spatial index based on space grid coordinate division. In: Proceedings of the 2011 International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011), pp. 133\u2013140. Springer, Berlin(2012)"},{"key":"208_CR17","doi-asserted-by":"crossref","unstructured":"Schikuta, E.: Grid-clustering: an efficient hierarchical clustering method for very large data sets. In: Proceedings of the 13th International Conference on Pattern Recognition, IEEE Computer Society, Washington, DC, USA, ICPR \u201996, pp. 101\u2013105 (1996)","DOI":"10.1109\/ICPR.1996.546732"},{"key":"208_CR18","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BFb0052867","volume-title":"Advances in Intelligent Data Analysis Reasoning about Data","author":"Erich Schikuta","year":"1997","unstructured":"Schikuta, E., Erhart, M.: The bang-clustering system: Grid-based data analysis. In: Advances in Intelligent Data Analysis Reasoning about Data, pp 513\u2013524. Springer, Berlin (1997)"},{"key":"208_CR19","unstructured":"Wang, W., Yang, J., Muntz, R.R.: Sting: A statistical information grid approach to spatial data mining. In: Proceedings of the 23rd International Conference on Very Large Data Bases, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, VLDB \u201997, pp. 186\u2013195 (1997)"},{"key":"208_CR20","unstructured":"Liao, W.K., Ying, L., Choudhary, A.: A grid-based clustering algorithm using adaptive mesh refinement. In: Proceedings of the 7th Workshop on Mining Scientific and Engineering Data Sets (2004)"},{"key":"208_CR21","doi-asserted-by":"crossref","unstructured":"Wang, W., Guan, J., Li, W., Zhang, L.: GR-tree: An efficient index structure for GML. In: Proceedings of the 2014 22nd International Conference on Geoinformatics, pp. 1\u20136 (2014)","DOI":"10.1109\/GEOINFORMATICS.2014.6950837"},{"issue":"2","key":"208_CR22","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. (TODS) 24(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"208_CR23","unstructured":"Borah, B., Bhattacharyya, D.K.: An improved sampling-based DBSCAN for large spatial databases. In: Proceedings of 2004 International Conference on Intelligent Sensing and Information Processing, pp. 92\u201396 (2004)"},{"key":"208_CR24","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/11785231_73","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","author":"Cheng-Fa Tsai","year":"2006","unstructured":"Tsai, C.F., Liu, C.W.: Kidbscan: A new efficient data clustering algorithm. In: Proceedings of the 8th International Conference on Artificial Intelligence and Soft Computing, Springer-Verlag, Berlin, Heidelberg, ICAISC\u201906, pp. 702\u2013711 (2006)"},{"key":"208_CR25","doi-asserted-by":"crossref","unstructured":"Tsai, C.F., Sung, C.Y.: Dbscale: An efficient density-based clustering algorithm for data mining in large databases. In: 2010 Second Pacific-Asia Conference on Circuits, Communications and System, pp. 98\u2013101. IEEE (2010)","DOI":"10.1109\/PACCS.2010.5627040"},{"issue":"3","key":"208_CR26","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/38714.38758","volume":"16","author":"Christos Faloutsos","year":"1987","unstructured":"Faloutsos, C., Sellis, T., Roussopoulos, N.: Analysis of object oriented spatial access methods. In: Proceedings of the 1987 ACM SIGMOD International Conference on Management of Data, ACM, New York, NY, USA, SIGMOD \u201987, pp. 426\u2013439 (1987)","journal-title":"ACM SIGMOD Record"},{"key":"208_CR27","unstructured":"Vampir trace library (2013). https:\/\/tu-dresden.de\/zih\/forschung\/projekte\/vampirtrace. Accessed 1 June 2018"},{"key":"208_CR28","doi-asserted-by":"crossref","unstructured":"Kaul, M., Yang, B., Jensen, C.S.: Building accurate 3d spatial networks to enable next generation intelligent transportation systems. In: 2013 IEEE 14th International Conference on Mobile Data Management, IEEE, vol.\u00a01, pp. 137\u2013146 (2013)","DOI":"10.1109\/MDM.2013.24"},{"key":"208_CR29","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1038\/nature03597","volume":"435","author":"V Springel","year":"2005","unstructured":"Springel, V., White, S.D.M., Jenkins, A., Frenk, C.S., Yoshida, N., Gao, L., Navarro, J., Thacker, R., Croton, D., Helly, J., Peacock, J.A., Cole, S., Thomas, P., Couchman, H., Evrard, A., Colberg, J., Pearce, F.: Simulations of the formation, evolution and clustering of galaxies and quasars. Nature 435, 629\u2013636 (2005)","journal-title":"Nature"},{"key":"208_CR30","unstructured":"Suvn trace data (2012). http:\/\/wirelesslab.sjtu.edu.cn\/ Accessed 17 Sept 2015"},{"key":"208_CR31","unstructured":"Kdd cup 2004 bio dataset (2004). http:\/\/cs.joensuu.fi\/sipu\/datasets\/. Accessed 16 Oct 2015"},{"key":"208_CR32","unstructured":"Catlett, J.: Statlog (shuttle) data set (1993). https:\/\/archive.ics.uci.edu\/ml\/datasets\/Statlog+(Shuttle). Accessed 17 Sept 2015"},{"key":"208_CR33","unstructured":"Bhatt, R., Dhall, A.: Skin segmentation data set (2009). https:\/\/archive.ics.uci.edu\/ml\/datasets\/Skin +Segmentation. Accessed 17 Sept 2015"},{"key":"208_CR34","doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of Spring Joint Computer Conference 1967, ACM, New York, NY, USA, AFIPS \u201967 (Spring), pp. 483\u2013485 (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"208_CR35","doi-asserted-by":"crossref","unstructured":"Goyal, P., Kumari, S., Sharma, S., Kishore, V., Goyal, N., Balasubramaniam, S.S.: Spatial locality aware, fast, and scalable slink algorithm for commodity clusters. In: 2016 IEEE International Conference on Cluster Computing (CLUSTER), IEEE, pp. 158\u2013159 (2016a)","DOI":"10.1109\/CLUSTER.2016.84"},{"key":"208_CR36","doi-asserted-by":"crossref","unstructured":"Goyal, P., Kumari, S., Sharma, S., Kumar, D., Kishore, V., Balasubramaniam, S., Goyal, N.: A fast, scalable slink algorithm for commodity cluster computing exploiting spatial locality. In: 2016 IEEE 18th International Conference on High Performance Computing and Communications, IEEE, pp. 268\u2013275 (2016b)","DOI":"10.1109\/CLUSTER.2016.84"},{"key":"208_CR37","doi-asserted-by":"crossref","unstructured":"Kumari, S., Goyal, P., Sood, A., Kumar, D., Balasubramaniam, S., Goyal, N.: Exact, fast and scalable parallel dbscan for commodity platforms. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, ACM, New York, NY, USA, ICDCN \u201917, pp. 14:1\u201314:10 (2017)","DOI":"10.1145\/3007748.3007773"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-020-00208-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-020-00208-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-020-00208-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T23:24:17Z","timestamp":1617405857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-020-00208-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,3]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["208"],"URL":"https:\/\/doi.org\/10.1007\/s41060-020-00208-2","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,3]]},"assertion":[{"value":"24 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}