一种支持多维区间查询的云对等网络索引架构
针对用户在大规模云对等网络环境下多维区间查询问题，将基于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
| Abstract | 针对用户在大规模云对等网络环境下多维区间查询问题，将基于m叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次化树结构，如R树、QR树。多维区间查询算法保证查询从树的任意位置开始，避免了根节点引起的系统性能瓶颈问题。通过计算和实验验证，对于Ⅳ个节点的网络，多维区间查询效率为O（logN）（m〉2）（m表示扇出）。由此可见，查询效率与维数d无关，查询效率不会随着维数d的增加而降低。最后建立基于扇出m的代价模型，并且计算出了最优的m值。 |
|---|---|
| AbstractList | TN915.02; 针对用户在大规模云对等网络环境下多维区间查询问题，将基于 m 叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次化树结构，如 R 树、QR 树。多维区间查询算法保证查询从树的任意位置开始，避免了根节点引起的系统性能瓶颈问题。通过计算和实验验证，对于 N个节点的网络，多维区间查询效率为 O（logm N）（m ＞2）（m 表示扇出）。由此可见，查询效率与维数 d 无关，查询效率不会随着维数 d 的增加而降低。最后建立基于扇出 m 的代价模型，并且计算出了最优的 m 值。 针对用户在大规模云对等网络环境下多维区间查询问题，将基于m叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次化树结构，如R树、QR树。多维区间查询算法保证查询从树的任意位置开始，避免了根节点引起的系统性能瓶颈问题。通过计算和实验验证，对于Ⅳ个节点的网络，多维区间查询效率为O（logN）（m〉2）（m表示扇出）。由此可见，查询效率与维数d无关，查询效率不会随着维数d的增加而降低。最后建立基于扇出m的代价模型，并且计算出了最优的m值。 |
| Abstract_FL | 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(logm N)(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 reduce with the increase of dimension.It also proposed cost module based on m,and then calculated the optimal value of m. |
| Author | 刘京燕 陈世平 |
| AuthorAffiliation | 上海理工大学光电信息与计算机工程学院,上海200093 上海理工大学信息化办公室,上海200093 |
| AuthorAffiliation_xml | – name: 上海理工大学 光电信息与计算机工程学院,上海,200093%上海理工大学 信息化办公室,上海,200093 |
| Author_FL | Chen Shiping Liu Jingyan |
| Author_FL_xml | – sequence: 1 fullname: Liu Jingyan – sequence: 2 fullname: Chen Shiping |
| Author_xml | – sequence: 1 fullname: 刘京燕 陈世平 |
| BookMark | eNo9jz9Lw0Achm-oYFv9EuLgkvi73OWSAxcp_oOCS_dyl-Zqg161QSSbQhdBh4IiFKlQFCfpUkRb_TZNTr-FkYrTCy8P78tTQgXd1iFCqxhswhlfj-xWHGsbA2CLMO7aDmBmg2-Diwuo-N8volIcRwDUwRyKaGP2dm6er7ObUXZ1kT72zXScXk2-78bZw9PXaGj63dmkl47ezcul-eyZ6b0ZD9OP22zwmg26S2hBicM4XP7LMqptb9Uqu1Z1f2evslm1AgaORX0Q2BWMK8lCIFxhRwIllLgikAFpKM-XnAsPN2QogTEPB56nlFSCB5JyTspobT57JrQSulmP2qcdnR_WozhKkiT6VQUfXCdHV-ZocNDWzZNWDh93Wkeik9RZLu9giin5AcOCb08 |
| ClassificationCodes | TN915.02 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2016.08.051 |
| DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Cloud P2P network index framework for supporting multidimensional range query |
| DocumentTitle_FL | Cloud P2P network index framework for supporting multidimensional range query |
| EndPage | 2474 |
| ExternalDocumentID | jsjyyyj201608052 669521414 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目; 上海市教委科研创新重点项目; 上海市一流学科建设项目; 沪江基金资助项目 funderid: (61170277，61472256); (12ZZ137); (S1201YLXK); (A14006) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c602-480a15a69fb6e039f12b043435acbc3df78b99a71dbeb06671c77ffbfa9cb4993 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:51 EDT 2025 Wed Feb 14 10:17:24 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 8 |
| Keywords | m 叉平衡树 索引架构 多维区间查询 query ef-ficiency 对等网络 查询效率 m-ary balanced tree multidimensional range query cloud computing 云计算 peer-to-peer index framework |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c602-480a15a69fb6e039f12b043435acbc3df78b99a71dbeb06671c77ffbfa9cb4993 |
| Notes | 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 |
| PageCount | 5 |
| ParticipantIDs | wanfang_journals_jsjyyyj201608052 chongqing_primary_669521414 |
| PublicationCentury | 2000 |
| PublicationDate | 2016 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – year: 2016 text: 2016 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationYear | 2016 |
| Publisher | 上海理工大学 光电信息与计算机工程学院,上海,200093%上海理工大学 信息化办公室,上海,200093 |
| Publisher_xml | – name: 上海理工大学 光电信息与计算机工程学院,上海,200093%上海理工大学 信息化办公室,上海,200093 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 2.0476425 |
| Snippet | 针对用户在大规模云对等网络环境下多维区间查询问题，将基于m叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次化树结构，... TN915.02; 针对用户在大规模云对等网络环境下多维区间查询问题，将基于 m 叉平衡树的索引架构引入到云对等网络环境下，在该架构上实现集中式环境下支持多维数据索引的层次... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 2470 |
| SubjectTerms | m叉平衡树 云计算 多维区间查询 对等网络 查询效率 索引架构 |
| Title | 一种支持多维区间查询的云对等网络索引架构 |
| URI | http://lib.cqvip.com/qk/93231X/201608/669521414.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201608052 |
| Volume | 33 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate issn: 1001-3695 databaseCode: ABDBF dateStart: 20130901 customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn isFulltext: true dateEnd: 99991231 titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn omitProxy: true ssIdentifier: ssib025702191 providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1La9RAeKhbEC--xVofFTon2ZpM5glekt0sRdBThd6WJJu09LBV2x7ak0IvQj0UFKFIhaJ4kl6KaKv_prur_8JvHruNWmrtJXw7-d7fMN832XkgNC5aShBa0GrAM1KlssiqEGYOhRwrMsgpgUr1P7oPHvLJR_T-NJseqtwqrVpaWkwnspVD95WcJKrQBnHVu2T_I7IDptAAMMQXnhBheB4rxjimOJJ6sUIscCiwrOOYY0Vx2NCArEGdiGOGQ4pVqHGiCEdUt8CrCFoUVsK0AFUDhwzHUtOGRCMDiaRGRIiV5dPAkTKy6lgaIKqbV4azqhmAGnKGoxpWzHCOccQdYC9q61fDRlyMQ8MBAFBGo1ndmJFLjSbAUxocz7WECnj2O4sxSGIlnbKhUUQCHTtAAVOVxrIuU9wIAC5B-buH3ZBp-mjft6FWKQJcYTTxsLSkwrjL-BY8r4E6Dvkdowtz3gFdgVIzahgjuY6Hjo1lHf_LfitDaONlNJDhbAEvk9ohWpIaMV-QMGEntuFvjU2XsV4DdhBJa6d2NTM20KO1KSU_vbwu4C42LjsGQWkUkOVUR-2NL65sgp_0sJQcKK5MStYiJgYi9KJKbg7PdecN_37o-dzC3PLy8pxG8vSlG6fQMBFQSlbQcBjVo8ZBxQ8FcvkESKIPVzqYYevrEXgppek7GyFHD1Ia8wPBzAUQtnij8NIeYOL0PI3GnRF3jzJBn8wyO9-eeQL1ptn-1y6S9kypUp06j866KeZYaMeLC2hoZfYiOte_vmXMZfNL6N7-l2e9jy-7r7a7a8877zd6ezudtd2fb3a67z782N7qbazu7653tr_2Pr3ofV_v7b3t7Wx1vr3ubn7ubq5eRlONeKo2WXWXqVQz7ulR2Et8lnBVpDz3AlX4JPX0rnKWZGkWtAohU6US4bfSPNUL3_1MiKJIi0RlKYVJzBVUac-386tojLcC0iKtzMsTRhPhpYzlOQtInqXEB8IRNDrwRfOxPTOnycFhxKc-HUG3nXeabiRdaP4Z7WvHwBlFZzRsv4ZeR5XFp0v5DZgfLKY3XR_5BQZVxrM |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E4%B8%80%E7%A7%8D%E6%94%AF%E6%8C%81%E5%A4%9A%E7%BB%B4%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2%E7%9A%84%E4%BA%91%E5%AF%B9%E7%AD%89%E7%BD%91%E7%BB%9C%E7%B4%A2%E5%BC%95%E6%9E%B6%E6%9E%84&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E5%88%98%E4%BA%AC%E7%87%95&rft.au=%E9%99%88%E4%B8%96%E5%B9%B3&rft.date=2016&rft.pub=%E4%B8%8A%E6%B5%B7%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6+%E5%85%89%E7%94%B5%E4%BF%A1%E6%81%AF%E4%B8%8E%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%B7%A5%E7%A8%8B%E5%AD%A6%E9%99%A2%2C%E4%B8%8A%E6%B5%B7%2C200093%25%E4%B8%8A%E6%B5%B7%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6+%E4%BF%A1%E6%81%AF%E5%8C%96%E5%8A%9E%E5%85%AC%E5%AE%A4%2C%E4%B8%8A%E6%B5%B7%2C200093&rft.issn=1001-3695&rft.volume=33&rft.issue=8&rft.spage=2470&rft.epage=2474&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2016.08.051&rft.externalDocID=jsjyyyj201608052 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |