Continuous monitoring of top-k spatial keyword queries in road networks

Yanhong Li, Guohui Li, Lihchyun Shu, Qun Huang, Hong Jiang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road networks, a novel index structure called TPRgt-tree is proposed. Based on the index, an efficient CMTkSK query processing method which includes three main phases, namely generating initial result set phase, pruning phase, and continuous monitoring phase, is proposed. The proposed method can deal with the situation where the query client and geo-textual objects move continuously in the road network. By finding the result change time points, the method can continuously monitor CMTkSK queries and keep the query result set up-to-date with a small price. Finally, experiment results show that the proposed method is much more efficient and precise than its competitor.

Original languageEnglish
Pages (from-to)1831-1848
Number of pages18
JournalJournal of Information Science and Engineering
Volume31
Issue number6
Publication statusPublished - 2015 Nov

Fingerprint

Query processing
road network
monitoring
Monitoring
Processing
Experiments
experiment

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

Li, Yanhong ; Li, Guohui ; Shu, Lihchyun ; Huang, Qun ; Jiang, Hong. / Continuous monitoring of top-k spatial keyword queries in road networks. In: Journal of Information Science and Engineering. 2015 ; Vol. 31, No. 6. pp. 1831-1848.
@article{d02e852317ee48bb8262e301f2134981,
title = "Continuous monitoring of top-k spatial keyword queries in road networks",
abstract = "Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road networks, a novel index structure called TPRgt-tree is proposed. Based on the index, an efficient CMTkSK query processing method which includes three main phases, namely generating initial result set phase, pruning phase, and continuous monitoring phase, is proposed. The proposed method can deal with the situation where the query client and geo-textual objects move continuously in the road network. By finding the result change time points, the method can continuously monitor CMTkSK queries and keep the query result set up-to-date with a small price. Finally, experiment results show that the proposed method is much more efficient and precise than its competitor.",
author = "Yanhong Li and Guohui Li and Lihchyun Shu and Qun Huang and Hong Jiang",
year = "2015",
month = "11",
language = "English",
volume = "31",
pages = "1831--1848",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "6",

}

Continuous monitoring of top-k spatial keyword queries in road networks. / Li, Yanhong; Li, Guohui; Shu, Lihchyun; Huang, Qun; Jiang, Hong.

In: Journal of Information Science and Engineering, Vol. 31, No. 6, 11.2015, p. 1831-1848.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Continuous monitoring of top-k spatial keyword queries in road networks

AU - Li, Yanhong

AU - Li, Guohui

AU - Shu, Lihchyun

AU - Huang, Qun

AU - Jiang, Hong

PY - 2015/11

Y1 - 2015/11

N2 - Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road networks, a novel index structure called TPRgt-tree is proposed. Based on the index, an efficient CMTkSK query processing method which includes three main phases, namely generating initial result set phase, pruning phase, and continuous monitoring phase, is proposed. The proposed method can deal with the situation where the query client and geo-textual objects move continuously in the road network. By finding the result change time points, the method can continuously monitor CMTkSK queries and keep the query result set up-to-date with a small price. Finally, experiment results show that the proposed method is much more efficient and precise than its competitor.

AB - Recently, spatial keyword queries (SKQ) have become a hot topic in database field. However, Most of the existing SKQ methods are limited in Euclidean space or assume that objects (and queries) are static. This paper addresses the issue of processing continuous top-k spatial keyword queries over moving objects (CMTkSK) in road networks. To efficiently index moving geo-textual objects in road networks, a novel index structure called TPRgt-tree is proposed. Based on the index, an efficient CMTkSK query processing method which includes three main phases, namely generating initial result set phase, pruning phase, and continuous monitoring phase, is proposed. The proposed method can deal with the situation where the query client and geo-textual objects move continuously in the road network. By finding the result change time points, the method can continuously monitor CMTkSK queries and keep the query result set up-to-date with a small price. Finally, experiment results show that the proposed method is much more efficient and precise than its competitor.

UR - http://www.scopus.com/inward/record.url?scp=84947419402&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947419402&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84947419402

VL - 31

SP - 1831

EP - 1848

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 6

ER -