Filters








5 Hits in 0.75 sec

k-nearest neighbors on road networks

Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar
2016 Proceedings of the VLDB Endowment  
A k nearest neighbor (kNN) query on road networks retrieves the k closest points of interest (POIs) by their network distances from a given location. Today, in the era of ubiquitous mobile computing, this is a highly pertinent query. While Euclidean distance has been used as a heuristic to search for the closest POIs by their road network distance, its efficacy has not been thoroughly investigated. The most recent methods have shown significant improvement in query performance. Earlier studies,
more » ... e. Earlier studies, which proposed disk-based indexes, were compared to the current state-of-the-art in main memory. However, recent studies have shown that main memory comparisons can be challenging and require careful adaptation. This paper presents an extensive experimental investigation in main memory to settle these and several other issues. We use efficient and fair memory-resident implementations of each method to reproduce past experiments and conduct additional comparisons for several overlooked evaluations. Notably we revisit a previously discarded technique (IER) showing that, through a simple improvement, it is often the best performing technique.
doi:10.14778/2904121.2904125 fatcat:5qrmasyryvf5dhi7paivyrtmtm

k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation [article]

Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar
2016 arXiv   pre-print
A k nearest neighbor (kNN) query on road networks retrieves the k closest points of interest (POIs) by their network distances from a given location. Today, in the era of ubiquitous mobile computing, this is a highly pertinent query. While Euclidean distance has been used as a heuristic to search for the closest POIs by their road network distance, its efficacy has not been thoroughly investigated. The most recent methods have shown significant improvement in query performance. Earlier studies,
more » ... e. Earlier studies, which proposed disk-based indexes, were compared to the current state-of-the-art in main memory. However, recent studies have shown that main memory comparisons can be challenging and require careful adaptation. This paper presents an extensive experimental investigation in main memory to settle these and several other issues. We use efficient and fair memory-resident implementations of each method to reproduce past experiments and conduct additional comparisons for several overlooked evaluations. Notably we revisit a previously discarded technique (IER) showing that, through a simple improvement, it is often the best performing technique.
arXiv:1601.01549v2 fatcat:kj5llfoomnahnlgm2zsjeb2yzi

In Search of Points of Interest: A Story of Decoupled Heuristics on Road Networks

TENINDRA NADEESHAN ABEYWICKRAMA
2019
Map-based services like Google Maps have become a part of daily life. The key to many of these services is in finding points-of-interest through the road network. For example, a ride-hailing app like Uber must find the nearest drivers to your location by their ETA. As a result, accurately and efficiently finding such points-of-interest in road networks has become an important area of scientific endeavour. This thesis tells a story of a long-neglected strategy known as "Decouple Heuristics",
more » ... le Heuristics", which we revive to develop new techniques that significantly improve the performance of road network point-of-interest search.
doi:10.26180/5d354da331076 fatcat:u75sjwprizg5lj6pn55ayylmoa

Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract)

Tenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt
2021 Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence   unpublished
Work was mainly completed while Tenindra Abeywickrama was with Monash University.  ...  The results for sum can be found in [Abeywickrama et al., 2020] .  ...  We refer the reader to [Abeywickrama et al., 2020] for full derivation.  ... 
doi:10.24963/ijcai.2021/640 fatcat:ms2hrns2jja7vb2to75v2xxltq

Query Processing in Location-Based Social Networks

AMMAR SOHAIL
2018
I thank my fellow research mates, Arif Hidayat, Anasthasia Agnes Haryanto, Chaluka Salgado, Nasser Allheeib, Tenindra Abeywickrama, Utari Wijayanti and Zhou Shou, for the stimulating discussions and for  ... 
doi:10.26180/5bf2a857b72cd fatcat:m6nptqzjpbhcnmwi7fmimsrudm