The collective spatial keyword query (CSKQ), an important variant of spatial keyword queries, aims to find a set of the objects that collectively cover users' queried keywords, and those objects are close to the query location and have small inter-object distances. Existing works only focus on the CSKQ problem in the Euclidean space, although we observe that, in many real-life applications, the closeness of two spatial objects is measured by their road network distance. Thus, existing methods cannot solve the problem of network-based CSKQ efficiently. In this paper, we study the problem of collective spatial keyword query processing on road networks , where the objects are located on a predefined road network. We first prove that this problem is NP-complete , and then we propose two approximate algorithms with provable approximation bounds and one exact algorithm, for supporting CSKQ on road networks efficiently. Extensive experiments using real datasets demonstrate the efficiency and accuracy of our presented algorithms.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient Collective Spatial Keyword Query Processing on Road Networks




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    55.84 Straßenverkehr / 55.24 / 55.84 / 55.24 Fahrzeugführung, Fahrtechnik



    Efficient Collective Spatial Keyword Query Processing on Road Networks

    Gao, Yunjun / Zhao, Jingwen / Zheng, Baihua et al. | IEEE | 2016



    Time-Aware and Direction-Constrained Collective Spatial Keyword Query

    Feng, Zhe / Li, Guohui / Li, Jianjun et al. | IEEE | 2025


    Effective XML keyword query processing

    Lambole, Prashant R. / Chatur, Prashant N. | IEEE | 2017


    Index and query methods in road networks

    Feng, Jun ;Watanabe, Toyohide | SLUB | 2015