loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Franjo Plavec ; Zvonko G. Vranesic and Stephen D. Brown

Affiliation: University of Toronto, Canada

ISBN: 978-989-8111-05-0

Keyword(s): Data structures, Binary trees, Balanced trees, Digital search trees.

Related Ontology Subjects/Areas/Topics: Algorithms and Data Structures ; Programming Languages ; Software Engineering

Abstract: This paper presents digital search trees, a binary tree data structure that can produce well-balanced trees in the majority of cases. Digital search tree algorithms are reviewed, and a novel algorithm for building sorted trees is introduced. It was found that digital search trees are simple to implement because their code is similar to the code for ordinary binary search trees. Experimental evaluation was performed and the results are presented. It was found that digital search trees, in addition to being conceptually simpler, often outperform other popular balanced trees such as AVL or red-black trees. It was found that good performance of digital search trees is due to better exploitation of cache locality in modern computers.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.175.191.72

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Plavec F.; G. Vranesic Z.; D. Brown S. and (2007). ON DIGITAL SEARCH TREES - A Simple Method for Constructing Balanced Binary Trees.In Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT, ISBN 978-989-8111-05-0, pages 61-68. DOI: 10.5220/0001336100610068

@conference{icsoft07,
author={Franjo Plavec and Zvonko {G. Vranesic} and Stephen {D. Brown}},
title={ON DIGITAL SEARCH TREES - A Simple Method for Constructing Balanced Binary Trees},
booktitle={Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT,},
year={2007},
pages={61-68},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001336100610068},
isbn={978-989-8111-05-0},
}

TY - CONF

JO - Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT,
TI - ON DIGITAL SEARCH TREES - A Simple Method for Constructing Balanced Binary Trees
SN - 978-989-8111-05-0
AU - Plavec, F.
AU - G. Vranesic, Z.
AU - D. Brown, S.
PY - 2007
SP - 61
EP - 68
DO - 10.5220/0001336100610068

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.