Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases-Reference-Cited by-同舟云学术

Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases

Published:2010 Issue: Volume: Page:296-310
ISSN:0302-9743
Container-title:Databases in Networked Information Systems
language:
Short-container-title:

Author:

Demiryurek Ugur,Banaei-Kashani Farnoush,Shahabi Cyrus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12038-1_20.pdf

Reference24 articles.

1. Chabini, I.: The discrete-time dynamic shortest path problem: Complexity, algorithms, and implementations. In: Transportation Research Record (1999)

2. Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to cnn queries in a road network. In: VLDB (2005)

3. Cooke, L., Halsey, E.: The shortest route through a network with timedependent internodal transit times. Journal of Mathematical Analysis and Applications (1966)

4. Dean, B.C.: Algorithms for minimum cost paths in time-dependent networks. Networks (1999)

5. Lecture Notes in Computer Science;U. Demiryurek,2009

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient k NN Search in Public Transportation Networks;Proceedings of the VLDB Endowment;2024-07

2. DynaHB: A Communication-Avoiding Asynchronous Distributed Framework with Hybrid Batches for Dynamic GNN Training;Proceedings of the VLDB Endowment;2024-07

3. Processing kNN Query with Pre-Computation in Time-Dependent Road Networks;2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta);2022-12

4. Efficient kNN query for moving objects on time-dependent road networks;The VLDB Journal;2022-07-27

5. Efficient processing of distance–time k th‐order skyline queries in bicriteria networks;IET Intelligent Transport Systems;2019-01-09