Concurrent search and insertion in K-Dimensional Height Balanced Trees
An algorithm is proposed that enables a number of concurrent search and insert operations to be performed on K-Dimensional Height Balanced Trees (kHB-trees) (V.K. Vaishnavi, 1984). The algorithm proposed by C.S. Ellis (1980) for AVL trees is not applicable for kHB-trees because of the difference in...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 887 |
|---|---|
| container_issue | |
| container_start_page | 883 |
| container_title | |
| container_volume | |
| creator | Varshneya, A. Madan, B.B. Balakrishnan, M. |
| description | An algorithm is proposed that enables a number of concurrent search and insert operations to be performed on K-Dimensional Height Balanced Trees (kHB-trees) (V.K. Vaishnavi, 1984). The algorithm proposed by C.S. Ellis (1980) for AVL trees is not applicable for kHB-trees because of the difference in types of rotations and the way the balance factors are updated in kHB-trees. For rebalancing, the kHB-tree needs to be traversed from the leaf towards the root node, making Ellis's algorithm inapplicable. By introducing locks on links and avoiding work which may need to be undone, the proposed algorithm allows greater concurrency than the previously proposed algorithms even for single dimensional AVL trees.< > |
| doi_str_mv | 10.1109/IPPS.1994.288202 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_288202</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>288202</ieee_id><sourcerecordid>288202</sourcerecordid><originalsourceid>FETCH-LOGICAL-i87t-73090f067ebb4adfc1236dc0094f65ef102cf24811e6cd5090547542344b18a83</originalsourceid><addsrcrecordid>eNotT0tLAzEYDIig1t7FU_7Arl-emz3qam2xYMG9l2z2i41sU0nWg__eQJ3LPBgGhpA7BjVj0D5sdruPmrWtrLkxHPgFuQHDjFYauL4iy5y_oECpEolrsupO0f2khHGmGW1yB2rjSEPMmOZwikXRt-o5HDHmYu1E1xg-DzN9spONDkfaJ8R8Sy69nTIu_3lB-tVL362r7fvrpnvcVsE0c9UIaMGDbnAYpB29Y1zo0QG00muFngF3nkvDGGo3qlJWslGSCykHZqwRC3J_ng2IuP9O4WjT7_58VPwB5WpIFg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Concurrent search and insertion in K-Dimensional Height Balanced Trees</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Varshneya, A. ; Madan, B.B. ; Balakrishnan, M.</creator><creatorcontrib>Varshneya, A. ; Madan, B.B. ; Balakrishnan, M.</creatorcontrib><description>An algorithm is proposed that enables a number of concurrent search and insert operations to be performed on K-Dimensional Height Balanced Trees (kHB-trees) (V.K. Vaishnavi, 1984). The algorithm proposed by C.S. Ellis (1980) for AVL trees is not applicable for kHB-trees because of the difference in types of rotations and the way the balance factors are updated in kHB-trees. For rebalancing, the kHB-tree needs to be traversed from the leaf towards the root node, making Ellis's algorithm inapplicable. By introducing locks on links and avoiding work which may need to be undone, the proposed algorithm allows greater concurrency than the previously proposed algorithms even for single dimensional AVL trees.< ></description><identifier>ISBN: 0818656026</identifier><identifier>ISBN: 9780818656026</identifier><identifier>DOI: 10.1109/IPPS.1994.288202</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Algorithm design and analysis ; Binary search trees ; Binary trees ; Computer science ; Concurrent computing ; Data structures ; Flexible structures ; Multidimensional systems ; Tree data structures</subject><ispartof>Proceedings of 8th International Parallel Processing Symposium, 1994, p.883-887</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/288202$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/288202$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Varshneya, A.</creatorcontrib><creatorcontrib>Madan, B.B.</creatorcontrib><creatorcontrib>Balakrishnan, M.</creatorcontrib><title>Concurrent search and insertion in K-Dimensional Height Balanced Trees</title><title>Proceedings of 8th International Parallel Processing Symposium</title><addtitle>IPPS</addtitle><description>An algorithm is proposed that enables a number of concurrent search and insert operations to be performed on K-Dimensional Height Balanced Trees (kHB-trees) (V.K. Vaishnavi, 1984). The algorithm proposed by C.S. Ellis (1980) for AVL trees is not applicable for kHB-trees because of the difference in types of rotations and the way the balance factors are updated in kHB-trees. For rebalancing, the kHB-tree needs to be traversed from the leaf towards the root node, making Ellis's algorithm inapplicable. By introducing locks on links and avoiding work which may need to be undone, the proposed algorithm allows greater concurrency than the previously proposed algorithms even for single dimensional AVL trees.< ></description><subject>Algorithm design and analysis</subject><subject>Binary search trees</subject><subject>Binary trees</subject><subject>Computer science</subject><subject>Concurrent computing</subject><subject>Data structures</subject><subject>Flexible structures</subject><subject>Multidimensional systems</subject><subject>Tree data structures</subject><isbn>0818656026</isbn><isbn>9780818656026</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1994</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT0tLAzEYDIig1t7FU_7Arl-emz3qam2xYMG9l2z2i41sU0nWg__eQJ3LPBgGhpA7BjVj0D5sdruPmrWtrLkxHPgFuQHDjFYauL4iy5y_oECpEolrsupO0f2khHGmGW1yB2rjSEPMmOZwikXRt-o5HDHmYu1E1xg-DzN9spONDkfaJ8R8Sy69nTIu_3lB-tVL362r7fvrpnvcVsE0c9UIaMGDbnAYpB29Y1zo0QG00muFngF3nkvDGGo3qlJWslGSCykHZqwRC3J_ng2IuP9O4WjT7_58VPwB5WpIFg</recordid><startdate>1994</startdate><enddate>1994</enddate><creator>Varshneya, A.</creator><creator>Madan, B.B.</creator><creator>Balakrishnan, M.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1994</creationdate><title>Concurrent search and insertion in K-Dimensional Height Balanced Trees</title><author>Varshneya, A. ; Madan, B.B. ; Balakrishnan, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i87t-73090f067ebb4adfc1236dc0094f65ef102cf24811e6cd5090547542344b18a83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1994</creationdate><topic>Algorithm design and analysis</topic><topic>Binary search trees</topic><topic>Binary trees</topic><topic>Computer science</topic><topic>Concurrent computing</topic><topic>Data structures</topic><topic>Flexible structures</topic><topic>Multidimensional systems</topic><topic>Tree data structures</topic><toplevel>online_resources</toplevel><creatorcontrib>Varshneya, A.</creatorcontrib><creatorcontrib>Madan, B.B.</creatorcontrib><creatorcontrib>Balakrishnan, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Varshneya, A.</au><au>Madan, B.B.</au><au>Balakrishnan, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Concurrent search and insertion in K-Dimensional Height Balanced Trees</atitle><btitle>Proceedings of 8th International Parallel Processing Symposium</btitle><stitle>IPPS</stitle><date>1994</date><risdate>1994</risdate><spage>883</spage><epage>887</epage><pages>883-887</pages><isbn>0818656026</isbn><isbn>9780818656026</isbn><abstract>An algorithm is proposed that enables a number of concurrent search and insert operations to be performed on K-Dimensional Height Balanced Trees (kHB-trees) (V.K. Vaishnavi, 1984). The algorithm proposed by C.S. Ellis (1980) for AVL trees is not applicable for kHB-trees because of the difference in types of rotations and the way the balance factors are updated in kHB-trees. For rebalancing, the kHB-tree needs to be traversed from the leaf towards the root node, making Ellis's algorithm inapplicable. By introducing locks on links and avoiding work which may need to be undone, the proposed algorithm allows greater concurrency than the previously proposed algorithms even for single dimensional AVL trees.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/IPPS.1994.288202</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0818656026 |
| ispartof | Proceedings of 8th International Parallel Processing Symposium, 1994, p.883-887 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_288202 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Binary search trees Binary trees Computer science Concurrent computing Data structures Flexible structures Multidimensional systems Tree data structures |
| title | Concurrent search and insertion in K-Dimensional Height Balanced Trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T22%3A30%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Concurrent%20search%20and%20insertion%20in%20K-Dimensional%20Height%20Balanced%20Trees&rft.btitle=Proceedings%20of%208th%20International%20Parallel%20Processing%20Symposium&rft.au=Varshneya,%20A.&rft.date=1994&rft.spage=883&rft.epage=887&rft.pages=883-887&rft.isbn=0818656026&rft.isbn_list=9780818656026&rft_id=info:doi/10.1109/IPPS.1994.288202&rft_dat=%3Cieee_6IE%3E288202%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=288202&rfr_iscdi=true |