Search continuous spatial keyword range queries over moving objects in road networks

Xiaokun Du, Yanhong Li, Qun Huang, Lih-Chyun Shu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

With the popularization of GPS-enabled devices and the arrival of the big data era, a significant amount of spatial documents have been generated every day. This development gives prominence to spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects. However, Most of the existing SKQ methods are limited in Euclidean space which are unsuitable for SKQ processing in road networks. The paper addresses the issue of processing continuous spatial keyword range queries over moving objects (CMRSK) in road networks where both the query point and data objects can freely move within the road network. By using a range tree to bound the monitoring region of a CMRSK query, an efficient query processing method is proposed. Finally, simulation experiments are conducted to demonstrate the efficiency of our proposed method.

Original languageEnglish
Pages (from-to)759-767
Number of pages9
JournalJournal of Computational Information Systems
Volume11
Issue number2
DOIs
Publication statusPublished - 2015 Jan 15

Fingerprint

Query processing
Global positioning system
Monitoring
Processing
Experiments
Big data

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications

Cite this

@article{009cbd220afc4ea2af2cea8fb02e5d6e,
title = "Search continuous spatial keyword range queries over moving objects in road networks",
abstract = "With the popularization of GPS-enabled devices and the arrival of the big data era, a significant amount of spatial documents have been generated every day. This development gives prominence to spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects. However, Most of the existing SKQ methods are limited in Euclidean space which are unsuitable for SKQ processing in road networks. The paper addresses the issue of processing continuous spatial keyword range queries over moving objects (CMRSK) in road networks where both the query point and data objects can freely move within the road network. By using a range tree to bound the monitoring region of a CMRSK query, an efficient query processing method is proposed. Finally, simulation experiments are conducted to demonstrate the efficiency of our proposed method.",
author = "Xiaokun Du and Yanhong Li and Qun Huang and Lih-Chyun Shu",
year = "2015",
month = "1",
day = "15",
doi = "10.12733/jcis13181",
language = "English",
volume = "11",
pages = "759--767",
journal = "Journal of Computational Information Systems",
issn = "1553-9105",
publisher = "Binary Information Press",
number = "2",

}

Search continuous spatial keyword range queries over moving objects in road networks. / Du, Xiaokun; Li, Yanhong; Huang, Qun; Shu, Lih-Chyun.

In: Journal of Computational Information Systems, Vol. 11, No. 2, 15.01.2015, p. 759-767.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Search continuous spatial keyword range queries over moving objects in road networks

AU - Du, Xiaokun

AU - Li, Yanhong

AU - Huang, Qun

AU - Shu, Lih-Chyun

PY - 2015/1/15

Y1 - 2015/1/15

N2 - With the popularization of GPS-enabled devices and the arrival of the big data era, a significant amount of spatial documents have been generated every day. This development gives prominence to spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects. However, Most of the existing SKQ methods are limited in Euclidean space which are unsuitable for SKQ processing in road networks. The paper addresses the issue of processing continuous spatial keyword range queries over moving objects (CMRSK) in road networks where both the query point and data objects can freely move within the road network. By using a range tree to bound the monitoring region of a CMRSK query, an efficient query processing method is proposed. Finally, simulation experiments are conducted to demonstrate the efficiency of our proposed method.

AB - With the popularization of GPS-enabled devices and the arrival of the big data era, a significant amount of spatial documents have been generated every day. This development gives prominence to spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects. However, Most of the existing SKQ methods are limited in Euclidean space which are unsuitable for SKQ processing in road networks. The paper addresses the issue of processing continuous spatial keyword range queries over moving objects (CMRSK) in road networks where both the query point and data objects can freely move within the road network. By using a range tree to bound the monitoring region of a CMRSK query, an efficient query processing method is proposed. Finally, simulation experiments are conducted to demonstrate the efficiency of our proposed method.

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

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

U2 - 10.12733/jcis13181

DO - 10.12733/jcis13181

M3 - Article

AN - SCOPUS:84923486122

VL - 11

SP - 759

EP - 767

JO - Journal of Computational Information Systems

JF - Journal of Computational Information Systems

SN - 1553-9105

IS - 2

ER -