Publication Type

Journal Article

Version

publishedVersion

Publication Date

2-2016

Abstract

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.

Keywords

Algorithm, collective, road network, spatial keyword query

Discipline

Databases and Information Systems | Transportation

Publication

IEEE Transactions on Intelligent Transportation Systems

Volume

17

Issue

2

First Page

469

Last Page

480

ISSN

1524-9050

Identifier

10.1109/TITS.2015.2477837

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Additional URL

https://doi.org/10.1109/TITS.2015.2477837

Download

Share

COinS