The Optimization of In-Memory Space Partitioning Trees for Cache Utilization
In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered...
Gespeichert in:
| Veröffentlicht in: | IEICE Transactions on Information and Systems 2008/02/01, Vol.E91.D(2), pp.243-250 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 250 |
|---|---|
| container_issue | 2 |
| container_start_page | 243 |
| container_title | IEICE Transactions on Information and Systems |
| container_volume | E91.D |
| creator | YEO, Myung Ho MIN, Young Soo BOK, Kyoung Soo YOO, Jae Soo |
| description | In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures. |
| doi_str_mv | 10.1093/ietisy/e91-d.2.243 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_849449303</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>849449303</sourcerecordid><originalsourceid>FETCH-LOGICAL-c538t-b571f640a9831e22dac8bd92a0bbc05e7842b5fdd9493f82a4f1914aff06bd263</originalsourceid><addsrcrecordid>eNo9kL1u2zAURomgBeomfYFOWoJMcvgriWPgJm0KFylQeyauqEubhiypJD04T18adj3dged8BA4hXxmdM6rFo8fk4_ERNSu7OZ9zKW7IjNVSlUxU7AOZUc2qslGCfyKfY9xRyhrO1IwsV1ss3qbk9_4dkh-HYnTF61D-wv0YjsWfCSwWvyEkf3r0w6ZYBcRYuDEUC7BZXiffX9w78tFBH_HL5d6S9cvzavGjXL59f108LUurRJPKVtXMVZKCbgRDzjuwTdtpDrRtLVVYN5K3ynWdllq4hoN0TDMJztGq7XglbsnDeXcK498DxmT2PlrsexhwPETTSC2zSkUm-Zm0YYwxoDNT8HsIR8OoOZUz53ImlzOd4SaXy9L9ZR6ihd4FGKyPV5NTxupaqcz9PHO7mGCDV-BUy_ZoUhajH5x5zuPf8vj_mz-5QnYLweAg_gFgy4xC</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>849449303</pqid></control><display><type>article</type><title>The Optimization of In-Memory Space Partitioning Trees for Cache Utilization</title><source>J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>YEO, Myung Ho ; MIN, Young Soo ; BOK, Kyoung Soo ; YOO, Jae Soo</creator><creatorcontrib>YEO, Myung Ho ; MIN, Young Soo ; BOK, Kyoung Soo ; YOO, Jae Soo</creatorcontrib><description>In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.</description><identifier>ISSN: 0916-8532</identifier><identifier>ISSN: 1745-1361</identifier><identifier>EISSN: 1745-1361</identifier><identifier>DOI: 10.1093/ietisy/e91-d.2.243</identifier><language>eng</language><publisher>Oxford: The Institute of Electronics, Information and Communication Engineers</publisher><subject>Applied sciences ; cache conscious ; Computer science; control theory; systems ; Electronics ; Exact sciences and technology ; in-memory ; index structure ; Indexing ; Information systems. Data bases ; Information theory ; Information, signal and communications theory ; Insertion ; Integrated circuits ; Integrated circuits by function (including memories and processors) ; KDB-tree ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Optimization ; Partitioning ; Rectangles ; Redundant ; Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices ; Software ; Telecommunications and information theory ; Trees ; Utilization</subject><ispartof>IEICE Transactions on Information and Systems, 2008/02/01, Vol.E91.D(2), pp.243-250</ispartof><rights>2008 The Institute of Electronics, Information and Communication Engineers</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,4010,27900,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20117755$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>YEO, Myung Ho</creatorcontrib><creatorcontrib>MIN, Young Soo</creatorcontrib><creatorcontrib>BOK, Kyoung Soo</creatorcontrib><creatorcontrib>YOO, Jae Soo</creatorcontrib><title>The Optimization of In-Memory Space Partitioning Trees for Cache Utilization</title><title>IEICE Transactions on Information and Systems</title><addtitle>IEICE Trans. Inf. & Syst.</addtitle><description>In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.</description><subject>Applied sciences</subject><subject>cache conscious</subject><subject>Computer science; control theory; systems</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>in-memory</subject><subject>index structure</subject><subject>Indexing</subject><subject>Information systems. Data bases</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Insertion</subject><subject>Integrated circuits</subject><subject>Integrated circuits by function (including memories and processors)</subject><subject>KDB-tree</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Optimization</subject><subject>Partitioning</subject><subject>Rectangles</subject><subject>Redundant</subject><subject>Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</subject><subject>Software</subject><subject>Telecommunications and information theory</subject><subject>Trees</subject><subject>Utilization</subject><issn>0916-8532</issn><issn>1745-1361</issn><issn>1745-1361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNo9kL1u2zAURomgBeomfYFOWoJMcvgriWPgJm0KFylQeyauqEubhiypJD04T18adj3dged8BA4hXxmdM6rFo8fk4_ERNSu7OZ9zKW7IjNVSlUxU7AOZUc2qslGCfyKfY9xRyhrO1IwsV1ss3qbk9_4dkh-HYnTF61D-wv0YjsWfCSwWvyEkf3r0w6ZYBcRYuDEUC7BZXiffX9w78tFBH_HL5d6S9cvzavGjXL59f108LUurRJPKVtXMVZKCbgRDzjuwTdtpDrRtLVVYN5K3ynWdllq4hoN0TDMJztGq7XglbsnDeXcK498DxmT2PlrsexhwPETTSC2zSkUm-Zm0YYwxoDNT8HsIR8OoOZUz53ImlzOd4SaXy9L9ZR6ihd4FGKyPV5NTxupaqcz9PHO7mGCDV-BUy_ZoUhajH5x5zuPf8vj_mz-5QnYLweAg_gFgy4xC</recordid><startdate>2008</startdate><enddate>2008</enddate><creator>YEO, Myung Ho</creator><creator>MIN, Young Soo</creator><creator>BOK, Kyoung Soo</creator><creator>YOO, Jae Soo</creator><general>The Institute of Electronics, Information and Communication Engineers</general><general>Oxford University Press</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2008</creationdate><title>The Optimization of In-Memory Space Partitioning Trees for Cache Utilization</title><author>YEO, Myung Ho ; MIN, Young Soo ; BOK, Kyoung Soo ; YOO, Jae Soo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c538t-b571f640a9831e22dac8bd92a0bbc05e7842b5fdd9493f82a4f1914aff06bd263</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Applied sciences</topic><topic>cache conscious</topic><topic>Computer science; control theory; systems</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>in-memory</topic><topic>index structure</topic><topic>Indexing</topic><topic>Information systems. Data bases</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Insertion</topic><topic>Integrated circuits</topic><topic>Integrated circuits by function (including memories and processors)</topic><topic>KDB-tree</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Optimization</topic><topic>Partitioning</topic><topic>Rectangles</topic><topic>Redundant</topic><topic>Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices</topic><topic>Software</topic><topic>Telecommunications and information theory</topic><topic>Trees</topic><topic>Utilization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>YEO, Myung Ho</creatorcontrib><creatorcontrib>MIN, Young Soo</creatorcontrib><creatorcontrib>BOK, Kyoung Soo</creatorcontrib><creatorcontrib>YOO, Jae Soo</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Information and Systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YEO, Myung Ho</au><au>MIN, Young Soo</au><au>BOK, Kyoung Soo</au><au>YOO, Jae Soo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Optimization of In-Memory Space Partitioning Trees for Cache Utilization</atitle><jtitle>IEICE Transactions on Information and Systems</jtitle><addtitle>IEICE Trans. Inf. & Syst.</addtitle><date>2008</date><risdate>2008</risdate><volume>E91.D</volume><issue>2</issue><spage>243</spage><epage>250</epage><pages>243-250</pages><issn>0916-8532</issn><issn>1745-1361</issn><eissn>1745-1361</eissn><abstract>In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.</abstract><cop>Oxford</cop><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1093/ietisy/e91-d.2.243</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0916-8532 |
| ispartof | IEICE Transactions on Information and Systems, 2008/02/01, Vol.E91.D(2), pp.243-250 |
| issn | 0916-8532 1745-1361 1745-1361 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_849449303 |
| source | J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Applied sciences cache conscious Computer science control theory systems Electronics Exact sciences and technology in-memory index structure Indexing Information systems. Data bases Information theory Information, signal and communications theory Insertion Integrated circuits Integrated circuits by function (including memories and processors) KDB-tree Memory and file management (including protection and security) Memory organisation. Data processing Optimization Partitioning Rectangles Redundant Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Software Telecommunications and information theory Trees Utilization |
| title | The Optimization of In-Memory Space Partitioning Trees for Cache Utilization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T22%3A18%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Optimization%20of%20In-Memory%20Space%20Partitioning%20Trees%20for%20Cache%20Utilization&rft.jtitle=IEICE%20Transactions%20on%20Information%20and%20Systems&rft.au=YEO,%20Myung%20Ho&rft.date=2008&rft.volume=E91.D&rft.issue=2&rft.spage=243&rft.epage=250&rft.pages=243-250&rft.issn=0916-8532&rft.eissn=1745-1361&rft_id=info:doi/10.1093/ietisy/e91-d.2.243&rft_dat=%3Cproquest_cross%3E849449303%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=849449303&rft_id=info:pmid/&rfr_iscdi=true |