Collaborative Computing: Networking, Applications and Worksharing. 13th International Conference, CollaborateCom 2017, Edinburgh, UK, December 11–13, 2017, Proceedings

Research Article

AXE: Objects Search in Mobile Volunteered Service

Download
50 downloads
  • @INPROCEEDINGS{10.1007/978-3-030-00916-8_8,
        author={Yao Wu and Wenjuan Liang and Yuncheng Wu and Hong Chen and Cuiping Li},
        title={AXE: Objects Search in Mobile Volunteered Service},
        proceedings={Collaborative Computing: Networking, Applications and Worksharing. 13th International Conference, CollaborateCom 2017, Edinburgh, UK, December 11--13, 2017, Proceedings},
        proceedings_a={COLLABORATECOM},
        year={2018},
        month={10},
        keywords={},
        doi={10.1007/978-3-030-00916-8_8}
    }
    
  • Yao Wu
    Wenjuan Liang
    Yuncheng Wu
    Hong Chen
    Cuiping Li
    Year: 2018
    AXE: Objects Search in Mobile Volunteered Service
    COLLABORATECOM
    Springer
    DOI: 10.1007/978-3-030-00916-8_8
Yao Wu,*, Wenjuan Liang,*, Yuncheng Wu,*, Hong Chen,*, Cuiping Li,*
    *Contact email: ideamaxwu@ruc.edu.cn, wenjuanliang@ruc.edu.cn, yunchengwu@ruc.edu.cn, chong@ruc.edu.cn, licuiping@ruc.edu.cn

    Abstract

    Proliferation of ubiquitous smartphones makes location based services prevalent. People carry these devices around everyday and everywhere, which makes mobile volunteered services emerging. As far as we know, little work has been done on the search for mobile spatial textual objects, even though considerable researches have been done on moving objects query and spatial keyword query. In this paper, we study the problem of searching for mobile spatial textual objects in mobile volunteered services: given a set of mobile object and a user query, find the most relevant objects considering both spatial locations and textual descriptions. We model each mobile object as probabilistic instances with time recency. A new hybrid index is proposed for mobile spatial textual objects, called BIG-tree. And we propose an improved threshold algorithm to efficiently process the top- query based on the index. We evaluate the performance of our approaches on real and synthetic datasets. Experimental results show our solutions outperform the baselines.