.png){kind=icon}
返回
Query processing in spatial databases containing obstacles
.png){kind=icon}
OA
AI
DOI：10.1080/13658810500286935.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified through extensive experiments.
Keyword:
spatial databases
query processing
visibility graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.1
论文数:
2.7K
被引数:
9.3K
机构
暂无机构信息
引用论文
.png){kind=icon}
The impact of financial management practices on accountability of Islamic social enterprise (ISE)金融管理实践对伊斯兰社会企业（ISE）问责制的影响
PREAI
分享收藏
查看更多内容