{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T05:53:43Z","timestamp":1723010023711},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T00:00:00Z","timestamp":1537920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the 973 Program","award":["2015CB352500"],"award-info":[{"award-number":["2015CB352500"]}]},{"name":"the National Natural Science Foundation of China Grant","award":["61272092"],"award-info":[{"award-number":["61272092"]}]},{"name":"the Shandong Provincial Natural Science Foundation Grant","award":["ZR2012FZ004"],"award-info":[{"award-number":["ZR2012FZ004"]}]},{"name":"the Science and Technology Development Program of Shandong Province","award":["2014G","GE27178"],"award-info":[{"award-number":["2014G","GE27178"]}]},{"name":"the Taishan Scholars Program and NSERC Discovery Grants"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00500-018-3548-4","type":"journal-article","created":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T08:36:36Z","timestamp":1537950996000},"page":"5539-5550","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient index structure for distributed k-nearest neighbours query processing"],"prefix":"10.1007","volume":"24","author":[{"given":"Min","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"3548_CR1","doi-asserted-by":"crossref","unstructured":"Ab Malek MSB, Ahmadon MAB, Yamaguchi S, Gupta BB (2016) Implementation of parallel model checking for computer-based test security design. In: International conference on information and communication systems","DOI":"10.1109\/IACS.2016.7476121"},{"issue":"6191","key":"3548_CR2","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"R Alex","year":"2014","unstructured":"Alex R, Laio A (2014) Machine learning. Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"key":"3548_CR3","doi-asserted-by":"crossref","unstructured":"Bamba B, Liu Ling, Iyengar A, Yu PS (2009) Distributed processing of spatial alarms: a safe region-based approach. In: 29th IEEE international conference on distributed computing systems, 2009. ICDCS \u201909, pp 207\u2013214","DOI":"10.1109\/ICDCS.2009.25"},{"key":"3548_CR4","doi-asserted-by":"crossref","unstructured":"Cahsai A, Ntarmos N, Anagnostopoulos C, Triantafillou P (2017) Scaling \n$$k$$\n\n\n\nk\n\n\n\n-nearest neighbours queries (the right way). In: IEEE international conference on distributed computing systems, pp 1419\u20131430","DOI":"10.1109\/ICDCS.2017.267"},{"key":"3548_CR5","unstructured":"Chaudhuri S, Gravano L (1999) Evaluating top-k selection queries. In: VLDB, vol 99, pp 397\u2013410"},{"issue":"12","key":"3548_CR6","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.14778\/2536274.2536283","volume":"6","author":"A Eldawy","year":"2013","unstructured":"Eldawy A, Mokbel MF (2013) A demonstration of SpatialHadoop: an efficient mapreduce framework for spatial data. Proc VLDB Endow 6(12):1230\u20131233","journal-title":"Proc VLDB Endow"},{"key":"3548_CR7","doi-asserted-by":"crossref","unstructured":"Gedik B, Liu L (2004) Mobieyes: distributed processing of continuously moving queries on moving objects in a mobile system. In: EDBT, pp 523\u2013524","DOI":"10.1007\/978-3-540-24741-8_6"},{"issue":"2","key":"3548_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst: TODS 24(2):265\u2013318","journal-title":"ACM Trans Database Syst: TODS"},{"issue":"10","key":"3548_CR9","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 BC (2012) Efficient processing of \n$$k$$\n\n\n\nk\n\n\n\n nearest neighbor joins using MapReduce. Proc VLDB Endow 5(10):1016\u20131027","journal-title":"Proc VLDB Endow"},{"key":"3548_CR10","unstructured":"Plageras AP, Stergiou C, Kokkonis G, Psannis KE, Ishibashi Y, Kim BG, Gupta BB (2017) Efficient large-scale medical data (eHealth Big Data) analytics in internet of things. In: Business informatics, pp 21\u201327"},{"issue":"2","key":"3548_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1023403908170","volume":"7","author":"K Raptopoulou","year":"2003","unstructured":"Raptopoulou K, Papadopoulos A, Manolopoulos Y (2003) Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2):113\u2013137","journal-title":"GeoInformatica"},{"key":"3548_CR12","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: ACM sigmod record, vol\u00a024. ACM, pp 71\u201379","DOI":"10.1145\/568271.223794"},{"key":"3548_CR13","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel H-P (1998) Optimal multi-step \n$$k$$\n\n\n\nk\n\n\n\n-nearest neighbor search. In: ACM SIGMOD record, vol\u00a027. ACM, pp 154\u2013165","DOI":"10.1145\/276305.276319"},{"key":"3548_CR14","doi-asserted-by":"crossref","unstructured":"\u0160idlauskas D, \u0160altenis S, Jensen CS (2012) Parallel main-memory indexing for moving-object query and update workloads. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data. ACM, pp 37\u201348","DOI":"10.1145\/2213836.2213842"},{"key":"3548_CR15","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) \n$$K$$\n\n\n\nK\n\n\n\n-nearest neighbor search for moving query point. In: Advances in spatial and temporal databases. Springer, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"3548_CR16","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of the 28th international conference on very large data bases. VLDB Endowment, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"issue":"3","key":"3548_CR17","first-page":"150","volume":"04","author":"S Tripathi","year":"2013","unstructured":"Tripathi S, Gupta B, Almomani A, Mishra A, Veluru S (2013) Hadoop based defense solution to handle distributed denial of service (DDoS) attacks. J Inf Secur 04(3):150\u2013164","journal-title":"J Inf Secur"},{"key":"3548_CR18","first-page":"655","volume-title":"Distributed continuous range query processing on moving objects. Database and expert systems applications","author":"H Wang","year":"2006","unstructured":"Wang H, Zimmermann R, Ku WS (2006) Distributed continuous range query processing on moving objects. Database and expert systems applications. Springer, Berlin, pp 655\u2013665"},{"key":"3548_CR19","doi-asserted-by":"crossref","unstructured":"Wu W, Guo W, Tan K L (2007) Distributed processing of moving \n$$k$$\n\n\n\nk\n\n\n\n-nearest-neighbor query on moving objects. In: 2014 IEEE 30th international conference on data engineering. IEEE, pp 1116\u20131125","DOI":"10.1109\/ICDE.2007.368970"},{"issue":"3","key":"3548_CR20","doi-asserted-by":"publisher","first-page":"039101","DOI":"10.1007\/s11432-017-9090-6","volume":"61","author":"H Wu","year":"2018","unstructured":"Wu H, Wang L, Jiang T (2018) Secure and efficient \n$$k$$\n\n\n\nk\n\n\n\n-nearest neighbor query for location-based services in outsourced environments. Sci China (Inf Sci) 61(3):039101","journal-title":"Sci China (Inf Sci)"},{"key":"3548_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14257\/ijdta.2017.10.4.01","volume":"10","author":"Y Xia","year":"2017","unstructured":"Xia Y, Wang R, Zhang X, Bae H-Y (2017) Grid-based \n$$k$$\n\n\n\nk\n\n\n\n-nearest neighbor queries over moving object trajectories with MapReduce. Int J Database Theory Appl 10:1\u201312","journal-title":"Int J Database Theory Appl"},{"key":"3548_CR22","unstructured":"Yu C, Ooi BC, Tan K-L, Jagadish H (2001) Indexing the distance: an efficient method to knn processing. In: VLDB, vol 1, pp 421\u2013430"},{"key":"3548_CR23","unstructured":"Yu X, Pu KQ, Koudas N (2005) Monitoring \n$$k$$\n\n\n\nk\n\n\n\n-nearest neighbor queries over moving objects. In: 21st international conference on data engineering, 2005. ICDE 2005. Proceedings. IEEE, pp 631\u2013642"},{"issue":"5","key":"3548_CR24","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1109\/TKDE.2014.2364046","volume":"27","author":"Z Yu","year":"2015","unstructured":"Yu Z, Liu Y, Yu X, Pu KQ (2015) Scalable distributed processing of \n$$k$$\n\n\n\nk\n\n\n\n nearest neighbor queries over moving objects. IEEE Trans Knowl Data Eng 27(5):1383\u20131396","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3548_CR25","doi-asserted-by":"crossref","unstructured":"Zhang C, Li F, Jestes J (2012) Efficient parallel kNN joins for large data in MapReduce. In: International Conference on Extending Database Technology, pp 38-49","DOI":"10.1145\/2247596.2247602"},{"issue":"1","key":"3548_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00778-004-0146-0","volume":"15","author":"B Zheng","year":"2006","unstructured":"Zheng B, Xu J, Lee W-C, Lee L (2006) Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. VLDB J 15(1):21\u201339","journal-title":"VLDB J"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3548-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3548-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3548-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T01:18:04Z","timestamp":1585012684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3548-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,26]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["3548"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3548-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,26]]},"assertion":[{"value":"26 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}