Title: Parallel and Distributed Solutions for the Optimal Binary Search Tree Problem
Abstract: A parallel and a distributed implementation for a very important problem in the searching theory, the optimal binary search tree (BST) problem, is presented and analyzed. Implemented as a VLSI array, the algorithm for building the optimal BST uses O(n 2) processors and has the parallel time complexity O(n). A search is solved in O(log n) time. On a cluster of computers, the binary search tree is organized on two levels: the first level corresponds to the BST of searching intervals and the second level is the level of the BST for effective searching within an interval. A hybrid solution is also considered. The best variant depends on the hypothesis of the searching problem.
Publication Year: 2002
Publication Date: 2002-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot