.png){kind=icon}
返回
Node and edge selectivity estimation for range queries in spatial networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.is.2008.09.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Modern applications requiring spatial network processing pose several interesting query optimization challenges. Spatial networks are usually represented as graphs, and therefore, queries involving a spatial network can be executed by using the corresponding graph representation. This means that the cost for executing a query is determined by graph properties such as the graph order and size (i.e., number of nodes and edges) and other graph parameters. In this paper, we present novel methods to estimate the number of nodes and edges in regions of interest in spatial networks, towards predicting the space and time requirements for range queries. The methods are evaluated by using real-life and synthetic data sets. Experimental results show that the number of nodes and edges can be estimated efficiently and accurately, with relatively small space requirements, thus providing useful information to the query optimizer. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Spatial networks
Selectivity estimation
Query optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
分享收藏分享收藏External pH regulates the slowly activating potassium current IsK expressed in Xenopus oocytes.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏
查看更多内容