Everything about Join-based tree algorithms
In computer science, join-based tree algorithms are a class of algorithms for self-balancing binary search trees. This framework aims at designing highly-parallelized algorithms for various balanced binary search trees. The algorithmic framework is based on a single operation join. Under this framework, the join operation captures all balancing criteria of different balancing schemes, and all other functions join have generic implementation across different balancing schemes. The join-based algorithms can be applied to at least four balancing schemes: AVL trees, red–black trees, weight-balanced trees and treaps. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Join-based tree algorithmsA 5-minute orientation
- Pick up a classic book: Fundamentals of data structures in CThe most-reprinted book on the subject
- Read the landmark paper: Algorithm for Processing k-Nearest Join Based on R-Tree in MapReduceCited 11 times
- Go sideways: Weight-balanced treeA closely related topic
- Go sideways: AVL treeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Fundamentals of data structures in CEllis Horowitz · 1993
Spatial data managementNikos Mamoulis · 2011
Database SystemsRamez Elmasri, Shamkant B. Navathe · 2010
Neural Information ProcessingTingwen Huang · 2012- 📕Fuzzy systems and data mining IIITaiwan) FSDM (Conference) (2017 Hualien · 2017
Database repairing and consistent query answeringLeopoldo Bertossi · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Weight-balanced tree In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionari…
- AVL tree In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights…
- Red–black tree In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information…
- Treap In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain…
- AA tree An AA tree in computer science is a form of balanced tree used for storing and retrieving ordered data efficiently. AA trees are named after their originator…
- Binary search tree In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each…
- Skew heap A skew heap (or self-adjusting heap) is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their ability to merge…
- Binary tree In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child…