Optical implementation of a singleiteration thresholding algorithm with applications to parallel database�knowledge-base processing (1993) [3 citations — 2 self]
by Ahmed Louri, James A Hatch
Optics Letters
http://www.ece.arizona.edu/~ocppl/ps/jim_opt_let.ps
Add To MetaCart
Abstract:
Threshold (or relative magnitude) search is traditionally performed iteratively in a bit-serial manner in optical database/knowledge-base machines which results in an execution time proportional to the operand size. We present in this paper a single-step threshold search algorithm and its optical implementation. The proposed algorithm performs magnitude comparison in constant time, independent of the operand size, and consequently, it greatly increases the performance of optical database/knowledge-base processing operations such as searching, selection, retrieving, and sorting. 1
Citations
| 6 | An Introduction to Database Systems, 4th ed – Date - 1986 |
| 1 | Mohsen Guisani – Berra, Ghafoor, et al. - 1989 |
