Elias Ioup
ABSTRACT
Aggregate K Nearest Neighbor (AKNN) queries are problematic when performed within spatial networks. While simpler network queries may be solved by a single network traversal search, the AKNN requires a large number costly network distance computations to completely compute results. The M-Tree index, when used with Road Network Embedding, provides an efficient alternative which can return estimates of the AKNN results. The M-Tree index can then be used as a filter for AKNN results by quickly computing a superset of the query results. The final AKNN query results can be computed by sorting the results from the M-Tree. In comparison to Incremental Euclidean Restriction (IER), the M-Tree reduces the overall query processing time and the total number of necessary network distance computations required to complete a query. In addition, the M-Tree filtering method is tunable to allow increasing performance at the expense of accuracy, making it suitable for a wide variety of applications.
- P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases, pages 426--435, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc. Google Scholar
Digital Library
- H. Hu, D. L. Lee, and V. C. S. Lee. Distance indexing on road networks. In U. Dayal, K.-Y. Whang, D. B. Lomet, G. Alonso, G. M. Lohman, M. L. Kersten, S. K. Cha, and Y.-K. Kim, editors, VLDB, pages 894--905. ACM, 2006. Google ScholarDigital Library
- C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. In GIS '02: Proceedings of the 10th ACM international symposium on Advances in geographic information systems, pages 94--100, New York, NY, USA, 2002. ACM Press. Google ScholarDigital Library
- K. Shaw, E. Ioup, J. Sample, M. Abdelguerfi, and O. Tabone. Efficient approximation of spatial network queries using the m-tree with road network embedding. In 19th International Conference on Scientific and Statistical Database Management, 2007. Google ScholarDigital Library
- M. L. Yiu, N. Mamoulis, and D. Papadias. Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering, 17(6):820--833, 2005. Google ScholarDigital Library
Recommendations
Efficient Approximation of Spatial Network Queries using the M-Tree with Road Network Embedding
SSDBM '07: Proceedings of the 19th International Conference on Scientific and Statistical Database ManagementSpatial networks, such as road systems, operate differently from normal geospatial systems because objects are constrained to locations on the network. Performing queries on spatial networks demands entirely different solutions. Most spatial queries ...
Efficient algorithms for answering reverse spatial-keyword nearest neighbor queries
SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information SystemsWith the proliferation of local services and GPS-enabled mobile phones, reverse spatial-keyword Nearest Neighbor queries are becoming an important type of query. Given a service object (e.g., shop) q as the query, which has a location and a text ...
Comments