{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T20:34:46Z","timestamp":1722285286893},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,8]]},"abstract":"Query (e.g<\/jats:italic>., shortest path) on road networks has been extensively studied. Although most of the existing query processing approaches are designed for centralized environments, there is a growing need to handle queries on road networks in distributed environments due to the increasing query workload and the challenge of querying large networks. In this demonstration, we showcase a distributed system called<u>DISKs<\/u><\/jats:italic>(<u>DI<\/u><\/jats:italic>stributed<u>S<\/u><\/jats:italic>patial<u>K<\/u><\/jats:italic>eyword<u>s<\/u><\/jats:italic>earch) that is capable of efficiently supporting spatial group keyword search (S-GKS) on road networks. Given a group of keywordsX<\/jats:italic>and a distancer<\/jats:italic>, an SGKS returns locations on a road network, such that for each returned locationp<\/jats:italic>, there exists a set of nodes (on the road network), which are located within a network distancer<\/jats:italic>fromp<\/jats:italic>and collectively containsX<\/jats:italic>. We will demonstrate the innovative modules, performance and interactive user interfaces of DISKs.<\/jats:p>","DOI":"10.14778\/2367502.2367549","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1966-1969","source":"Crossref","is-referenced-by-count":15,"title":["DISKs"],"prefix":"10.14778","volume":"5","author":[{"given":"Siqiang","family":"Luo","sequence":"first","affiliation":[{"name":"Fudan University, China"}]},{"given":"Yifeng","family":"Luo","sequence":"additional","affiliation":[{"name":"Fudan University, China"}]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Fudan University, China"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Jihong","family":"Guan","sequence":"additional","affiliation":[{"name":"Tongji University, China"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Hadoop http:\/\/hadoop.apache.org\/. Hadoop http:\/\/hadoop.apache.org\/."},{"key":"e_1_2_1_2_1","first-page":"431","volume-title":"ICDE","author":"Bhalotia G.","year":"2002","unstructured":"G. Bhalotia , A. Hulgeri , C. Nakhe , S. Chakrabarti , and S. Sudarshan . Keyword searching and browsing in databases using BANKS . In ICDE , pages 431 -- 440 , 2002 . G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, pages 431--440, 2002."},{"key":"e_1_2_1_3_1","first-page":"373","volume-title":"SIGMOD","author":"Cao X.","year":"2011","unstructured":"X. Cao , G. Cong , C. S. Jensen , and B. C. Ooi . Collective spatial keyword querying . In SIGMOD , pages 373 -- 384 , 2011 . 10.1145\/1989323.1989363 X. Cao, G. Cong, C. S. Jensen, and B. C. Ooi. Collective spatial keyword querying. In SIGMOD, pages 373--384, 2011. 10.1145\/1989323.1989363"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/1247480.1247516","volume-title":"SIGMOD","author":"He H.","year":"2007","unstructured":"H. He , H. Wang , J. Yang , and P. S. Yu . BLINKS: Ranked keyword searches on graphs . In SIGMOD , pages 305 -- 316 , 2007 . 10.1145\/1247480.1247516 H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: Ranked keyword searches on graphs. In SIGMOD, pages 305--316, 2007. 10.1145\/1247480.1247516"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_6_1","article-title":"Spatial approximate string search","author":"Li F.","year":"2012","unstructured":"F. Li , B. Yao , M. Tang , and M. Hadjieleftheriou . Spatial approximate string search . IEEE Trans. Knowl. Data Eng., 99(PrePrints) , 2012 . F. Li, B. Yao, M. Tang, and M. Hadjieleftheriou. Spatial approximate string search. IEEE Trans. Knowl. Data Eng., 99(PrePrints), 2012.","journal-title":"IEEE Trans. Knowl. Data Eng., 99(PrePrints)"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_9_1","first-page":"545","volume-title":"ICDE","author":"Yao B.","year":"2010","unstructured":"B. Yao , F. Li , M. Hadjieleftheriou , and K. Hou . Approximate string search in spatial databases . In ICDE , pages 545 -- 556 , 2010 . B. Yao, F. Li, M. Hadjieleftheriou, and K. Hou. Approximate string search in spatial databases. In ICDE, pages 545--556, 2010."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2367502.2367549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T14:43:20Z","timestamp":1689345800000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2367502.2367549"}},"subtitle":["a system for distributed spatial group keyword search on road networks"],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.14778\/2367502.2367549"],"URL":"https:\/\/doi.org\/10.14778\/2367502.2367549","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}