{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:37Z","timestamp":1763468257387},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,6]]},"abstract":"<jats:p>\n            With the rapid development of mobile devices and the crowdsourcing platforms, the spatial crowdsourcing has attracted much attention from the database community, specifically, spatial crowdsourcing refers to sending a location-based request to workers according to their positions. In this paper, we consider an important spatial crowdsourcing problem, namely\n            <jats:italic>reliable diversity-based spatial crowdsourcing<\/jats:italic>\n            (RDB-SC), in which spatial tasks (such as taking videos\/photos of a landmark or firework shows, and checking whether or not parking spaces are available) are time-constrained, and workers are moving towards some directions. Our RDB-SC problem is to assign workers to spatial tasks such that the completion reliability and the spatial\/temporal diversities of spatial tasks are maximized. We prove that the RDB-SC problem is NP-hard and intractable. Thus, we propose three effective approximation approaches, including greedy, sampling, and divide-and-conquer algorithms. In order to improve the efficiency, we also design an effective cost-model-based index, which can dynamically maintain moving workers and spatial tasks with low cost, and efficiently facilitate the retrieval of RDB-SC answers. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed approaches over both real and synthetic datasets.\n          <\/jats:p>","DOI":"10.14778\/2794367.2794372","type":"journal-article","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T14:37:34Z","timestamp":1438267054000},"page":"1022-1033","source":"Crossref","is-referenced-by-count":125,"title":["Reliable diversity-based spatial crowdsourcing by moving workers"],"prefix":"10.14778","volume":"8","author":[{"given":"Peng","family":"Cheng","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Lian","sequence":"additional","affiliation":[{"name":"University of Texas Rio Grande Valley, Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Chen","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Fu","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinsong","family":"Han","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jizhong","family":"Zhao","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"https:\/\/www.google.com\/maps\/views\/streetview.  https:\/\/www.google.com\/maps\/views\/streetview."},{"key":"e_1_2_1_2_1","unstructured":"http:\/\/mediaqv3.cloudapp.net\/MediaQ_MVC_V3\/.  http:\/\/mediaqv3.cloudapp.net\/MediaQ_MVC_V3\/."},{"key":"e_1_2_1_3_1","unstructured":"https:\/\/foursquare.com.  https:\/\/foursquare.com."},{"key":"e_1_2_1_4_1","unstructured":"https:\/\/www.waze.com.  https:\/\/www.waze.com."},{"key":"e_1_2_1_5_1","unstructured":"https:\/\/www.mturk.com\/mturk\/welcome.  https:\/\/www.mturk.com\/mturk\/welcome."},{"key":"e_1_2_1_6_1","unstructured":"http:\/\/arxiv.org\/abs\/1412.0223.  http:\/\/arxiv.org\/abs\/1412.0223."},{"key":"e_1_2_1_7_1","unstructured":"http:\/\/www.gmissionhkust.com.  http:\/\/www.gmissionhkust.com."},{"key":"e_1_2_1_8_1","unstructured":"http:\/\/youtu.be\/FfNoeqFc084.  http:\/\/youtu.be\/FfNoeqFc084."},{"key":"e_1_2_1_9_1","volume-title":"data 13, points of interest of china","year":"2008","unstructured":"Beijing city lab, 2008 , data 13, points of interest of china in 2008 . http:\/\/www.beijingcitylab.com. Beijing city lab, 2008, data 13, points of interest of china in 2008. http:\/\/www.beijingcitylab.com."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868914.1868921"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_2_1_12_1","first-page":"421","volume-title":"The skyline operator","author":"B\u00f6rzs\u00f6nyi S.","year":"2001","unstructured":"S. B\u00f6rzs\u00f6nyi , D. Kossmann , and K. Stocker . The skyline operator . pages 421 -- 430 , 2001 . S. B\u00f6rzs\u00f6nyi, D. Kossmann, and K. Stocker. The skyline operator. pages 421--430, 2001."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOMW.2011.5766944"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733047"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378600.1378624"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0004-3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525370"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2031331.2031337"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424346"},{"key":"e_1_2_1_20_1","volume-title":"The easiest hard problem: Number partitioning. Computational Complexity and Statistical Physics, page 125","author":"Mertens S.","year":"2006","unstructured":"S. Mertens . The easiest hard problem: Number partitioning. Computational Complexity and Statistical Physics, page 125 , 2006 . S. Mertens. The easiest hard problem: Number partitioning. Computational Complexity and Statistical Physics, page 125, 2006."},{"key":"e_1_2_1_21_1","first-page":"483","volume-title":"VLDB","author":"Yiu M. L.","year":"2007","unstructured":"M. L. Yiu and N. Mamoulis . Efficient processing of top-k dominating queries on multi-dimensional data . In VLDB , pages 483 -- 494 , 2007 . M. L. Yiu and N. Mamoulis. Efficient processing of top-k dominating queries on multi-dimensional data. In VLDB, pages 483--494, 2007."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020462"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869807"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2794367.2794372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:10:24Z","timestamp":1672225824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2794367.2794372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["10.14778\/2794367.2794372"],"URL":"https:\/\/doi.org\/10.14778\/2794367.2794372","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}