Database Paper Browser

Back to papers

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)

Paper ID
4696
Venue
SIGMOD
Year
2013
Pagerank
0.00013894562
Overall Rank
1,115 | 92.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers