|
|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
TSC-IRNN: Time- and Space-Constraint In-Route Nearest Neighbor Query Processing Algorithms in Spatial Network Databases
Yong-Ki KIM
Jae-Woo CHANG
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E94-D
No.6
pp.1201-1209
Publication Date: 2011/06/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E94.D.1201
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Data Engineering, Web Information Systems
Keyword:
spatial network database, query processing algorithm, in-route nearest neighbor query, time & space constraints,
Full Text: PDF(1.5MB)>>
Summary:
Although a large number of query processing algorithms in spatial network database (SNDB) have been studied, there exists little research on route-based queries. Since moving objects move only in spatial networks, route-based queries, like in-route nearest neighbor (IRNN), are essential for Location-based Service (LBS) and Telematics applications. However, the existing IRNN query processing algorithm has a problem in that it does not consider time and space constraints. Therefore, we, in this paper, propose IRNN query processing algorithms which take both time and space constraints into consideration. Finally, we show the effectiveness of our IRNN query processing algorithms considering time and space constraints by comparing them with the existing IRNN algorithm.
|
open access publishing via
|
 |
 |
 |
 |
 |
|
|