{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:09:16Z","timestamp":1758269356002,"version":"3.41.0"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T00:00:00Z","timestamp":1509667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61522208, 61379033 and 61472348"],"award-info":[{"award-number":["61522208, 61379033 and 61472348"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSFC-Zhejiang Joint","award":["U1609217"],"award-info":[{"award-number":["U1609217"]}]},{"name":"973 Program of China","award":["2015CB352502"],"award-info":[{"award-number":["2015CB352502"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2018,7,31]]},"abstract":"<jats:p>The spatial keyword query takes as inputs a query location and a set of query keywords and returns the answer objects by considering both their spatial distances to the query location and textual similarity with the query keywords. However, temporal information plays an important role in the spatial keyword query (where there is, to our knowledge, no prior work considering temporal information of the objects), since objects are not always valid. For instance, visitors may plan their trips according to the opening hours of attractions. Moreover, in real-life applications, objects are located on a predefined road network, and the spatial proximity of two objects is measured by the shortest path distance or travelling time between them. In this article, we study the problem of<jats:italic>time-aware spatial keyword<\/jats:italic>(TSK)<jats:italic>query<\/jats:italic>, which assumes that objects are located on the road network, and finds the<jats:italic>k<\/jats:italic>objects satisfying users\u2019 spatio-temporal description and textual constraint. We first present the pruning strategy and algorithm based on an existing index. Then, we design an efficient index structure called<jats:italic>TG index<\/jats:italic>and propose several algorithms using the TG index that can prune the search space with both spatio-temporal and textual information simultaneously. Further, we show that the TG index technique can also be applied to improve the performance of time-travel text search and spatial keyword query. Extensive experiments using both real and synthetic datasets demonstrate the effectiveness and efficiency of the presented index and algorithms.<\/jats:p>","DOI":"10.1145\/3143802","type":"journal-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T12:34:28Z","timestamp":1509712468000},"page":"1-48","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Towards Efficient Framework for Time-Aware Spatial Keyword Queries on Road Networks"],"prefix":"10.1145","volume":"36","author":[{"given":"Jingwen","family":"Zhao","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Rui","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2017,11,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348318"},{"volume-title":"Flux-capacitor: Efficient time-travel text search. In VLDB. 1414--1417.","year":"2007","author":"Berberich Klaus","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ricardo Campos Ga\u00f6l Dias Al\u00edpio M\u00e1rio Jorge and Adam Jatowt. 2014. Survey of temporal information retrieval and related applications. ACM Comput. Surv. 47 2 (2014). Ricardo Campos Ga\u00f6l Dias Al\u00edpio M\u00e1rio Jorge and Adam Jatowt. 2014. Survey of temporal information retrieval and related applications. ACM Comput. Surv. 47 2 (2014).","DOI":"10.1145\/2619088"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.07.006"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-017-9302-1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Xin Cao Lisi Chen Gao Cong Christian S. Jensen Qiang Qu Anders Skovsgaard Dingming Wu and Man Lung Yiu. 2012. Spatial keyword querying. In ER. 16--29. Xin Cao Lisi Chen Gao Cong Christian S. Jensen Qiang Qu Anders Skovsgaard Dingming Wu and Man Lung Yiu. 2012. Spatial keyword querying. In ER. 16--29.","DOI":"10.1007\/978-3-642-34002-4_2"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Xin Cao Gao Cong Christian S. Jensen and Ben C. Ooi. 2011. Collective spatial keyword querying. In SIGMOD. 373--384. Xin Cao Gao Cong Christian S. Jensen and Ben C. Ooi. 2011. Collective spatial keyword querying. In SIGMOD. 373--384.","DOI":"10.1145\/1989323.1989363"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Lisi Chen Gao Cong Xin Cao and Kian-Lee Tan. 2015. Temporal spatial-keyword top-k publish\/subscribe. In ICDE. 255--266. Lisi Chen Gao Cong Xin Cao and Kian-Lee Tan. 2015. Temporal spatial-keyword top- k publish\/subscribe. In ICDE. 255--266.","DOI":"10.1109\/ICDE.2015.7113289"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Lisi Chen Gao Cong Christian S. Jensen and Dingming Wu. 2013. Spatial keyword query processing: An experimental evaluation. In VLDB. 217--228. Lisi Chen Gao Cong Christian S. Jensen and Dingming Wu. 2013. Spatial keyword query processing: An experimental evaluation. In VLDB. 217--228.","DOI":"10.14778\/2535569.2448955"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113291"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1177\/001316446002000104"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.05.002"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0031619"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Yunjun Gao Qing Liu Gang Chen Baihua Zheng and Linlin Zhou. 2015a. Answering why-not questions on reverse top-k queries. In VLDB. 738--749. Yunjun Gao Qing Liu Gang Chen Baihua Zheng and Linlin Zhou. 2015a. Answering why-not questions on reverse top- k queries. In VLDB. 738--749.","DOI":"10.14778\/2752939.2752943"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2365820"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2477837"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009993"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113290"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383974"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.03.006"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Nattiya Kanhabua and Kjetil N\u00f8rv\u00e5g. 2010. Determining time of queries for re-ranking search results. In ECDL. 261--272. Nattiya Kanhabua and Kjetil N\u00f8rv\u00e5g. 2010. Determining time of queries for re-ranking search results. In ECDL. 261--272.","DOI":"10.1007\/978-3-642-15464-5_27"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224229"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.03.005"},{"volume-title":"TempWeb Workshop. 841--842","year":"2016","author":"Kuzey Erdal","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.243"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465275"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989361"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380776.2380780"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Jo\u00e3o Rocha-Junior and Kjetil N\u00f8rv\u00e5g. 2012. Top-k spatial keyword queries on road networks. In EDBT. 168--179. Jo\u00e3o Rocha-Junior and Kjetil N\u00f8rv\u00e5g. 2012. Top- k spatial keyword queries on road networks. In EDBT. 168--179.","DOI":"10.1145\/2247596.2247617"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Joo B. Rocha-Junior Orestis Gkorgkas Simon Jonassen and Kjetil N\u00f8rv\u00e5g. 2011. Efficient processing of top-k spatial keyword queries. In SSTD. 205--222. Joo B. Rocha-Junior Orestis Gkorgkas Simon Jonassen and Kjetil N\u00f8rv\u00e5g. 2011. Efficient processing of top- k spatial keyword queries. In SSTD. 205--222.","DOI":"10.1007\/978-3-642-22922-0_13"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/319806.319816"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/318898.318921"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2741693"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA187244"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.01.003"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Vassilis J. Tsotras Christian S. Jensen and Richard. T. Snodgrass. 1998. An extensible notation for spatio-temporal index queries. In SIGMOD. 47--53. Vassilis J. Tsotras Christian S. Jensen and Richard. T. Snodgrass. 1998. An extensible notation for spatio-temporal index queries. In SIGMOD. 47--53.","DOI":"10.1145\/273244.273258"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(95)00011-R"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683268"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0403-4"},{"volume-title":"Ap-tree: Efficiently support continuous spatial-keyword queries over stream. In ICDE. 1107--1118.","year":"2015","author":"Wang Xiang","key":"e_1_2_1_43_1"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0271-0"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.172"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767861"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Yinglian Xie and David Hallaron. 2002. Locality in search engine queries and its implications for caching. In INFOCOM. 1238--1247. Yinglian Xie and David Hallaron. 2002. Locality in search engine queries and its implications for caching. In INFOCOM. 1238--1247.","DOI":"10.1109\/INFCOM.2002.1019374"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806558"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Chengyuan Zhang Ying Zhang Wenjie Zhang and Xuemin Lin. 2013b. Inverted linear quadtree: Efficient top-k spatial keyword search. In ICDE. 901--912. Chengyuan Zhang Ying Zhang Wenjie Zhang and Xuemin Lin. 2013b. Inverted linear quadtree: Efficient top- k spatial keyword search. In ICDE. 901--912.","DOI":"10.1109\/ICDE.2013.6544884"},{"key":"e_1_2_1_50_1","unstructured":"Chengyuan Zhang Ying Zhang Wenjie Zhang Xuemin Lin Muhammad Aamir Cheema and Xiaoyang Wang. 2014. Diversified spatial keyword search on road networks. In EDBT. 367--378. Chengyuan Zhang Ying Zhang Wenjie Zhang Xuemin Lin Muhammad Aamir Cheema and Xiaoyang Wang. 2014. Diversified spatial keyword search on road networks. In EDBT. 367--378."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452419"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.97"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.04.001"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113303"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399306"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3143802","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3143802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T21:11:30Z","timestamp":1750972290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3143802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,3]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7,31]]}},"alternative-id":["10.1145\/3143802"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3143802","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"type":"print","value":"1046-8188"},{"type":"electronic","value":"1558-2868"}],"subject":[],"published":{"date-parts":[[2017,11,3]]},"assertion":[{"value":"2017-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}