{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:13:26Z","timestamp":1755792806073,"version":"3.44.0"},"reference-count":6,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498434","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T07:36:34Z","timestamp":1466840194000},"page":"1578-1579","source":"Crossref","is-referenced-by-count":3,"title":["Joint search by social and spatial proximity"],"prefix":"10.1109","author":[{"given":"Kyriakos","family":"Mouratidis","sequence":"first","affiliation":[{"name":"School of Information Systems, Singapore Management University, Singapore"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Hong Kong, China"}]},{"given":"Yu","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Hong Kong, China"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Hong Kong, China"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/1391729.1391730","article-title":"A survey of top-k query processing techniques in relational database systems","volume":"40","author":"ilyas","year":"2008","journal-title":"ACM Comput Surv"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871609"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213923"},{"key":"ref5","first-page":"156","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"SODA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2339838"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2016,5,16]]},"location":"Helsinki, Finland","end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498434.pdf?arnumber=7498434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T18:35:51Z","timestamp":1755196551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7498434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498434","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}