Referenced Items are not available for this document.
Several hardware algorithms to search for a large number of keys in a database are presented. These algorithms allow some false matches but guarantee hits for the desired search keys. This imperfectness allows us to design a variety of simple hardware searchers by using only RAM's and shift registers. Analytic models are developed to compare the performances of these hardware devices. Applications of these devices for database systems are also discussed.
Published in:
Computers, IEEE Transactions on
(Volume:C-35
,
Issue:
12
)
Date of Publication: Dec. 1986
- Page(s):
- 1077 - 1082
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/TC.1986.1676716
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 August 2006
- Issue Date :
- Dec. 1986
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
