B-slack Trees: Space Efficient B-Trees
| dc.contributor.author | Brown, Trevor | |
| dc.date.accessioned | 2026-10-20T20:12:55Z | |
| dc.date.issued | 2014 | |
| dc.description | Accepted author manuscript of the SWAT 2014 paper, 12 pages. This peer-reviewed manuscript is not the Version of Record and excludes publisher production changes. The published edition is copyright 2014 Springer International Publishing Switzerland. Final authenticated version: https://doi.org/10.1007/978-3-319-08404-6_11. Use is subject to Springer Nature’s accepted-manuscript terms: https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms. Also includes the expanded 19-page manuscript, arXiv:1712.05020v2 (2017-12-15), which is not separately peer reviewed. PDFs unchanged; no new Creative Commons licence assigned. | |
| dc.description.abstract | B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(log_b n), where b is the maximum node degree. Updates can be performed in O(log_{b/2} n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented. | |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada (acknowledged in the expanded manuscript) | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-319-08404-6_11 | |
| dc.identifier.uri | https://hdl.handle.net/10012/24562 | |
| dc.language.iso | en | |
| dc.publisher | Springer International Publishing | |
| dc.relation.ispartofseries | Algorithm Theory – SWAT 2014, Lecture Notes in Computer Science; 8503 | |
| dc.subject | search trees | |
| dc.title | B-slack Trees: Space Efficient B-Trees | |
| dc.title.alternative | B-slack trees: Highly Space Efficient B-trees | |
| dc.type | Conference Paper | |
| dcterms.bibliographicCitation | Trevor Brown. 2014. B-slack Trees: Space Efficient B-Trees. In Algorithm Theory – SWAT 2014, Lecture Notes in Computer Science 8503, pp. 122–133. Springer International Publishing. https://doi.org/10.1007/978-3-319-08404-6_11 | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | |
| uws.peerReviewStatus | Reviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 2 of 2
Loading...
- Name:
- cv-35-b-slack-trees-space-efficient-b-trees.pdf
- Size:
- 290.87 KB
- Format:
- Adobe Portable Document Format
- Description:
- Accepted author manuscript of the SWAT 2014 paper, 12 pages. Subject to Springer Nature’s accepted-manuscript terms; see record notice and final publication DOI. PDF unchanged.
Loading...
- Name:
- cv-62-b-slack-trees-space-efficient-b-trees-2017.pdf
- Size:
- 359.6 KB
- Format:
- Adobe Portable Document Format
- Description:
- Expanded 19-page manuscript, arXiv:1712.05020v2 (2017-12-15). Not separately peer reviewed. Selected local PDF unchanged; original notices retained.
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 4.47 KB
- Format:
- Item-specific license agreed upon to submission
- Description: