The Mythical Man-Month: Essays on Softw
The Mythical Man-Month: Essays on Softw
The architecture of CASSM: A cellular system for non-numeric processing
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Editing requirements for data base applications and their implementation on the INDY backend kernel
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
A high level data sublanguage for a context-addressed segment-sequential memory
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
Retrieval operations and data representations in a context-addressed disc system
SIGPLAN '73 Proceedings of the 1973 meeting on Programming languages and information retrieval
| Hi-index | 0.00 |
User and hardware cost trends dictate that data base systems should provide more complete functionality, simplicity of use, and reliability by increasing the amount of hardware present in the system. These goals are accomplished with a simple hardware arrangement within a one-dimensional cellular storage system called INDY. The INDY backend kernel is intended as a powerful tool for implementing all data models. The INDY cellular storage array is intended to provide functionality that is difficult to implement efficiently using a conventional hardware arrangement. It allows a simple implementation of improved data independence at high speeds. INDY simultaneously satisfies the time windows of future hardware technologies and user requirements.The importance of strings as a mechanism for defining abstract data types for data base languages is discussed in more detail in another paper. In that paper, a language called STRING is introduced which allows names of data objects to be semantically defined as variable-length strings and compared based on string pattern membership. This paper is concerned with the implementation of string storage and searching required by the STRING language. Implementation of higher level structures and searching requirements (such as sets, rows, tables and hierarchies) on the INDY kernel is treated elsewhere.