{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:26:49Z","timestamp":1779316009866,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502047"],"award-info":[{"award-number":["61502047"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1016\/j.ipl.2016.10.008","type":"journal-article","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T04:15:30Z","timestamp":1477973730000},"page":"83-90","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":27,"special_numbering":"C","title":["Group-based collective keyword querying in road networks"],"prefix":"10.1016","volume":"118","author":[{"given":"Sen","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ipl.2016.10.008_br0010","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/1097-0037(200010)36:3<147::AID-NET1>3.0.CO;2-M","article-title":"Minimum-diameter covering problems","volume":"36","author":"Arkin","year":"2000","journal-title":"Networks"},{"key":"10.1016\/j.ipl.2016.10.008_br0020","series-title":"SIGMOD","first-page":"373","article-title":"Collective spatial keyword querying","author":"Cao","year":"2011"},{"issue":"9","key":"10.1016\/j.ipl.2016.10.008_br0030","first-page":"733","article-title":"Retrieving regions of interest for user exploration","volume":"7","author":"Cao","year":"2014","journal-title":"VLDB J."},{"key":"10.1016\/j.ipl.2016.10.008_br0140","series-title":"WSDM","first-page":"401","article-title":"A sketch-based distance oracle for web-scale graphs","author":"Das Sarma","year":"2010"},{"key":"10.1016\/j.ipl.2016.10.008_br0040","series-title":"ICDE","first-page":"656","article-title":"Keyword search on spatial databases","author":"De Felipe","year":"2008"},{"issue":"2","key":"10.1016\/j.ipl.2016.10.008_br0050","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TKDE.2010.230","article-title":"On group nearest group query processing","volume":"24","author":"Deng","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ipl.2016.10.008_br0130","doi-asserted-by":"crossref","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: shortest path","author":"Floyd","year":"1962","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ipl.2016.10.008_br0060","series-title":"SIGMOD","article-title":"Efficient algorithms for answering the m-closest keywords query","author":"Guo","year":"2015"},{"key":"10.1016\/j.ipl.2016.10.008_br0070","series-title":"SIGMOD","first-page":"393","article-title":"Exact top-k nearest keyword search in large networks","author":"Jiang","year":"2015"},{"issue":"10","key":"10.1016\/j.ipl.2016.10.008_br0080","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/TKDE.2010.181","article-title":"Group enclosing queries","volume":"23","author":"Li","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ipl.2016.10.008_br0090","series-title":"SIGMOD","first-page":"689","article-title":"Collective spatial keyword queries: a distance owner-driven approach","author":"Long","year":"2013"},{"issue":"6","key":"10.1016\/j.ipl.2016.10.008_br0160","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/TKDE.2005.87","article-title":"Aggregate nearest neighbor queries in road networks","volume":"17","author":"Lung Yiu","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ipl.2016.10.008_br0100","series-title":"EDBT","first-page":"235","article-title":"Distributed spatial keyword querying on road networks","author":"Luo","year":"2014"},{"key":"10.1016\/j.ipl.2016.10.008_br0110","series-title":"ICDE","first-page":"301","article-title":"Group nearest neighbor queries","author":"Papadias","year":"2004"},{"issue":"10","key":"10.1016\/j.ipl.2016.10.008_br0120","first-page":"901","article-title":"Top-k nearest keyword search on large graphs","volume":"6","author":"Qiao","year":"2013","journal-title":"VLDB J."},{"key":"10.1016\/j.ipl.2016.10.008_br0150","author":"Su"},{"key":"10.1016\/j.ipl.2016.10.008_br0170","series-title":"EDBT","first-page":"367","article-title":"Diversified spatial keyword search on road networks","author":"Zhang","year":"2014"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020019016301491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020019016301491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T22:55:06Z","timestamp":1536274506000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019016301491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":17,"alternative-id":["S0020019016301491"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ipl.2016.10.008","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2017,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Group-based collective keyword querying in road networks","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ipl.2016.10.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}