Optimal Cooperative Search In Fractional Cascaded Data Structures (1995)
Cached
Download Links
- [www.cs.duke.edu]
- [ftp.cs.brown.edu]
- [www.cs.brown.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 8 - 3 self |
BibTeX
@MISC{Tamassia95optimalcooperative,
author = {Roberto Tamassia and Jeffrey Scott Vitter},
title = {Optimal Cooperative Search In Fractional Cascaded Data Structures},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Fractional cascading is a technique designed to allow efficient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs along a path. In this paper we show how to preprocess a variety of fractional cascaded data structures whose underlying graph is a tree so that searching can be done efficiently in parallel. The preprocessing takes O(log n) time with n/log n processors on an EREW PRAM. For a balanced binary tree cooperative search along root-to-leaf paths can be done in O((logn)/logp) time using p processors on a CREW PRAM.
