{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:54:06Z","timestamp":1725846846476},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662492130"},{"type":"electronic","value":"9783662492147"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49214-7_5","type":"book-chapter","created":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T06:43:34Z","timestamp":1452062614000},"page":"139-168","source":"Crossref","is-referenced-by-count":5,"title":["kdANN+: A Rapid AkNN Classifier for Big Data"],"prefix":"10.1007","author":[{"given":"Nikolaos","family":"Nodarakis","sequence":"first","affiliation":[]},{"given":"Evaggelia","family":"Pitoura","sequence":"additional","affiliation":[]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Tsoumakos","sequence":"additional","affiliation":[]},{"given":"Giannis","family":"Tzimas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.14778\/2536222.2536227","volume":"6","author":"A Aji","year":"2013","unstructured":"Aji, A., Wang, F., Vo, H., Lee, R., Liu, Q., Zhang, X., Saltz, J.: Hadoop GIS: a high performance spatial data warehousing system over MapReduce. Proc. VLDB Endow. 6, 1009\u20131020 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing joins in a map-reduce environment. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 99\u2013110. ACM, New York (2010)","DOI":"10.1145\/1739041.1739056"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Krebs, F.: The k-nearest neighbour join: turbo charging the KDD process. Knowl. Inf. Syst. 6, 728\u2013749 (2004)","journal-title":"Knowl. Inf. Syst."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Chatzimilioudis, G., Zeinalipour-Yazti, D., Lee, W.-C., Dikaiakos, M. D.: Continuous all k-nearest-neighbor querying in smartphone networks. In: Proceedings of the 2012 IEEE 13th International Conference on Mobile Data Management, pp. 79\u201388. IEEE Computer Society, Washington, DC (2012)","DOI":"10.1109\/MDM.2012.19"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Chang, J., Luo, J., Huang, J.Z., Feng, S., Fan, J.: Minimum spanning tree based classification model for massive data with mapreduce implementation. In: Proceedings of the 10th IEEE International Conference on Data Mining Workshop, pp. 129\u2013137. IEEE Computer Society, Washington, DC (2010)","DOI":"10.1109\/ICDMW.2010.14"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.M.: Efficient evaluation of all-nearest-neighbor queries. In: Proceedings of the 23rd IEEE International Conference on Data Engineering, pp. 1056\u20131065. IEEE Computer Society, Washington, DC (2007)","DOI":"10.1109\/ICDE.2007.368964"},{"key":"5_CR7","volume-title":"Regular Polytopes","author":"HSM Coxeter","year":"1973","unstructured":"Coxeter, H.S.M.: Regular Polytopes. Dover Publications, New York (1973)"},{"key":"5_CR8","volume-title":"Polyhedra","author":"PR Cromwell","year":"1999","unstructured":"Cromwell, P.R.: Polyhedra. Cambridge University Press, Cambridge (1999)"},{"key":"5_CR9","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating Systems Design and Implementation, pp. 137\u2013150. USENIX Association, Berkeley (2004)"},{"key":"5_CR10","volume-title":"Data Mining: Introductory and Advanced Topics","author":"MH Dunham","year":"2002","unstructured":"Dunham, M.H.: Data Mining: Introductory and Advanced Topics. Prentice Hall, Upper Saddle River (2002)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Eldawy, A.: SpatialHadoop: towards flexible and scalable spatial processing using mapreduce. In: Proceedings of the 2014 SIGMOD Ph.D. Symposium, pp. 46\u201350. ACM, New York (2014)","DOI":"10.1145\/2602622.2602625"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-13818-8_35","volume-title":"Scientific and Statistical Database Management","author":"T Emrich","year":"2010","unstructured":"Emrich, T., Graf, F., Kriegel, H.-P., Schubert, M., Thoma, M.: Optimizing all-nearest-neighbor queries with trigonometric pruning. In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol. 6187, pp. 501\u2013518. Springer, Heidelberg (2010)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.datak.2008.11.003","volume":"68","author":"A Gkoulalas-Divanis","year":"2009","unstructured":"Gkoulalas-Divanis, A., Verykios, V.S., Bozanis, P.: A network aware privacy model for online requests in trajectory data. Data Knowl. Eng. 68, 431\u2013452 (2009)","journal-title":"Data Knowl. Eng."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-642-16248-0_89","volume-title":"Rough Set and Knowledge Technology","author":"Q He","year":"2010","unstructured":"He, Q., Zhuang, F., Li, J., Shi, Z.: Parallel implementation of classification algorithms based on mapreduce. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds.) RSKT 2010. LNCS, vol. 6401, pp. 655\u2013662. Springer, Heidelberg (2010)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Ioup, E., Shaw, K., Sample, J., Abdelguerfi, M.: Efficient AKNN spatial network queries using the m-tree. In: Proceedings of the 15th Annual ACM International Symposium on Advances in Geographic Information Systems, pp. 46:1\u201346:4. ACM, New York (2007)","DOI":"10.1145\/1341012.1341070"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Lee, K., Ganti, R.K., Srivatsa, M., Liu, L.: Efficient spatial query processing for big data. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 469\u2013472. ACM, New York (2014)","DOI":"10.1145\/2666310.2666481"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.14778\/2336664.2336674","volume":"5","author":"W Lu","year":"2012","unstructured":"Lu, W., Shen, Y., Chen, S., Ooi, B.C.: Efficient processing of k nearest neighbor joins using mapreduce. Proc. VLDB Endow. 5, 1016\u20131027 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2011","unstructured":"Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, New York (2011)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 71\u201379. ACM, New York (1995)","DOI":"10.1145\/568271.223794"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACM Comput. Surv. 16, 187\u2013260 (1984)","journal-title":"ACM Comput. Surv."},{"key":"5_CR21","unstructured":"Stupar, A., Michel, S., Schenkel, R.: RankReduce - processing k-nearest neighbor queries on top of MapReduce. In: Proceedings of the 8th Workshop on Large-Scale Distributed Systems for Information Retrieval, pp. 13\u201318 (2010)"},{"key":"5_CR22","unstructured":"The apache software foundation: Hadoop homepage. \n                    http:\/\/hadoop.apache.org\/"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Tsoumakos, D., Konstantinou, I., Boumpouka, C., Sioutas, S., Koziris, N.: Automated, elastic resource provisioning for nosql clusters using tiramola. In: Proceedings of the 13th IEEE\/ACM International Symposium on Cluster, Cloud, and Grid Computing, pp. 34\u201341 (2013)","DOI":"10.1109\/CCGrid.2013.45"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 495\u2013506. ACM, New York (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"5_CR25","unstructured":"White, T.: Hadoop: The Definitive Guide, 3rd edn. O\u2019Reilly Media\/Yahoo Press (2012)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Chin, B., Hu, O.J.: Gorder: An efficient method for KNN join processing. In: VLDB, pp. 756\u2013767. VLDB Endowment (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Yao, B., Li, F., Kumar, P.: K nearest neighbor queries and KNN-joins in large relational databases (almost) for free. In: Proceedings of the 26th International Conference on Data Engineering, pp. 4\u201315. IEEE Computer Society, Washington, DC (2010)","DOI":"10.1109\/ICDE.2010.5447837"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-32281-5_34","volume-title":"Web-Age Information Management","author":"T Yokoyama","year":"2012","unstructured":"Yokoyama, T., Ishikawa, Y., Suzuki, Y.: Processing all k-nearest neighbor queries in hadoop. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol. 7418, pp. 346\u2013351. Springer, Heidelberg (2012)"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"C Yu","year":"2007","unstructured":"Yu, C., Cui, B., Wang, S., Su, J.: Efficient index-based KNN join processing for high-dimensional data. Inf. Softw. Technol. 49, 332\u2013344 (2007)","journal-title":"Inf. Softw. Technol."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, C., Li, F., Jestes, J.: Efficient parallel kNN joins for large data in MapReduce. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 38\u201349. ACM, New York (2012)","DOI":"10.1145\/2247596.2247602"},{"key":"5_CR31","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management, pp. 297\u2013306. IEEE Computer Society, Washington, DC (2004)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49214-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:41:24Z","timestamp":1559364084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49214-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662492130","9783662492147"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49214-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}