Sciweavers

392 search results - page 10 / 79
» Optimal location queries in road network databases
Sort
View
OTM
2005
Springer
14 years 1 months ago
An Efficient Trajectory Index Structure for Moving Objects in Location-Based Services
Because moving objects usually moves on spatial networks, efficient trajectory index structures are required to gain good retrieval performance on their trajectories. However, ther...
Jae-Woo Chang, Jung-Ho Um, Wang-Chien Lee
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
14 years 9 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...
GIS
2007
ACM
13 years 11 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
DEXA
2006
Springer
113views Database» more  DEXA 2006»
13 years 11 months ago
Dynamic Range Query in Spatial Network Environments
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
Fuyu Liu, Tai T. Do, Kien A. Hua
SSD
2007
Springer
133views Database» more  SSD 2007»
14 years 1 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...