Algorithms in SNOBOL4
The design of a rotating associative memory for relational database applications
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The architecture of CASSM: A cellular system for non-numeric processing
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Associative/parallel processors for searching very large textual data bases
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
Map editing.
Retrieval operations and data representations in a context-addressed disc system
SIGPLAN '73 Proceedings of the 1973 meeting on Programming languages and information retrieval
An introduction to database systems (The Systems programming series)
An introduction to database systems (The Systems programming series)
Hardware Algorithms for Nonnumeric Computation
IEEE Transactions on Computers
A Design of a Fast Cellular Associative Memory for Ordered Retrieval
IEEE Transactions on Computers
A highly parallel computing system for information retrieval
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
RAP: an associative processor for data base management
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Charge-coupled devices for memory applications
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Holographic memories: fantasy or reality?
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
BEAMOS: a new electronic digital memory
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
A mathematical model of character string manipulation
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
| Hi-index | 0.00 |
This paper describes a fast associative search algorithm based on parallel searching by pattern-splitting. The text is read as a sequence of substrings and searching is parallel within each substring. Substring length can be arbitrarily chosen and this division is independent of the logical partitioning of the data, such as tuple and domain. This provides a flexible storage structure across tracks of the secondary storage. The algorithm developed is used in the design of a hardware associative search. It works directly on the secondary storage and is a basis for database machine design. The design is cellular in structure and can be implemented by using LSI technology.