Skip to search formSkip to main contentSkip to account menu

2–3 tree

Known as: 2-3 tree 
In computer science, a 2–3 tree is a tree data structure, where every node with children (internal node) has either two children (2-node) and one… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
(a,b)-tree2–3 heap2–3–4 treeAA tree

Broader (1)

B-tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Optimal Multithreaded Batch-Parallel 2-3 Trees
This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches… 
2014
2014
Performance efficiency in plagiarism indication detection system using indexing method with data structure 2–3 tree
Plagiarism is a form of cheating that has been so much happen. One of prevention is to make the anti-plagiarism system. The… 
2013
2013
Optimal key tree structure for two-user replacement and deletion problems
We study the optimal tree structure for the key management problem. In the key tree, when two or more leaves are deleted or… 
2011
2011
A Group Key Management Protocol Based on Weight-Balanced 2-3 Tree for Wireless Sensor Networks
Multicast in Wireless Sensor Networks (WSNs) is an attractive mechanism for delivering data to multiple receivers as it saves… 
2008
2008
Optimal Key Tree Structure for Deleting Two or More Leaves
We study the optimal tree structure for the key management problem. In the key tree, when two or more leaves are deleted or… 
2007
2007
Concurrent implementation of caches
Caches are typically used in the practice for making the respond time faster when of accessing remote data. Every case when… 
2005
2005
A scalable scheme for certificate revocation
This paper proposes a scalable scheme for certificate revocation in public key infrastructure. In this scheme, the set of revoked… 
2000
2000
Available and Stabilizing 2-3 Trees
Transient faults corrupt the content and organization of data structures. A recovery technique dealing with such faults is… 
1991
1991
Parallel Cardinality Stacks and an Application
1984
1984
An empirical comparison of B-trees, compact B-trees and multiway trees
It is well-known that the B-tree data structure yields excellent worst-case search costs and for that reason is widely employed… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)