Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It is based on skip trees, which are randomised balanced search trees equivalent to skip lists and designed to provide improved concur...
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 | 1886 |
|---|---|
| container_issue | |
| container_start_page | 1881 |
| container_title | |
| container_volume | |
| creator | Beltran, Alejandra Gonzalez Sage, Paul Milligan, Peter |
| description | Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It is based on skip trees, which are randomised balanced search trees equivalent to skip lists and designed to provide improved concurrency. Skip tree graphs constitute an extension of skip graphs enhancing their performance in both, exact-match and range queries. Moreover, skip tree graph maintains the underlying balanced tree structures using randomization and local operations, which provides a greater degree of concurrency and scalability. |
| doi_str_mv | 10.1109/ICC.2007.313 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4288984</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4288984</ieee_id><sourcerecordid>4288984</sourcerecordid><originalsourceid>FETCH-LOGICAL-i241t-a90420fad8df848f4775bddad3dce97cbdde3850c93c87720441677881a5be083</originalsourceid><addsrcrecordid>eNotjEtPAjEUhRsfiYjs3LnpHyje9rb01p2OiiTER8A1KdM7YQQZ0hlj_PdicPWdk-_kCHGpYag1hOtJUQwNgB-ixiPR0wFJaSI8FoPgSVtjLaBDONk750DhCPyZOG_bDwBnAuqeeJut652cZ2Y5znG3upFR3tdtl-vlV8dJxm2Sd3ETt-W-zDjmcnVYV02Wr8xZdY36o3zm7rvJ6_ZCnFZx0_Lgn33x_vgwL57U9GU8KW6nqjZWdyoGsAaqmChVZKmy3rtlSjFhKjn4cp8ZyUEZsCTvDVirR94T6eiWDIR9cXX4rZl5scv1Z8w_C2uIAln8BZzgTyA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Beltran, Alejandra Gonzalez ; Sage, Paul ; Milligan, Peter</creator><creatorcontrib>Beltran, Alejandra Gonzalez ; Sage, Paul ; Milligan, Peter</creatorcontrib><description>Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It is based on skip trees, which are randomised balanced search trees equivalent to skip lists and designed to provide improved concurrency. Skip tree graphs constitute an extension of skip graphs enhancing their performance in both, exact-match and range queries. Moreover, skip tree graph maintains the underlying balanced tree structures using randomization and local operations, which provides a greater degree of concurrency and scalability.</description><identifier>ISSN: 1550-3607</identifier><identifier>ISBN: 9781424403530</identifier><identifier>ISBN: 1424403537</identifier><identifier>EISSN: 1938-1883</identifier><identifier>DOI: 10.1109/ICC.2007.313</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communications Society ; Computer science ; Concurrent computing ; Data structures ; Dictionaries ; Peer to peer computing ; Routing ; Scalability ; Tree data structures ; Tree graphs</subject><ispartof>2007 IEEE International Conference on Communications, 2007, p.1881-1886</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/4288984$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4288984$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Beltran, Alejandra Gonzalez</creatorcontrib><creatorcontrib>Sage, Paul</creatorcontrib><creatorcontrib>Milligan, Peter</creatorcontrib><title>Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks</title><title>2007 IEEE International Conference on Communications</title><addtitle>ICC</addtitle><description>Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It is based on skip trees, which are randomised balanced search trees equivalent to skip lists and designed to provide improved concurrency. Skip tree graphs constitute an extension of skip graphs enhancing their performance in both, exact-match and range queries. Moreover, skip tree graph maintains the underlying balanced tree structures using randomization and local operations, which provides a greater degree of concurrency and scalability.</description><subject>Communications Society</subject><subject>Computer science</subject><subject>Concurrent computing</subject><subject>Data structures</subject><subject>Dictionaries</subject><subject>Peer to peer computing</subject><subject>Routing</subject><subject>Scalability</subject><subject>Tree data structures</subject><subject>Tree graphs</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>9781424403530</isbn><isbn>1424403537</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjEtPAjEUhRsfiYjs3LnpHyje9rb01p2OiiTER8A1KdM7YQQZ0hlj_PdicPWdk-_kCHGpYag1hOtJUQwNgB-ixiPR0wFJaSI8FoPgSVtjLaBDONk750DhCPyZOG_bDwBnAuqeeJut652cZ2Y5znG3upFR3tdtl-vlV8dJxm2Sd3ETt-W-zDjmcnVYV02Wr8xZdY36o3zm7rvJ6_ZCnFZx0_Lgn33x_vgwL57U9GU8KW6nqjZWdyoGsAaqmChVZKmy3rtlSjFhKjn4cp8ZyUEZsCTvDVirR94T6eiWDIR9cXX4rZl5scv1Z8w_C2uIAln8BZzgTyA</recordid><startdate>200706</startdate><enddate>200706</enddate><creator>Beltran, Alejandra Gonzalez</creator><creator>Sage, Paul</creator><creator>Milligan, Peter</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200706</creationdate><title>Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks</title><author>Beltran, Alejandra Gonzalez ; Sage, Paul ; Milligan, Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i241t-a90420fad8df848f4775bddad3dce97cbdde3850c93c87720441677881a5be083</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Communications Society</topic><topic>Computer science</topic><topic>Concurrent computing</topic><topic>Data structures</topic><topic>Dictionaries</topic><topic>Peer to peer computing</topic><topic>Routing</topic><topic>Scalability</topic><topic>Tree data structures</topic><topic>Tree graphs</topic><toplevel>online_resources</toplevel><creatorcontrib>Beltran, Alejandra Gonzalez</creatorcontrib><creatorcontrib>Sage, Paul</creatorcontrib><creatorcontrib>Milligan, Peter</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Beltran, Alejandra Gonzalez</au><au>Sage, Paul</au><au>Milligan, Peter</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks</atitle><btitle>2007 IEEE International Conference on Communications</btitle><stitle>ICC</stitle><date>2007-06</date><risdate>2007</risdate><spage>1881</spage><epage>1886</epage><pages>1881-1886</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><isbn>9781424403530</isbn><isbn>1424403537</isbn><abstract>Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It is based on skip trees, which are randomised balanced search trees equivalent to skip lists and designed to provide improved concurrency. Skip tree graphs constitute an extension of skip graphs enhancing their performance in both, exact-match and range queries. Moreover, skip tree graph maintains the underlying balanced tree structures using randomization and local operations, which provides a greater degree of concurrency and scalability.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2007.313</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1550-3607 |
| ispartof | 2007 IEEE International Conference on Communications, 2007, p.1881-1886 |
| issn | 1550-3607 1938-1883 |
| language | eng |
| recordid | cdi_ieee_primary_4288984 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Communications Society Computer science Concurrent computing Data structures Dictionaries Peer to peer computing Routing Scalability Tree data structures Tree graphs |
| title | Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T19%3A07%3A21IST&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=Skip%20Tree%20Graph:%20a%20Distributed%20and%20Balanced%20Search%20Tree%20for%20Peer-to-Peer%20Networks&rft.btitle=2007%20IEEE%20International%20Conference%20on%20Communications&rft.au=Beltran,%20Alejandra%20Gonzalez&rft.date=2007-06&rft.spage=1881&rft.epage=1886&rft.pages=1881-1886&rft.issn=1550-3607&rft.eissn=1938-1883&rft.isbn=9781424403530&rft.isbn_list=1424403537&rft_id=info:doi/10.1109/ICC.2007.313&rft_dat=%3Cieee_6IE%3E4288984%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=4288984&rfr_iscdi=true |