Previous Article in Journal
A Traffic Flow Forecasting Method Based on Transfer-Aware Spatio-Temporal Graph Attention Network
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
IJGI
Volume 14
Issue 12
10.3390/ijgi14120458
ijgi-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Efficient k-NN Trajectory Queries on Mobility Databases

by
Linghui Lou
†,
Dong June Lew
† and
Kwang Woo Nam
*
Department of Computer and Information Engineering, Kunsan National University, Gunsan 54150, Republic of Korea
*
Author to whom correspondence should be addressed.
†
These authors contributed equally to this work.
ISPRS Int. J. Geo-Inf. 2025, 14(12), 458; https://doi.org/10.3390/ijgi14120458 (registering DOI)
Submission received: 22 September 2025 / Revised: 19 November 2025 / Accepted: 21 November 2025 / Published: 23 November 2025
Versions Notes

Abstract

The rapid adoption of GPS-enabled mobile devices has produced massive trajectory datasets that drive modern applications in traffic prediction, logistics, and spatio-temporal analytics. Yet traditional database management systems (DBMSs) still lack native operators to process such data efficiently. To overcome this limitation, we introduce a set of k-nearest neighbor (k-NN) user-defined aggregates (UDAs) that embed k-NN processing directly within the PostgreSQL engine. By integrating computation into the database core, our approach minimizes data transfer and latency while maintaining low storage overhead. Experiments on benchmarked BerlinMOD-derived datasets demonstrate that the proposed UDAs reduce query execution time by 6–23%, depending on dataset size and query complexity.
Keywords: nearest neighbor search; trajectory DB; spatial databases; k-NN queries nearest neighbor search; trajectory DB; spatial databases; k-NN queries

Share and Cite

MDPI and ACS Style

Lou, L.; Lew, D.J.; Nam, K.W. Efficient k-NN Trajectory Queries on Mobility Databases. ISPRS Int. J. Geo-Inf. 2025, 14, 458. https://doi.org/10.3390/ijgi14120458

AMA Style

Lou L, Lew DJ, Nam KW. Efficient k-NN Trajectory Queries on Mobility Databases. ISPRS International Journal of Geo-Information. 2025; 14(12):458. https://doi.org/10.3390/ijgi14120458

Chicago/Turabian Style

Lou, Linghui, Dong June Lew, and Kwang Woo Nam. 2025. "Efficient k-NN Trajectory Queries on Mobility Databases" ISPRS International Journal of Geo-Information 14, no. 12: 458. https://doi.org/10.3390/ijgi14120458

APA Style

Lou, L., Lew, D. J., & Nam, K. W. (2025). Efficient k-NN Trajectory Queries on Mobility Databases. ISPRS International Journal of Geo-Information, 14(12), 458. https://doi.org/10.3390/ijgi14120458

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop