Baseball: an automatic question answerer
Computers & thought
Inferential memory as the basis of machines which understand natural language
Computers & thought
Answering English questions by computer: a survey
Communications of the ACM
TRAC, a procedure-describing language for the reactive typewriter
Communications of the ACM
Communications of the ACM
Compound data structure for computer aided design; a survey
ACM '67 Proceedings of the 1967 22nd national conference
Elements of Data Management Systems
ACM Computing Surveys (CSUR)
A Survey of Data Structures for Computer Graphics Systems
ACM Computing Surveys (CSUR)
Associative and Parallel Processors
ACM Computing Surveys (CSUR)
An ALGOL-based associative language
Communications of the ACM
The converse natural language data management system: current status and plans
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
A relational data base management system
ACM '72 Proceedings of the ACM annual conference - Volume 2
An overview of nonprocedural languages
Proceedings of the ACM SIGPLAN symposium on Very high level languages
DIAM II: The binary infological level and its database language - FORAL
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
On the equivalences of data based systems
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
Design of a language for high-level data structures
ACM SIGPLAN Notices - Abstracts in programming language-related research
A preliminary survey of artificial intelligence machines
ACM SIGART Bulletin
Data and storage structures for interactive graphics
ACM SIGPLAN Notices
Cylinders: a relational data structure
ACM SIGPLAN Notices
Graphical systems communication: an associative memory approach
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Associative processing of line drawings
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Steps toward automatic theory formation
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
IBM Systems Journal
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
A data base sublanguage founded on the relational calculus
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
| Hi-index | 0.02 |
In recent years; it has become increasingly clear that there is need for a content-addressable computer memory. Larger and larger programs are being written which require a structured data base to operate with any efficiency. Many of these could well benefit by replacing tedious searches with a fast, efficient, “content-addressable” access of the data store. A good example is the “key-word” library search. If one asks for a list of the books written by J. von Neumann, we do not expect the system to look at each title in its store and save only those written by von Neumann. And, if there happens to be a catalog prepared, designed to answer this particular question, we do not want to have to do a binary search to find the correct section of the catalog—we want to retrieve the answer directly!