一种支持多维区间查询的云对等网络索引架构
针对用户在大规模云对等网络环境下多维区间查询问题，将基于m叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次化树结构，如R树、QR树。多维区间查询算法保证查询从树的任意位置开始，避免了根节点引起的系统性能瓶颈问题。通过计算和实验验证，对于Ⅳ个节点的网络，多维区间查询效率为O（logN）（m〉2）（m表示扇出）。由此可见，查询效率与维数d无关，查询效率不会随着维数d的增加而降低。最后建立基于扇出m的代价模型，并且计算出了最优的m值。...
Saved in:
| Published in | 计算机应用研究 Vol. 33; no. 8; pp. 2470 - 2474 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
上海理工大学 光电信息与计算机工程学院,上海,200093%上海理工大学 信息化办公室,上海,200093
2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2016.08.051 |
Cover
| Summary: | 针对用户在大规模云对等网络环境下多维区间查询问题，将基于m叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次化树结构，如R树、QR树。多维区间查询算法保证查询从树的任意位置开始，避免了根节点引起的系统性能瓶颈问题。通过计算和实验验证，对于Ⅳ个节点的网络，多维区间查询效率为O（logN）（m〉2）（m表示扇出）。由此可见，查询效率与维数d无关，查询效率不会随着维数d的增加而降低。最后建立基于扇出m的代价模型，并且计算出了最优的m值。 |
|---|---|
| Bibliography: | 51-1196/TP peer-to-peer; cloud computing; multidimensional range query; index framework; m-ary balanced tree; query ef-ficiency Liu Jingyan,Chen Shiping （ a. School of Optical-Electrical ＆ Computer Engineering, b. Information Office, University of Shanghai for Science ＆ Technology, Shanghai 200093, China） This paper introduced index framework which based on m-ary balanced tree （ m is fanout of tree, m 〉 2） in order to solve multidimensional range query in large-scale cloud peer-to-peer network. It could support any kind of multidimensional data indexing hierarchical tree structure such as R-tree, QR-tree. This paper designed search algorithms which could start from any node, thus avoiding system performance bottleneck problem introduced by the root node. Calculation and experiments show that multidimensional range query efficiency limit to O （logmN） （m 〉 2 ）hops in a network with N nodes. It improves search performance of multidimensional range query independent of the dimension. The query efficiency can not red |
| ISSN: | 1001-3695 |
| DOI: | 10.3969/j.issn.1001-3695.2016.08.051 |