Hao Wu
- T. Abeywickrama, M. Aamir Cheema, and D. Taniar. 2016. K-nearest neighbors on road networks: A journey in experimentation and in-memory implementation. Proc. VLDB Endow. 9, 6, 492–503. DOI: .Google Scholar
Digital Library
- Amazon Web Services. Amazon EC2 M5. https://aws.amazon.com/ec2/instance-types/m5/.Google Scholar
- B. Cao, C. Hou, S. Li, J. Fan, J. Yin, B. Zheng, and J. Bao. 2018. SIMkNN: A scalable method for in-memory kNN search over moving objects in road networks. IEEE Trans. Knowl. Data Eng. 30, 10, 1957–1970. DOI: .Google ScholarCross Ref
- J. Hamme. 2013. Customizable Route Planning in External Memory. Bachelor’s thesis. Karlsruhe Institute of Technology. https://i11www.iti.kit.edu/_media/teaching/theses/ba-hamme-13.pdf.Google Scholar
- M. Kolahdouzan and C. Shahabi. 2004. Voronoi-based K nearest neighbor search for spatial network databases. In Proceedings 2004 VLDB Conference. ACM, 840–851.Google Scholar
- V. Leis, A. Kemper, and T. Neumann. 2013. The adaptive radix tree: ARTful indexing for main-memory databases. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 38–49. DOI: .Google ScholarDigital Library
- Wikipedia. OpenStreetMap. Wikipedia, the Free Encyclopedia. Accessed February 11, 2021 from https://en.wikipedia.org/wiki/OpenStreetMap.Google Scholar
- D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. 2003. Query processing in spatial network databases. In Proceedings 2003 VLDB Conference. VLDB Endowment, 802–813.Google Scholar
- Y. Xu, J. Qi, R. Borovica-Gajic, and L. Kulik. 2018. Finding all nearest neighbors with a single graph traversal. In Database Systems for Advanced Applications, DASFAA 2018, Vol. 10827: Lecture Notes in Computer Science. Springer, Cham, 221–238. DOI: .Google ScholarDigital Library
- Z. Zhang, X. Huang, C. Sun, S. Zheng, B. Hu, J. Varadarajan, Y. Yin, R. Zimmermann, and G. Wang. 2019. Sextant: Grab’s scalable in-memory spatial data store for real-time K-nearest neighbour search. In 2019 20th IEEE International Conference on Mobile Data Management (MDM). IEEE, 243–251. DOI: .Google ScholarCross Ref
Index Terms
- A Scalable In-Memory Solution for Real-Time K Nearest Search on Road Network
Recommendations
Aggregate k-nearest neighbors queries in time-dependent road networks
MobiGIS '15: Proceedings of the Fourth ACM SIGSPATIAL International Workshop on Mobile Geographic Information SystemsIn this paper we present an algorithm for processing aggregate nearest neighbor queries in time-dependent road networks, i.e., given a road network where the travel time over an edge is time-dependent, a set of query points Q, a set of points of ...
Confirmation Sampling for Exact Nearest Neighbor Search
Similarity Search and ApplicationsAbstractLocality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC ’98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate nearest ...
Complementary hashing for approximate nearest neighbor search
ICCV '11: Proceedings of the 2011 International Conference on Computer VisionRecently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral Hashing, expects better performance than the data-blind counterparts, e.g.,...
Comments