{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:17Z","timestamp":1740122177245,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (A)(JP16H01722)"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (A)(JP16H01722)"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (S)17H06099"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (S)17H06099"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["Grant-in-Aid for Young Scientists (B)(JP15K21069)"],"award-info":[{"award-number":["Grant-in-Aid for Young Scientists (B)(JP15K21069)"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (A)(JP16H01722)"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (A)(JP16H01722)"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10707-019-00363-0","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:48:12Z","timestamp":1557809292000},"page":"591-620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient framework for processing top-k queries with replication in mobile ad hoc networks"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8548-3181","authenticated-orcid":false,"given":"Yuya","family":"Sasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Hara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Ishikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"363_CR1","doi-asserted-by":"crossref","unstructured":"Amagata D, Sasaki Y, Hara T, Nishio S (2013) A robust routing method for top-k queries in mobile ad hoc networks. In: MDM, pp 251\u2013256","DOI":"10.1109\/MDM.2013.35"},{"key":"363_CR2","unstructured":"B\u00f6rzs\u00f6ny S, Kossmann D, Stocker K (2001) The skyline operator. In: ICDE, pp 421\u2013430"},{"key":"363_CR3","doi-asserted-by":"crossref","unstructured":"Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In: SIGCOMM, pp 177\u2013190","DOI":"10.1145\/964725.633043"},{"issue":"9","key":"363_CR4","first-page":"4539","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis AG, Godfrey PB, Wu Y, Wainwright MJ, Ramchandran K (2010) Network coding for distributed storage systems. IEEE TIT 56(9):4539\u20134551","journal-title":"IEEE TIT"},{"issue":"5","key":"363_CR5","first-page":"2194","volume":"60","author":"M Fiore","year":"2011","unstructured":"Fiore M, Casetti C, Chiasserini C (2011) Caching strategies based on information density estimation in wireless ad hoc networks. IEEE TVT 60(5):2194\u20132208","journal-title":"IEEE TVT"},{"key":"363_CR6","doi-asserted-by":"crossref","unstructured":"Hagihara R, Shinohara M, Hara T, Nishio S (2009) A message processing method for top-k query for traffic reduction in ad hoc networks. In: MDM, pp 11\u201320","DOI":"10.1109\/MDM.2009.12"},{"key":"363_CR7","doi-asserted-by":"crossref","unstructured":"Hara T (2001) Effective replica allocation in ad hoc networks for improving data accessibility. In: INFOCOM, pp 1568\u20131576","DOI":"10.1109\/INFCOM.2001.916653"},{"key":"363_CR8","doi-asserted-by":"crossref","unstructured":"Hara T, Hagihara R, Nishio S (2010) Data replication for top-k query processing in mobile wireless sensor networks. In: SUTC, pp 115\u2013122","DOI":"10.1109\/SUTC.2010.25"},{"issue":"4","key":"363_CR9","first-page":"11","volume":"40","author":"I Ilyas","year":"2008","unstructured":"Ilyas I, Beskales G, Soliman M (2008) A survey of top-k query processing techniques in relational database systems. ACM CSUR 40(4):11","journal-title":"ACM CSUR"},{"issue":"9","key":"363_CR10","first-page":"1668","volume":"23","author":"H Jiang","year":"2012","unstructured":"Jiang H, Cheng J, Wang D, Wang C, Tan G (2012) A general framework for efficient continuous multidimensional top-k query processing in sensor networks. IEEE TPDS 23(9):1668\u20131680","journal-title":"IEEE TPDS"},{"key":"363_CR11","unstructured":"Kong J, Lu S, Zhang L, Zerfos P, Luo H (2001) Providing robust and ubiquitous security support for mobile ad hoc networks. In: ICNP, IEEE Computer Society, pp 0251\u20130251"},{"key":"363_CR12","unstructured":"Lee S, Wong S, Lee K (2011) S. Lu. Content management in a mobile ad hoc network Beyond opportunistic strategy. In: INFOCOM, pp 266\u2013270"},{"key":"363_CR13","doi-asserted-by":"crossref","unstructured":"Lu Z, Sun X, La Porta T (2016) Cooperative data offloading in opportunistic mobile networks. In: INFOCOM, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524494"},{"key":"363_CR14","unstructured":"Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In: Supercomputing, pp 84\u201395"},{"key":"363_CR15","doi-asserted-by":"crossref","unstructured":"Ni S, Tseng Y, Chen Y, Sheu J (1999) The broadcast storm problem in a mobile ad hoc network. In: Mobicom, pp 151\u2013162","DOI":"10.1145\/313451.313525"},{"key":"363_CR16","doi-asserted-by":"crossref","unstructured":"Padhariya N, Mondal A, Goyal V, Shankar R, Madria S (2011) Ecotop: an economic model for dynamic processing of top-k queries in mobile-p2p networks. In: DASFAA, pp 251\u2013265","DOI":"10.1007\/978-3-642-20152-3_19"},{"issue":"5","key":"363_CR17","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/s00778-007-0055-0","volume":"17","author":"P Padmanabhan","year":"2008","unstructured":"Padmanabhan P, Gruenwald L, Vallur A, Atiquzzaman M (2008) A survey of data replication techniques for mobile ad hoc network databases. VLDB J 17 (5):1143\u20131164","journal-title":"VLDB J"},{"key":"363_CR18","unstructured":"Perkins CE, Royer EM (1999) Ad-hoc on-demand distance vector routing. In: Mobile Computing Systems and Applications (WMCSA), IEEE, pp 90\u2013100"},{"key":"363_CR19","doi-asserted-by":"crossref","unstructured":"Ryeng N, Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K (2011) Efficient distributed top-k query processing with caching. In: DASFAA, pp 280\u2013295","DOI":"10.1007\/978-3-642-20152-3_21"},{"key":"363_CR20","doi-asserted-by":"crossref","unstructured":"Sasaki Y, Hagihara R, Hara T, Shinohara M, Nishio S (2010) A top-k query method by estimating score distribution in mobile ad hoc networks. In: Advanced Information Networking and Applications Workshops (WAINA), pp 944\u2013949","DOI":"10.1109\/WAINA.2010.162"},{"key":"363_CR21","doi-asserted-by":"crossref","unstructured":"Sasaki Y, Hara T, Ishikawa Y (2018) Top-k query processing with replication strategy in mobile ad hoc networks. In: MDM, pp 217\u2013226","DOI":"10.1109\/MDM.2018.00039"},{"key":"363_CR22","doi-asserted-by":"crossref","unstructured":"Sasaki Y, Hara T, Nishio S (2011) Two-phase top-k query processing in mobile ad hoc networks. In: Network-based Information Systems (NBiS), pp 42\u201349","DOI":"10.1109\/NBiS.2011.17"},{"key":"363_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jss.2013.10.043","volume":"92","author":"Y Sasaki","year":"2014","unstructured":"Sasaki Y, Hara T, Nishio S (2014) Top-k query processing for replicated data in mobile peer to peer networks. System and Software 92:45\u201358","journal-title":"System and Software"},{"issue":"3-4","key":"363_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10619-012-7094-2","volume":"30","author":"A Vlachou","year":"2012","unstructured":"Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K (2012) Distributed top-k query processing by exploiting skyline summaries. Distributed and Parallel Databases 30(3-4):239\u2013271","journal-title":"Distributed and Parallel Databases"},{"key":"363_CR25","doi-asserted-by":"crossref","unstructured":"Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K, Kotidis Y (2012) Peer-to-peer query processing over multidimensional data. Springer Science & Business Media","DOI":"10.1007\/978-1-4614-2110-8"},{"issue":"7","key":"363_CR26","first-page":"962","volume":"19","author":"M Wu","year":"2007","unstructured":"Wu M, Xu J, Tang X, Lee W-C (2007) Top-k monitoring in wireless sensor networks. IEEE TKDE 19(7):962\u2013976","journal-title":"IEEE TKDE"},{"key":"363_CR27","doi-asserted-by":"crossref","unstructured":"Zou L, Chen L (2008) Dominant graph: an efficient indexing structure to answer top-k queries. In: ICDE, pp 536\u2013545","DOI":"10.1109\/ICDE.2008.4497462"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-019-00363-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-019-00363-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-019-00363-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:52:51Z","timestamp":1589723571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-019-00363-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,14]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s10707-019-00363-0","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2019,5,14]]},"assertion":[{"value":"13 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}