基于节点分裂优化的R-树索引结构
针对R-树索引空间查询效率低下的问题，提出一种基于节点分裂优化的R-树索引结构：SR-树索引。SR-树索引在节点分裂过程中，通过增加叶子节点的空间数据聚集性来减少叶子节点最小外接矩形的覆盖面积。为了有效降低磁盘读写消耗，SR-树节点在写入索引时，首先将索引树在内存中建好，然后在文件中写入树信息，最后通过递归的方式写入节点。实验结果表明，与R-树索引相比，SR-树索引可以在减少最小外接矩形重叠面积的同时，有效降低查询响应时间，从而达到提高查询效率的目的。...
Saved in:
| Published in | 计算机应用研究 Vol. 33; no. 12; pp. 3530 - 3534 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
上海海事大学 信息工程学院，上海201306
2016
同济大学 电子与信息工程学院，上海201804 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2016.12.003 |
Cover
| Abstract | 针对R-树索引空间查询效率低下的问题，提出一种基于节点分裂优化的R-树索引结构：SR-树索引。SR-树索引在节点分裂过程中，通过增加叶子节点的空间数据聚集性来减少叶子节点最小外接矩形的覆盖面积。为了有效降低磁盘读写消耗，SR-树节点在写入索引时，首先将索引树在内存中建好，然后在文件中写入树信息，最后通过递归的方式写入节点。实验结果表明，与R-树索引相比，SR-树索引可以在减少最小外接矩形重叠面积的同时，有效降低查询响应时间，从而达到提高查询效率的目的。 |
|---|---|
| AbstractList | TP311.12; 针对R-树索引空间查询效率低下的问题，提出一种基于节点分裂优化的R-树索引结构：SR-树索引。SR-树索引在节点分裂过程中，通过增加叶子节点的空间数据聚集性来减少叶子节点最小外接矩形的覆盖面积。为了有效降低磁盘读写消耗，SR-树节点在写入索引时，首先将索引树在内存中建好，然后在文件中写入树信息，最后通过递归的方式写入节点。实验结果表明，与R-树索引相比，SR-树索引可以在减少最小外接矩形重叠面积的同时，有效降低查询响应时间，从而达到提高查询效率的目的。 针对R-树索引空间查询效率低下的问题，提出一种基于节点分裂优化的R-树索引结构：SR-树索引。SR-树索引在节点分裂过程中，通过增加叶子节点的空间数据聚集性来减少叶子节点最小外接矩形的覆盖面积。为了有效降低磁盘读写消耗，SR-树节点在写入索引时，首先将索引树在内存中建好，然后在文件中写入树信息，最后通过递归的方式写入节点。实验结果表明，与R-树索引相比，SR-树索引可以在减少最小外接矩形重叠面积的同时，有效降低查询响应时间，从而达到提高查询效率的目的。 |
| Abstract_FL | Aiming at the problem of low spatial query efficiency in R-tree index,this paper presented SR-tree,an R-tree variant index structure that was based on node splitting optimization.During the process of node splitting,SR-tree improved spatial data aggregation of leaf nodes in order to reduce the overlapping area of minimum bounding rectangle (MBR)in leaf nodes.For the sake of decreasing disk input and output consumption,the nodes of SR-tree were written to the index as fol-lows.First,index tree was built in the memory beforehand.Second,the information of tree was written into files.At last,the nodes were written recursively into the tree.The experiments demonstrate that SR-tree can reduce MBR overlapping areas and can decrease query response time,which in turn achieves the purpose of improving query efficiency. |
| Author | 徐明 |
| AuthorAffiliation | 上海海事大学信息工程学院,上海201306 同济大学电子与信息工程学院,上海201804 |
| AuthorAffiliation_xml | – name: 上海海事大学 信息工程学院，上海201306; 同济大学 电子与信息工程学院，上海201804 |
| Author_FL | Xu Ming |
| Author_FL_xml | – sequence: 1 fullname: Xu Ming |
| Author_xml | – sequence: 1 fullname: 徐明 |
| BookMark | eNo9j8tKw0AYhWdRwbb6EuLChYn_XDLJLKV4g4Ig3YfJJKkJOtEMItmWIlJEEFHEhYq-ghtrH6dp-hhGKq4OHD7O4Wuhhs50hNA6BpsKLrZSOzFG2xgAW5QLxyaAuY2JDUAbqPnfL6OWMSkAI1hAE22Wr-Pp-HY-GlSDr_L6av4xmE6eypvH6nl4ZM3e7qrP93LyUH3fz16GK2gplicmWv3LNurt7vQ6-1b3cO-gs921FAdqYTeKhEtD4CpmAAFzPDekhMSeCqjEIlCMEwEel8pzA6riQEmiHEU8HBKHYdpGG4vZS6ljqft-ml3kuj70U5MWRZH-qmFSi9Xo2gJVx5nunyc1fJYnpzIvfO4CZww8l_4Ah1NhRQ |
| ClassificationCodes | TP311.12 |
| 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.12.003 |
| 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 | R-tree index structure based on node splitting optimization |
| DocumentTitle_FL | R-tree index structure based on node splitting optimization |
| EndPage | 3534 |
| ExternalDocumentID | jsjyyyj201612003 670644087 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目; 上海市教委科研创新资助项目; 中国博士后科学基金资助项目 funderid: (61202370); (14YZ110); (2014M561512) |
| 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-c603-17ee973d06cf400b4587d322f8cb3a19bc4629086ac87b3cfbca2c5c281d25413 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:51 EDT 2025 Wed Feb 14 10:07:42 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 12 |
| Keywords | 重叠面积 R-tree 最小外接矩形 minimum bounding rectangle (MBR) R-树 节点分裂 overlapping area 查询效率 node splitting query efficiency |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c603-17ee973d06cf400b4587d322f8cb3a19bc4629086ac87b3cfbca2c5c281d25413 |
| Notes | Aiming at the problem of low spatial query efficiency in R-tree index, this paper presented SR-tree, an R-tree variant index structure that was based on node splitting optimization. During the process of node splitting, SR-tree improved spatial data aggregation of leaf nodes in order to reduce the overlapping area of minimum bounding rectangle （MBR） in leaf nodes. For the sake of decreasing disk input and output consumption, the nodes of SR-tree were written to the index as follows. First, index tree was built in the memory beforehand. Second, the information of tree was written into files. At last, the nodes were written recursively into the tree. The experiments demonstrate that SR-tree can reduce MBR overlapping areas and can decrease query response time, which in turn achieves the purpose of improving query efficiency. 51-1196/TP R-tree; query efficiency; node splitting; minimum bounding rectangle （MBR） ; overlapping area Xu Ming1,2（ 1. College of Information Engineering, Shanghai Maritime University, Shangh |
| PageCount | 5 |
| ParticipantIDs | wanfang_journals_jsjyyyj201612003 chongqing_primary_670644087 |
| 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 | 上海海事大学 信息工程学院，上海201306 同济大学 电子与信息工程学院，上海201804 |
| Publisher_xml | – name: 同济大学 电子与信息工程学院，上海201804 – name: 上海海事大学 信息工程学院，上海201306 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 2.0449865 |
| Snippet | 针对R-树索引空间查询效率低下的问题，提出一种基于节点分裂优化的R-树索引结构：SR-树索引。SR-树索引在节点分裂过程中，通过增加叶子节点的空间数据聚集性来减少叶子节点... TP311.12; 针对R-树索引空间查询效率低下的问题，提出一种基于节点分裂优化的R-树索引结构：SR-树索引。SR-树索引在节点分裂过程中，通过增加叶子节点的空间数据聚集性来减... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 3530 |
| SubjectTerms | R-树 最小外接矩形 查询效率 节点分裂 重叠面积 |
| Title | 基于节点分裂优化的R-树索引结构 |
| URI | http://lib.cqvip.com/qk/93231X/201612/670644087.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201612003 |
| 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/eLvHCXMwnV3NaxNBFB9qCuLFb7FWJULnVLZu5nuOu-mGIuihROgt7G53W3JI1aaH9BiKiIggoogHFf0XvFj75zRN_wzfm92kixapXoaXmd98vsl7b2Zn3hCyYLNM-lwnntLW9wSLY8_6KfNiJXN015IbiReFHz5SK4_FgzW5NnOOVE4t7fSTpXT31Hsl_8NViAO-4i3Zf-DstFCIABr4CyFwGMIz8ZhGktoWDQMaCQxNRCNDDRCMRhrD0CLGQKTCpIC7JAA3qTUuCQiFYAu5xOKqRyNFA5_aBkaGggYMYYiXLiakliPGRrR4dW1i2rryIxq4jEBY7WBN1zyJoRWuIijTOIxfxgSWhtMNQoeF3L7LDQ2PqhsTxY1JN4lcN1xvARhCJl0hiuEIsbAA6tOOWKaBWnRpLddMBWY0DVquRmiF6x80rcyGaBpZaq0bgxaOAYzWH7Uy_CqrKsIdj49xVTzqOZH-hRuOySxnFVnOZfnFKJv8FKfpHG6VdToH61ia1oGnBpXbafb5ia6dnoDsbncHg0EXQY3CXe0swx2lGpkNwuWwdWLSggVYdXHI0HvQyRIS_f-riszGRwlBCU1ltmxwLd0LB4V1IiCx8NBRtvM8WSg7cf9vXUDXI5tbvY2nYFC5-229PO5tVEyx9mVysVxD1YPiD3GFzOxuXiWXJu-T1Et1dY14o8_7h_uvj18Ox8MfoxfPj78NDw8-jF69H3_cq696R1_ejL9_HR28G_98e_Rp7zppt6J2c8UrnwfxUoUHKnWWWc3XfZXmoIgSIY1eB_WUmzThccMmqVDMwoo9To1OeJonacxSmTJYoTEJttsNUutt9bKbpJ4bkYBdrUUqGSi0LG6gHoul4bphDVdzZH7a-c6TwgtMR2mw5oVv9By5Vw5Hp5QN253f2XvrDJh5cgHpYn_vNqn1n-1kd8Di7Sd3y0nxC8lze8s |
| 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=%E5%9F%BA%E4%BA%8E%E8%8A%82%E7%82%B9%E5%88%86%E8%A3%82%E4%BC%98%E5%8C%96%E7%9A%84+R-%E6%A0%91%E7%B4%A2%E5%BC%95%E7%BB%93%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%BE%90%E6%98%8E&rft.date=2016&rft.pub=%E4%B8%8A%E6%B5%B7%E6%B5%B7%E4%BA%8B%E5%A4%A7%E5%AD%A6+%E4%BF%A1%E6%81%AF%E5%B7%A5%E7%A8%8B%E5%AD%A6%E9%99%A2%EF%BC%8C%E4%B8%8A%E6%B5%B7201306&rft.issn=1001-3695&rft.volume=33&rft.issue=12&rft.spage=3530&rft.epage=3534&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2016.12.003&rft.externalDocID=jsjyyyj201612003 |
| 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 |