About: Join-based tree algorithms

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Join-based tree algorithms Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdfs:label	Join-based tree algorithms (en)
rdfs:comment	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. (en)
dbp:wikiPageUsesTemplate	dbt:Math dbt:Mvar dbt:Notelist dbt:Reflist dbt:Tmath dbt:Data_structures
Subject	Binary trees
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Join-based_tree_algorithms?oldid=1074727284&ns=0
Wikipage page ID	58462412 (xsd:integer)
page length (characters) of wiki page	19569 (xsd:nonNegativeInteger)
Wikipage revision ID	1074727284 (xsd:integer)
Link from a Wikipage to another Wikipage	Union (set theory) AVL tree Analysis of parallel algorithms Associative array Augmented map Self-balancing binary search tree Binary trees Divide-and-conquer algorithm PAM library Search tree Set (abstract data type) Splay tree Complement (set theory) Computer science Parallel computing Haskell (programming language) Intersection (set theory) Treap Tree traversal Weight-balanced tree Standard ML of New Jersey Total order Red–black tree
has abstract	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. The join operation takes as input two binary balanced trees and of the same balancing scheme, and a key , and outputs a new balanced binary tree whose in-order traversal is the in-order traversal of , then then the in-order traversal of . In particular, if the trees are search trees, which means that the in-order of the trees maintain a total ordering on keys, it must satisfy the condition that all keys in are smaller than and all keys in are greater than . (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Join-based_tree_algorithms
is Link from a Wikipage to another Wikipage of	AVL tree Binary search tree
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Join-based_tree_algorithms

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software