DBScholar

Back to papers

The Maximum Trajectory Coverage Query in Spatial Databases

Summary: Introduces kBFT and kBCovFT, including the latter’s non-submodular NP-hard coverage objective. The TQ-tree combines quadtree hierarchy with intra-node Z-ordering for trajectory-locality pruning, yielding 2–3 orders-of-magnitude speedups. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12101
Venue
VLDB
Year
2019
Pagerank
5.093636e-05
Overall Rank
11,881 | 18.49%
DOI
10.14778/3291264.3291266

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{ali_vldb19,
        title = {{The Maximum Trajectory Coverage Query in Spatial Databases}},
        author = {Ali, Mohammed Eunus and Eusuf, Shadman Saqib and Abdullah, Kaysar and Choudhury, Farhana M. and Culpepper, J. Shane and Sellis, Timos},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {3},
        pages = {197--209},
        doi = {10.14778/3291264.3291266},
        url = {https://doi.org/10.14778/3291264.3291266},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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