Binary Search Trees are a frequently used data structure for rapid access to the stored data. Data structures like arrays, vectors and linked lists are limited by the trade-off between the ability to perform a fast search and resize easily. They are an alternative that is both dynamic in size and easily searchable. Due to efficiency reason, complete and nearly complete binary search trees are o...

The N-body or multi-tree approach for accelerating data mining methods has spurred some of the fastest known solutions for a significant class of fundamental methods. We present a standard mathematical model and associated programming model that allows these problems to be scaled further via parallelization, without significant extra programmer effort. With the framework, we derive a strategy f...

We analyze a tree search problem with an underlying Markov decision process, in which the goal is to identify best action at root that achieves highest cumulative reward. present new policy optimally allocates limited computing budget maximize lower bound on probability of correctly selecting each node. Compared widely used upper confidence (UCB) policies, presents more balanced approach manage...

String B-tree is a combination of B-tree and Patricia tries for internal-node indices. Instead of storing prefix compressed keys at each index node, each key is stored in full in a consecutive sequence of data blocks, and each downward-traversal decision is made by a combination of Patricia trie search and the consultation of a single key. String B-tree has the same worst case performance as B-...

In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any othe...

DEXSY2 is a dental expert system, which diagnoses oral diseases and offers a treatment course. The system which is designed and implemented from scratch is capable of diagnosing among thirty five oral diseases and offering a course of treatment for each. It uses a decision tree for its representation of knowledge, and each of its nodes contains a frame. The knowledge base of the system contains...