Bottom-up Update Mechanism for Re-structured Complete Binary Trees
Keywords:
data structure, complete binary tree, CBT, sCBT, unilateral update, bottom-up update, replacement selection
Abstract
This paper introduces a bottom-up update mechanism together with a non-recursive initial update procedure that reduces the required extra memory space and computational overhead. A new type of tree is defined based on a different geometrical interpretation of Complete Binary Trees. The new approach paves the way for a special and practical initialization of the tree, which is a prerequisite for an implementation of unilateral update operation. The details of this special initialization and the full update procedures are given for Complete Binary Trees. In addition, a comparison is made between the introduced update method and the bilateral update methods in terms of different performance related metrics.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2016-05-15
Issue
Section
License
Copyright (c) 2016 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.