Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

A low-cost text retrieval machine

A low-cost text retrieval machine

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The paper introduces the design and implementation of a text retrieval hardware unit. After surveying a number of hardware text retrieval packages, it proposes a linguistic approach, in which the retrieval is treated as a regular expression which can be recognised by a finite state machine. The design of a finite state machine interpreter is given, and the problems of compiling a regular expression for this interpreter discussed. The algorithm for the compilation is given. Performance figures for the hardware, when connected to real systems, are given.

References

    1. 1)
      • Gonzalez-Rubio, R., Rohmer, J., Terral, D.: `The Schuss filter: a processor for non-numerical data processing', Proc. 11th annual int. symp. on computer architecture, 1984, Ann Harbor Michigan, p. 64–73.
    2. 2)
      • H.S. Stone . Parallel querying of large database: a case study. Comput. , 11 - 21
    3. 3)
      • J. Schefter . Super searcher. Popular Sci. , 60 - 61
    4. 4)
      • Operating system Inc., 21031 Venture Boulevard, Woodland Hills, California, 91364.
    5. 5)
      • M. Minsky . (1967) , Finite and infinite machines.
    6. 6)
      • Lavington, S.H.: `A 4-Mbyte associative predicate store', Proc. 1st workshop on architecture for large knowledge bases, 1984, Unit. of Manchester UK.
    7. 7)
      • Exploiting CAFS-ISP, ICL Computer Users Assoc. (UK), 1984.
    8. 8)
      • F.J. Burkowski . A hardware hashing scheme in the design of a multiterm string comparator. IEEE Trans. , 825 - 834
    9. 9)
      • L.A. Holaar . The Utah text retrieval project. Inf. Tech. Res. Dev. , 155 - 168
    10. 10)
      • D.R. MacGregor , J.R. Malone . An integrated high performance hardware-assisted intelligent database system for large-scale knowledge bases. Popular Sci.
    11. 11)
      • P.N. Yianilos . A dedicated comparator matches symbol strings fast and intelligently. Electron. , 113 - 117
    12. 12)
      • V.A. Aho , J.E. Hopcroft , J.D. Ullman . (1977) , Principles of compiler design.
    13. 13)
      • F.G. Heath . Mamex — an information engine. IUCC Bull. , 116 - 119
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1989.0037
Loading

Related content

content/journals/10.1049/ip-e.1989.0037
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address