检索结果-内蒙古大学图书馆

TSC-IRNN: Time- and Space-Constraint In-Route Nearest Neighbor Query Processing Algorithms in spatial network databases

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2011年第6期E94D卷 1201-1209页

作者： Kim, Yong-Ki Chang, Jae-Woo Chonbuk Natl Univ Dept Comp Eng Chonju 561756 Chonbuk South Korea

Although a large number of query processing algorithms in spatial network database (SNDB) have been studied, there exists little research on route-based queries. Since moving objects move only in spatial networks, route-based queries, like in-route nearest neighbor (IRNN), are essential for Location-based Service (LBS) and Telematics applications. However, the existing IRNN query processing algorithm has a problem in that it does not consider time and space constraints. Therefore, we, in this paper, propose IRNN query processing algorithms which take both time and space constraints into consideration. Finally, we show the effectiveness of our IRNN query processing algorithms considering time and space constraints by comparing them with the existing IRNN algorithm.

关键词： spatial network database query processing algorithm in-route nearest neighbor query time & space constraints

来源：评论

学校读者我要写书评

暂无评论

On k-Path Covers and their applications

引用

VLDB JOURNAL 2016年第1期25卷 103-123页

作者： Funke, Stefan Nusser, Andre Storandt, Sabine Univ Stuttgart FMI Univ Str 38 D-70569 Stuttgart Germany Univ Freiburg Georges Kohler Allee 51 D-79110 Freiburg Germany

For a directed graph G with vertex set V, we call a subset a k-(All-)Path Cover if C contains a node from any simple path in G consisting of k nodes. This paper considers the problem of constructing small k-Path Covers in the context of road networks with millions of nodes and edges. In many application scenarios, the set C and its induced overlay graph constitute a very compact synopsis of G, which is the basis for the currently fastest data structure for personalized shortest path queries, visually pleasing overlays of subsampled paths, and efficient reporting, retrieval and aggregation of associated data in spatial network databases. Apart from a theoretic investigation of the problem, we provide efficient algorithms that produce very small k-Path Covers for large real-world road networks (with a posteriori guarantees via instance-based lower bounds). We also apply our algorithms to other (social, collaboration, web, etc.) networks and can improve in several instances upon previous approaches.

关键词： Path cover Graph compression VC-dimension Pruning algorithm Personalized route planning spatial network database

来源：评论

学校读者我要写书评

暂无评论

On k-Path Covers and their Applications

引用

PROCEEDINGS OF THE VLDB ENDOWMENT 2014年第10期7卷 893-902页

作者： Funke, Stefan Nusser, Andre Storandt, Sabine Univ Stuttgart Stuttgart Germany Univ Freiburg Freiburg Germany

For a directed graph G with vertex set V we call a subset C subset of V a k - (A l l -) P a t h C o v e r if C contains a node from a n y path consisting of k nodes. This paper considers the problem of constructing small k - Path Covers in the context of road networks with millions of nodes and edges. In many application scenarios the set C and its induced overlay graph constitute a very compact synopsis of G which is the basis for the currently fastest data structure for personalized shortest path queries, visually pleasing overlays of subsampled paths, and e ffi cient reporting, retrieval and aggregation of associated data in spatial network databases. Apart from a theoretical investigation of the problem, we provide e ffi cient algorithms that produce very small k - Path Covers for large real- world road networks (with a posteriori guarantees via instance- based lower bounds).

关键词： Graph theory Data visualization Directed graphs Roads and streets Application scenario Lower bounds Real world road networks Road network Shortest path queries spatial network database Theoretical investigations Vertex set

来源：评论

学校读者我要写书评

暂无评论

On k-Path Covers and their applications 40th

On <i>k</i>-Path Covers and their applications

引用

40th International Conference on Very Large Data Bases

作者： Funke, Stefan Nusser, Andre Storandt, Sabine Univ Stuttgart FMI Univ Str 38 D-70569 Stuttgart Germany Univ Freiburg Georges Kohler Allee 51 D-79110 Freiburg Germany

关键词： Path cover Graph compression VC-dimension Pruning algorithm Personalized route planning spatial network database

来源：评论

学校读者我要写书评

暂无评论

Distance-Constrained k spatial Sub-networks: A Summary of Results

引用

9th International Conference on Geographic Information Science (GIScience)

作者： Yang, KwangSoo Florida Atlantic Univ Boca Raton FL 33431 USA

ISBN: (纸本)9783319457376;9783319457383

Given a graph and a set of spatial events, the goal of Distance-Constrained k spatial Sub-networks (DCSSN) problem is to find k sub-networks that meet a distance constraint and maximize the number of spatial events covered by the sub-networks. The DCSSN problem is important for many societal applications, such as police patrol assignment and emergency response assignment. The problem is NP-hard;it is computationally challenging because of the large size of the transportation network and the distance constraint. This paper proposes a novel approach for finding k sub-networks that maximize the coverage of spatial events under the distance constraint. Experiments and a case study using Chicago crime datasets demonstrate that the proposed algorithm outperforms baseline approaches and reduces the computational cost to create a DCSSN.

关键词： spatial network query Resource allocation spatial network database

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：