Uncoupling updating and rebalancing in chromatic binary search trees:
Abstract: "In order to gain maximal efficiency of the concurrent use of search trees the number of nodes to be locked at a time should be as small as possible, and the locks should be released as soon as possible. We propose a new rebalancing method for binary search trees that allows rebalanci...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Helsinki
1991
|
| Schriftenreihe: | Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications / A]
1991,2 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In order to gain maximal efficiency of the concurrent use of search trees the number of nodes to be locked at a time should be as small as possible, and the locks should be released as soon as possible. We propose a new rebalancing method for binary search trees that allows rebalancing to be uncoupled from updating, so as to make updating faster. The trees we use are obtained by relaxing the balance conditions of red- black trees. When not involved with updating, the rebalancing task can be performed as a shadow process being active all the time, or it can be performed outside rush hours, at night for example." |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010585942 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960125s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)31155475 | ||
| 035 | |a (DE-599)BVBBV010585942 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Nurmi, Otto |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Uncoupling updating and rebalancing in chromatic binary search trees |c Otto Nurmi ; Eljas Soisalon-Soininen |
| 264 | 1 | |a Helsinki |c 1991 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications / A] |v 1991,2 | |
| 520 | 3 | |a Abstract: "In order to gain maximal efficiency of the concurrent use of search trees the number of nodes to be locked at a time should be as small as possible, and the locks should be released as soon as possible. We propose a new rebalancing method for binary search trees that allows rebalancing to be uncoupled from updating, so as to make updating faster. The trees we use are obtained by relaxing the balance conditions of red- black trees. When not involved with updating, the rebalancing task can be performed as a shadow process being active all the time, or it can be performed outside rush hours, at night for example." | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Soisalon-Soininen, Eljas |e Verfasser |4 aut | |
| 810 | 2 | |a A] |t Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications |v 1991,2 |w (DE-604)BV000904448 |9 1991,2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007058309 | ||
Datensatz im Suchindex
| _version_ | 1804125055863488512 |
|---|---|
| any_adam_object | |
| author | Nurmi, Otto Soisalon-Soininen, Eljas |
| author_facet | Nurmi, Otto Soisalon-Soininen, Eljas |
| author_role | aut aut |
| author_sort | Nurmi, Otto |
| author_variant | o n on e s s ess |
| building | Verbundindex |
| bvnumber | BV010585942 |
| ctrlnum | (OCoLC)31155475 (DE-599)BVBBV010585942 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01688nam a2200313 cb4500</leader><controlfield tag="001">BV010585942</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960125s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31155475</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010585942</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nurmi, Otto</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Uncoupling updating and rebalancing in chromatic binary search trees</subfield><subfield code="c">Otto Nurmi ; Eljas Soisalon-Soininen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Helsinki</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications / A]</subfield><subfield code="v">1991,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In order to gain maximal efficiency of the concurrent use of search trees the number of nodes to be locked at a time should be as small as possible, and the locks should be released as soon as possible. We propose a new rebalancing method for binary search trees that allows rebalancing to be uncoupled from updating, so as to make updating faster. The trees we use are obtained by relaxing the balance conditions of red- black trees. When not involved with updating, the rebalancing task can be performed as a shadow process being active all the time, or it can be performed outside rush hours, at night for example."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Soisalon-Soininen, Eljas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A]</subfield><subfield code="t">Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications</subfield><subfield code="v">1991,2</subfield><subfield code="w">(DE-604)BV000904448</subfield><subfield code="9">1991,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007058309</subfield></datafield></record></collection> |
| id | DE-604.BV010585942 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007058309 |
| oclc_num | 31155475 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications / A] |
| spelling | Nurmi, Otto Verfasser aut Uncoupling updating and rebalancing in chromatic binary search trees Otto Nurmi ; Eljas Soisalon-Soininen Helsinki 1991 12 S. txt rdacontent n rdamedia nc rdacarrier Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications / A] 1991,2 Abstract: "In order to gain maximal efficiency of the concurrent use of search trees the number of nodes to be locked at a time should be as small as possible, and the locks should be released as soon as possible. We propose a new rebalancing method for binary search trees that allows rebalancing to be uncoupled from updating, so as to make updating faster. The trees we use are obtained by relaxing the balance conditions of red- black trees. When not involved with updating, the rebalancing task can be performed as a shadow process being active all the time, or it can be performed outside rush hours, at night for example." Data structures (Computer science) Trees (Graph theory) Soisalon-Soininen, Eljas Verfasser aut A] Tietojenkäsittelyopin Laitos <Helsinki>: [Series of publications 1991,2 (DE-604)BV000904448 1991,2 |
| spellingShingle | Nurmi, Otto Soisalon-Soininen, Eljas Uncoupling updating and rebalancing in chromatic binary search trees Data structures (Computer science) Trees (Graph theory) |
| title | Uncoupling updating and rebalancing in chromatic binary search trees |
| title_auth | Uncoupling updating and rebalancing in chromatic binary search trees |
| title_exact_search | Uncoupling updating and rebalancing in chromatic binary search trees |
| title_full | Uncoupling updating and rebalancing in chromatic binary search trees Otto Nurmi ; Eljas Soisalon-Soininen |
| title_fullStr | Uncoupling updating and rebalancing in chromatic binary search trees Otto Nurmi ; Eljas Soisalon-Soininen |
| title_full_unstemmed | Uncoupling updating and rebalancing in chromatic binary search trees Otto Nurmi ; Eljas Soisalon-Soininen |
| title_short | Uncoupling updating and rebalancing in chromatic binary search trees |
| title_sort | uncoupling updating and rebalancing in chromatic binary search trees |
| topic | Data structures (Computer science) Trees (Graph theory) |
| topic_facet | Data structures (Computer science) Trees (Graph theory) |
| volume_link | (DE-604)BV000904448 |
| work_keys_str_mv | AT nurmiotto uncouplingupdatingandrebalancinginchromaticbinarysearchtrees AT soisalonsoinineneljas uncouplingupdatingandrebalancinginchromaticbinarysearchtrees |