Institutional Repository
| 基于时空同现挖掘技术的FNRB-Tree | |
| Alternative Title | fnrb-tree:based on spatial-temporal co-occurrence mining technique |
| 黄照鹤; 戴健 | |
| 2012 | |
| Source | 小型微型计算机系统
 |
| ISSN | 1000-1220 |
| Volume | 33Issue:12Pages:2636-2641 |
| English Abstract | FNR-Tree利用2D R-Tree和1D R-Tree的结构,很好地结合了时间和空间的索引.但是随着索引数据量的增多,R-Tree本身的两个问题凸显出来(1)更新效率不高;(2)查询效率不高.本文在考虑了移动对象的时空同现的模式基础上,提出了一种对FNR-Tree优化的索引树FNRB-Tree,对于相同时间具有相同子轨迹的移动对象进行了按照路段的索引合并,从而达到了对FNR-Tree进行批量更新的效果.实验结果表明,FNRB-Tree在大数据量的情况下,(1)更新效率进行了提高;(2)对于邻近查询的响应时间更短. |
| Indexed Type | CNKI ; WANFANG ; CSCD |
| Abstract | FNR-Tree (Fixed Network R-Tree) is a spatial-temporal indexing tree which combines 2D R-Tree and 1D R-Tree structure.However,with the increasing amount of spatial-temporal data,two inherent R-Tree problems become even more prominent:(1) update costly; (2) query costly. In this paper,we improve FNR-Tree with spatial-temporal co-occurrence mining technique and cluster parallel moving objects in the same road segment together in FNR-Tree to construct FNRB-Tree (Fixed Network R-Tree with Buckets). Experimental results show that in the case of a large mount spatial-temporal data,FNRB-Tree has two following advantages: (1) update efficiency improved; (2) better support for neighboring query. |
| Keyword | Fnr-tree Fnrb-tree 时空同现 |
| Department | 南阳理工学院计算机网络中心;中国科学院软件研究所基础软件国家工程研究中心; |
| Subject | Computer Science (Provided By Thomson Reuters) |
| Sponsorship | 国家自然科学基金项目(91124001)资助|国家自然科学基金面上项目(60970030)资助 |
| Language | 中文 |
| CSCD ID | CSCD:4709932 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15291 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 黄照鹤,戴健. 基于时空同现挖掘技术的FNRB-Tree[J]. 小型微型计算机系统,2012,33(12):2636-2641. |
| APA | 黄照鹤,&戴健.(2012).基于时空同现挖掘技术的FNRB-Tree.小型微型计算机系统,33(12),2636-2641. |
| MLA | 黄照鹤,et al."基于时空同现挖掘技术的FNRB-Tree".小型微型计算机系统 33.12(2012):2636-2641. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment