Implementation of BT-trees

Implementation of BT-trees

This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable performance to unordered map implementations. However, in be...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bonnichsen, Lars F, Probst, Christian W, Karlsson, Sven
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Bonnichsen, Lars F
Probst, Christian W
Karlsson, Sven
description This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable performance to unordered map implementations. However, in benchmarks which favor unordered maps, BT-trees are not faster than the fastest unordered map implementations we know of.
doi_str_mv 10.48550/arxiv.1505.01210
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1505_01210</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1505_01210</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-a6181930a8f6b41922875099d499b573b037c6c4db976b0276f75a8a92e43bf43</originalsourceid><addsrcrecordid>eNotzrsOgjAYhuEuDga9AF3kBsC_53ZU4ikhcWEnLbQJCacAMXr3Krp87_blQWiDIWaKc9ib4Vk9YsyBx4AJhiXa3pq-do1rJzNVXRt2Pjxm0TQ4N67Qwpt6dOt_A5SdT1lyjdL75ZYc0sgICZ_BCmsKRnlhGdaEKMlB65JpbbmkFqgsRMFKq6WwQKTwkhtlNHGMWs9ogHa_2xmX90PVmOGVf5H5jKRvhe00OQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Implementation of BT-trees</title><source>arXiv.org</source><creator>Bonnichsen, Lars F ; Probst, Christian W ; Karlsson, Sven</creator><creatorcontrib>Bonnichsen, Lars F ; Probst, Christian W ; Karlsson, Sven</creatorcontrib><description>This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable performance to unordered map implementations. However, in benchmarks which favor unordered maps, BT-trees are not faster than the fastest unordered map implementations we know of.</description><identifier>DOI: 10.48550/arxiv.1505.01210</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms</subject><creationdate>2015-05</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><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>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1505.01210$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1505.01210$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bonnichsen, Lars F</creatorcontrib><creatorcontrib>Probst, Christian W</creatorcontrib><creatorcontrib>Karlsson, Sven</creatorcontrib><title>Implementation of BT-trees</title><description>This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable performance to unordered map implementations. However, in benchmarks which favor unordered maps, BT-trees are not faster than the fastest unordered map implementations we know of.</description><subject>Computer Science - Data Structures and Algorithms</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsOgjAYhuEuDga9AF3kBsC_53ZU4ikhcWEnLbQJCacAMXr3Krp87_blQWiDIWaKc9ib4Vk9YsyBx4AJhiXa3pq-do1rJzNVXRt2Pjxm0TQ4N67Qwpt6dOt_A5SdT1lyjdL75ZYc0sgICZ_BCmsKRnlhGdaEKMlB65JpbbmkFqgsRMFKq6WwQKTwkhtlNHGMWs9ogHa_2xmX90PVmOGVf5H5jKRvhe00OQ</recordid><startdate>20150505</startdate><enddate>20150505</enddate><creator>Bonnichsen, Lars F</creator><creator>Probst, Christian W</creator><creator>Karlsson, Sven</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20150505</creationdate><title>Implementation of BT-trees</title><author>Bonnichsen, Lars F ; Probst, Christian W ; Karlsson, Sven</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-a6181930a8f6b41922875099d499b573b037c6c4db976b0276f75a8a92e43bf43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Bonnichsen, Lars F</creatorcontrib><creatorcontrib>Probst, Christian W</creatorcontrib><creatorcontrib>Karlsson, Sven</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bonnichsen, Lars F</au><au>Probst, Christian W</au><au>Karlsson, Sven</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Implementation of BT-trees</atitle><date>2015-05-05</date><risdate>2015</risdate><abstract>This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable performance to unordered map implementations. However, in benchmarks which favor unordered maps, BT-trees are not faster than the fastest unordered map implementations we know of.</abstract><doi>10.48550/arxiv.1505.01210</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1505.01210
ispartof
issn
language eng
recordid cdi_arxiv_primary_1505_01210
source arXiv.org
subjects Computer Science - Data Structures and Algorithms
title Implementation of BT-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-13T02%3A15%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Implementation%20of%20BT-trees&rft.au=Bonnichsen,%20Lars%20F&rft.date=2015-05-05&rft_id=info:doi/10.48550/arxiv.1505.01210&rft_dat=%3Carxiv_GOX%3E1505_01210%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true