Approximate content addressable file system

Details Approximate content addressable file system Approximate content addressable file system

1981-02-09

1983-05-24

Popek, Joseph A.

Static information storage and retrieval

Associative memories

Ferroelectric cell

365230, G11C 1300

Patent

active

043853714

ABSTRACT:
In an approximate content addressable storage system data words are stored in a two dimensional storage array with each data character therein stored in a particularly associated storage row and each data word individually and sequentially character-by-character stored column-by-column. In searching the array for a particular word each storage row associated with a character in the search word is accessed in a manner biased to that character's position in the search word so that the search for all characters occurs effectively in parallel. A searched for character located in its proper position is given maximum value with decreasing value accorded to searched for characters detected one or more positions removed from the proper position in the search word. The value derived for each character is totalled with similar values derived from all other characters in the search word thus arriving at a value indicative of the approximateness of a stored word with the search word. A threshold detector may be employed to remove detection of stored words only remotely approximate to the search word.

REFERENCES:
patent: 4159538 (1979-06-01), Motsch

Affiliated with

Also associated with

Rating

Approximate content addressable file system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Approximate content addressable file system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate content addressable file system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2148643