Efficient query processing on spatial networks
Efficient query processing on spatial networks
复制标题
DOI：
10.1145/1097064.1097093
复制
发表时间：
2005-11
影响因子：
4
通讯作者：
Jagan Sankaranarayanan;H. Alborzi;H. Samet
中科院分区：
文献类型：
--
作者：
Jagan Sankaranarayanan;H. Alborzi;H. Samet
提出了一种确定空间网络中每对顶点之间的最短路径和距离的框架。该框架，被称为SILC，使用最短路径和空间网络上的顶点的空间位置之间的路径相干性，从而，导致在编码是紧凑的表示和快速的路径和距离检索。使用这个框架，各种各样的空间查询，如增量最近邻搜索和空间距离连接，可以被证明是工作在一个足够大的空间网络上的位置的数据集。建议的框架是适合的主存和磁盘驻留的数据集。
A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses path coherence between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding that is compact in representation and fast in path and distance retrievals. Using this framework, a wide variety of spatial queries such as incremental nearest neighbor searches and spatial distance joins can be shown to work on datasets of locations residing on a spatial network of sufficiently large size. The suggested framework is suitable for both main memory and disk-resident datasets.