Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying
In highly concurrent field such as location based services, massive objects are moving concurrently. Due to continuously changing nature of their location, traditional indexes cannot provide the real-time response since query processing is frequently blocked by node-split or region propagation as th...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 126 |
|---|---|
| container_issue | |
| container_start_page | 114 |
| container_title | |
| container_volume | |
| creator | Kim, Myungkeun Eo, Sanghun Jang, Seokkyu Lee, Jaedong Bae, Haeyoung |
| description | In highly concurrent field such as location based services, massive objects are moving concurrently. Due to continuously changing nature of their location, traditional indexes cannot provide the real-time response since query processing is frequently blocked by node-split or region propagation as the locations of objects change. In this paper, the modified R-tree structure with lock-free querying for multi-dimension data, Rver-tree, is proposed. Basically, Rver-tree uses the new versioning technique. When updating data such as key update(region propagation) and index restructure(node-split), it never physically modify original data, rather creates new version for compensating data intactness. Due to data intactness, search operation can access data without any locking or latching by reading old version. In the performance evaluation, it is proven that search operation of Rver-tree is at least two times faster than a previous work. |
| doi_str_mv | 10.1007/11563952_11 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17265826</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17265826</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-6198ac139f185107fb2fd9cbd3d0476e1250601b0fb4ecfb1d2799b720be57b43</originalsourceid><addsrcrecordid>eNpNkD1PwzAYhM2XRCmd-ANeGBgC72sndjyi8lWpgIB2juzEbk3bJLJTof57UpWBW-6k53TDEXKFcIsA8g4xE1xlrEA8Ihc8S4EzyCU_JgMUiAnnqTohIyXzPWOKMclOyQA4sETJlJ-TUYzf0IujgDwdkPmDjX5RU11XdLJp13Zj6053vqlp42i3tPS1qbzztqKfySxYS7-6sC27bbD0x3dL-tbUiVk35crXC_qxtWHXh0ty5vQ62tGfD8n86XE2fkmm78-T8f00aRmqLhGocl0iVw7zDEE6w1ylSlPxClIpLLIMBKABZ1JbOoMVk0oZycDYTJqUD8n1YbfVsdRrF3Rd-li0wW902BUomchyJvrezaEXe1QvbChM06xigVDsfy3-_cp_AVrzZHs</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying</title><source>Springer Books</source><creator>Kim, Myungkeun ; Eo, Sanghun ; Jang, Seokkyu ; Lee, Jaedong ; Bae, Haeyoung</creator><contributor>Yang, Jun ; Fan, Wenfei ; Wu, Zhaohui</contributor><creatorcontrib>Kim, Myungkeun ; Eo, Sanghun ; Jang, Seokkyu ; Lee, Jaedong ; Bae, Haeyoung ; Yang, Jun ; Fan, Wenfei ; Wu, Zhaohui</creatorcontrib><description>In highly concurrent field such as location based services, massive objects are moving concurrently. Due to continuously changing nature of their location, traditional indexes cannot provide the real-time response since query processing is frequently blocked by node-split or region propagation as the locations of objects change. In this paper, the modified R-tree structure with lock-free querying for multi-dimension data, Rver-tree, is proposed. Basically, Rver-tree uses the new versioning technique. When updating data such as key update(region propagation) and index restructure(node-split), it never physically modify original data, rather creates new version for compensating data intactness. Due to data intactness, search operation can access data without any locking or latching by reading old version. In the performance evaluation, it is proven that search operation of Rver-tree is at least two times faster than a previous work.</description><edition>1ère éd</edition><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540292272</identifier><identifier>ISBN: 3540292276</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320873</identifier><identifier>EISBN: 9783540320876</identifier><identifier>DOI: 10.1007/11563952_11</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Candidate Object ; Child Node ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Parent Node ; Query Processing ; Software ; Versioned Node</subject><ispartof>Advances in Web-Age Information Management, 2005, p.114-126</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11563952_11$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11563952_11$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17265826$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yang, Jun</contributor><contributor>Fan, Wenfei</contributor><contributor>Wu, Zhaohui</contributor><creatorcontrib>Kim, Myungkeun</creatorcontrib><creatorcontrib>Eo, Sanghun</creatorcontrib><creatorcontrib>Jang, Seokkyu</creatorcontrib><creatorcontrib>Lee, Jaedong</creatorcontrib><creatorcontrib>Bae, Haeyoung</creatorcontrib><title>Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying</title><title>Advances in Web-Age Information Management</title><description>In highly concurrent field such as location based services, massive objects are moving concurrently. Due to continuously changing nature of their location, traditional indexes cannot provide the real-time response since query processing is frequently blocked by node-split or region propagation as the locations of objects change. In this paper, the modified R-tree structure with lock-free querying for multi-dimension data, Rver-tree, is proposed. Basically, Rver-tree uses the new versioning technique. When updating data such as key update(region propagation) and index restructure(node-split), it never physically modify original data, rather creates new version for compensating data intactness. Due to data intactness, search operation can access data without any locking or latching by reading old version. In the performance evaluation, it is proven that search operation of Rver-tree is at least two times faster than a previous work.</description><subject>Applied sciences</subject><subject>Candidate Object</subject><subject>Child Node</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Parent Node</subject><subject>Query Processing</subject><subject>Software</subject><subject>Versioned Node</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540292272</isbn><isbn>3540292276</isbn><isbn>3540320873</isbn><isbn>9783540320876</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkD1PwzAYhM2XRCmd-ANeGBgC72sndjyi8lWpgIB2juzEbk3bJLJTof57UpWBW-6k53TDEXKFcIsA8g4xE1xlrEA8Ihc8S4EzyCU_JgMUiAnnqTohIyXzPWOKMclOyQA4sETJlJ-TUYzf0IujgDwdkPmDjX5RU11XdLJp13Zj6053vqlp42i3tPS1qbzztqKfySxYS7-6sC27bbD0x3dL-tbUiVk35crXC_qxtWHXh0ty5vQ62tGfD8n86XE2fkmm78-T8f00aRmqLhGocl0iVw7zDEE6w1ylSlPxClIpLLIMBKABZ1JbOoMVk0oZycDYTJqUD8n1YbfVsdRrF3Rd-li0wW902BUomchyJvrezaEXe1QvbChM06xigVDsfy3-_cp_AVrzZHs</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Kim, Myungkeun</creator><creator>Eo, Sanghun</creator><creator>Jang, Seokkyu</creator><creator>Lee, Jaedong</creator><creator>Bae, Haeyoung</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying</title><author>Kim, Myungkeun ; Eo, Sanghun ; Jang, Seokkyu ; Lee, Jaedong ; Bae, Haeyoung</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-6198ac139f185107fb2fd9cbd3d0476e1250601b0fb4ecfb1d2799b720be57b43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Candidate Object</topic><topic>Child Node</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Parent Node</topic><topic>Query Processing</topic><topic>Software</topic><topic>Versioned Node</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Myungkeun</creatorcontrib><creatorcontrib>Eo, Sanghun</creatorcontrib><creatorcontrib>Jang, Seokkyu</creatorcontrib><creatorcontrib>Lee, Jaedong</creatorcontrib><creatorcontrib>Bae, Haeyoung</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kim, Myungkeun</au><au>Eo, Sanghun</au><au>Jang, Seokkyu</au><au>Lee, Jaedong</au><au>Bae, Haeyoung</au><au>Yang, Jun</au><au>Fan, Wenfei</au><au>Wu, Zhaohui</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying</atitle><btitle>Advances in Web-Age Information Management</btitle><date>2005</date><risdate>2005</risdate><spage>114</spage><epage>126</epage><pages>114-126</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540292272</isbn><isbn>3540292276</isbn><eisbn>3540320873</eisbn><eisbn>9783540320876</eisbn><abstract>In highly concurrent field such as location based services, massive objects are moving concurrently. Due to continuously changing nature of their location, traditional indexes cannot provide the real-time response since query processing is frequently blocked by node-split or region propagation as the locations of objects change. In this paper, the modified R-tree structure with lock-free querying for multi-dimension data, Rver-tree, is proposed. Basically, Rver-tree uses the new versioning technique. When updating data such as key update(region propagation) and index restructure(node-split), it never physically modify original data, rather creates new version for compensating data intactness. Due to data intactness, search operation can access data without any locking or latching by reading old version. In the performance evaluation, it is proven that search operation of Rver-tree is at least two times faster than a previous work.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11563952_11</doi><tpages>13</tpages><edition>1ère éd</edition></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advances in Web-Age Information Management, 2005, p.114-126 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17265826 |
| source | Springer Books |
| subjects | Applied sciences Candidate Object Child Node Computer science control theory systems Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Parent Node Query Processing Software Versioned Node |
| title | Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T09%3A23%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Design%20and%20Implementation%20of%20the%20Modified%20R-Tree%20Structure%20with%20Non-blocking%20Querying&rft.btitle=Advances%20in%20Web-Age%20Information%20Management&rft.au=Kim,%20Myungkeun&rft.date=2005&rft.spage=114&rft.epage=126&rft.pages=114-126&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540292272&rft.isbn_list=3540292276&rft_id=info:doi/10.1007/11563952_11&rft_dat=%3Cpascalfrancis_sprin%3E17265826%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320873&rft.eisbn_list=9783540320876&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |