Thông tin tài liệu
Nhan đề : | Efficient kNN query for moving objects on time-dependent road networks |
Tác giả : | Jiajia, Li Cancan, Ni Dan, He |
Năm xuất bản : | 2022 |
Nhà xuất bản : | Springer |
Tóm tắt : | In this paper, we study the Time-Dependent k Nearest Neighbor (TD-kNN) query on moving objects that aims to return k objects arriving at the query location with the least traveling cost departing at a given time t. Although the kNN query on moving objects has been widely studied in the scenario of the static road network, the TD-kNN query tends to be more complicated and challenging because under the time-dependent road network, the cost of each edge is measured by a cost function rather than a fixed distance value. To tackle such difficulty, we adopt the framework of GLAD and develop an advanced index structure to support efficient fastest travel cost query on time-dependent road network. In particular, we propose the Time-Dependent H2H (TD-H2H) index, which pre-computes the aggregated weight functions between each node to some specific nodes in the decomposition tree derived from the road network. |
Mô tả: | CC BY |
URI: | https://link.springer.com/article/10.1007/s00778-022-00758-w https://dlib.phenikaa-uni.edu.vn/handle/PNK/8288 |
Bộ sưu tập | OER - Công nghệ thông tin |
XEM MÔ TẢ
42
XEM TOÀN VĂN
25
Danh sách tệp tin đính kèm: