Finding Time Period-Based Most Frequent Path in Big Trajectory Data
Summary: TPMFP: time-period-based most frequent path between a source and destination, with suffix-optimal, length-insensitive, and bottleneck-free guarantees. Efficient search algorithms and novel indexes scale TPMFP to massive trajectory data, validated on a real dataset with 11M+ trajectories. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wuman Luo (Guangdong University of Technology; Hong Kong University of Science and Technology)
- 2. Haoyu Tan (Guangdong University of Technology; Hong Kong University of Science and Technology)
- 3. Lei Chen (Guangdong University of Technology; Hong Kong University of Science and Technology)
- 4. Lionel M. Ni (Guangdong University of Technology; Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{luo_sigmod13,
title = {{Finding Time Period-Based Most Frequent Path in Big Trajectory Data}},
author = {Luo, Wuman and Tan, Haoyu and Chen, Lei and Ni, Lionel M.},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2465287},
url = {https://dl.acm.org/doi/10.1145/2463676.2465287},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.001992968 |
| 917 | Trajectory Clustering: A Partition-and-Group Framework | 2007 | SIGMOD | 0.00013091246 |
| 1,783 | Swarm: Mining Relaxed Temporal Moving Object Clusters | 2010 | VLDB | 9.6511944e-05 |
| 2,310 | The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries | 2001 | VLDB | 8.6626285e-05 |
| 2,608 | TraClass: Trajectory Classification Using Hierarchical Region-Based and Trajectory-Based Clustering | 2008 | VLDB | 8.2287717e-05 |
| 2,911 | Indexing Large Trajectory Data Sets With SETI* | 2003 | CIDR | 7.8720638e-05 |
| 3,705 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB | 7.0834003e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,705 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB |
| 2 | 9,280 | Efficient Algorithms for Finding Optimal Meeting Point on Road Networks | 2011 | VLDB |
| 3 | 1,942 | Discovery of Convoys in Trajectory Databases | 2008 | VLDB |
| 4 | 1,722 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB |
| 5 | 1,621 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD |
| 6 | 4,906 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 7 | 9,917 | Effective and Efficient Route Planning Using Historical Trajectories on Road Networks | 2023 | VLDB |
| 8 | 4,352 | Searching Trajectories by Locations - An Efficiency Study | 2010 | SIGMOD |
| 9 | 5,011 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB |
| 10 | 12,181 | The Maximum Trajectory Coverage Query in Spatial Databases | 2019 | VLDB |