Optimal Cooperative Search in Fractional Cascaded Data Structures (Extended Abstract).pdf

Optimal Cooperative Search in Fractional Cascaded Data Structures (Extended Abstract) Roberto Tamasia* Jeflrey Scott Vittert Dept. of Computer Science Brown University Providence, R. I. 02912-1910 Abstract. Fractional cascading is a technique de- logs of the nodes on the search path. The search path signed to allow efficient sequential search in a graph can be either explicit, in which it is specified before with catalogs of total size n. The search consists of the search starts, or implicit, in which the branching is locating a key in the catalogs along a path. In this pa- determined at each node. In many important applica- per we show how to preprocess a variety of fractional tions of fractional cascading the graph G is a balanced cascaded data structures whose underlying graph is a binary tree and the search path is from the root to a tree so that searching can be done efficiently in paral- leaf. lel. The preprocessing takes O(log n) time with n/ log n Assume for simplicity that the graph G has processors on