{"title":"RELACS - A Relational Associative Computer System","authors":"Ellen J. Oliver, P. Berra","doi":"10.1145/647003.711870","DOIUrl":"https://doi.org/10.1145/647003.711870","url":null,"abstract":"Recent advances in LSI, VLSI and memory technology have led to a reduction in hardware cost and an increase in mass storage capacity such that an associative array memory can be produced and supported. Toward this end, in this paper such an associative array computer called REL ational A ssociative C omputer S ystem (RELACS) is proposed.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127209730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optical Mass Storage Technology","authors":"L. Laub","doi":"10.1145/647003.711863","DOIUrl":"https://doi.org/10.1145/647003.711863","url":null,"abstract":"This paper describes some of the history, general principles and current embodiments of the technology of data storage and retrieval by optical means. It also discusses the utility of some of these embodiments in certain classes of application.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115377300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Associative Mass Storage for Data Bases","authors":"G. Wolf","doi":"10.1145/647003.711868","DOIUrl":"https://doi.org/10.1145/647003.711868","url":null,"abstract":"Two types of associative mass storage for use in database systems, have been introduced in this paper, they are I Hybrid associative storage For use as an associative primary storage, it comprise a storing “basement” and an associative surface matrix. The suggested configuration has a capacity of up to 64 megabytes and a search rate of the order of 2 to 8 gigabytes per second. As well as associative operation, it is also suitable for extremely fast sorting. II Hardware hash coding system A hardware structure provides associative access to conventional, numerically addressed storage media. The prefered application is for quasi-associative access to data in secondary storages. Associative mass storages systems differ in their characteristics and complement each other. Together they form the hardware building blocks of a database system.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128477436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hardware for Searching Very Large Text Datahases","authors":"R. Haskin","doi":"10.1145/647003.711864","DOIUrl":"https://doi.org/10.1145/647003.711864","url":null,"abstract":"This paper discusses the problem of searching very large text databases. It is shown that conventional techniques for searching current databases cannot be scaled up to larger ones, and that it is necessary to build hardware to search the database in parallel if reasonable search times are expected. The part of the search process requiring the highest bandwidth is scanning the database to detect instances of search terms. Methods of doing this in hardware that have been mentioned in the literature are examined, and design criteria for term matchers are discussed. A new design that uses a nondeterministic finite state automaton to control matching, is introduced, its operation is explained, and the practicality of using it in a real system is discussed.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129278809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Access Control Mechanism of a Database Computer (DBC)","authors":"J. Menon, D. K. Hsiao","doi":"10.1145/647003.711749","DOIUrl":"https://doi.org/10.1145/647003.711749","url":null,"abstract":"The database computer (DBC) is a specialized back-end computer which is capable of managing data 10 10 bytes in size and supporting known data models such as relational, network, hierarchical and attribute-based models. It is also perhaps the first database machine to have a built-in security mechanism for access control. At the outset, the security mechanism was made an integral part of the DBC design. This design philosophy not only allowed us to construct a system that has no “backdoors”, but also ensured that all access requests are, in fact, controlled by DBC's security mechanism. The DBC security mechanism is based on the concept of security atoms, aggregates of data units being definable by the user in terms of conjunctions of query predicates. The fundamental gain in utilizing query conjunctions for the purpose of access control is that any data that is accessible or updateable is also protectable. It is believed that the DBC security mechanism is less cumbersome than the view mechanism of some database systems and more efficient than the query modification mechanism used by some other systems. This is demonstrated at three levels of access control, namely the subfile, record and field (attribute) levels.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133089775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"String storage and searching for data base applications: Implementation on the INDY backend kernel","authors":"G. Copeland","doi":"10.1145/800128.804162","DOIUrl":"https://doi.org/10.1145/800128.804162","url":null,"abstract":"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.\u0000 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.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131477244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantic paging on intelligent discs","authors":"G. Lipovski","doi":"10.1145/800128.804164","DOIUrl":"https://doi.org/10.1145/800128.804164","url":null,"abstract":"In order to apply Artificial Intelligence techniques like inferencing to large (109-1012 bit) data bases, an intelligent secondary memory is proposed that is capable of extracting a subgraph from a graph stored in it for further processing in a conventional or special purpose computer. The “pointer transfer” technique developed for CASSM is used to efficiently mark and output a subgraph stored in one file, and a simple technique is proposed to link parts of the subgraph stored on different files. Besides proposing a useful secondary memory system for applying Artificial Intelligence techniques to large data bases, this paper attacks one of the most difficult problems in distributed data base systems, which is the generation of “homomorphic query fragments” that automatically carry the query from one file to other files needed to resolve the query.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126940421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bubbles for relational database","authors":"Hsu Chang","doi":"10.1145/800128.804175","DOIUrl":"https://doi.org/10.1145/800128.804175","url":null,"abstract":"The mechanical disk storage is limited by long initial delay, few inputs/outputs, and serial access, thus necessitating large complex programs in existing database systems in order to map the user's view into the physical storage and to provide different access paths in response to different queries. Bubble devices are capable of set-oriented processing and associative addressing architecture. This paper presents concepts on data structure, storage structure, and access methods for bubble implementation of relational database.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1978-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125346624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A LISP machine","authors":"R. Greenblatt, T. Knight, J. Holloway, D. A. Moon","doi":"10.1145/800083.802703","DOIUrl":"https://doi.org/10.1145/800083.802703","url":null,"abstract":"LISP is the second oldest computer-programming language still in active use. Our implementation is based on a powerful microprogrammed processor designed specifically for LISP. This processor supports a tagged macro-architecture; it manipulates items which have a built-in data-type field.\u0000 The system supports several important new storage-management features, including a real-time garbage collector with hardware assist (using the basic algorithm of Baker).\u0000 The software itself is written in LISP to a much larger extent than in previous systems. In fact, there are only two levels in which code is written: LISP and microcode. Among other things this improves the consistancy of system interfaces.\u0000 The system design incorporates the personal computer philosophy. We believe the personal computer will predominate in the future since it is preferable to time-sharing in most cases and technological trends are greatly reducing its cost penality. In the case of very large programs, the personal computer can be cost-effective today, due to the phenomenon of thrashing encountered in time-sharing systems.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131251839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ulisse: An Italian project for a multifunctional terminal system","authors":"R. Cerretti, D. Jasilli, D. Matteucci","doi":"10.1145/800180.810253","DOIUrl":"https://doi.org/10.1145/800180.810253","url":null,"abstract":"The paper describes a project conducted in collaboration between CNUCE, an Institute of the Italian National Research Council, and a private research center, concerning a multifunctional system (Ulisse) capable of operating both as a stand alone unit for office administration and automation (word processsing, file management and retrieval) and as an intelligent terminal with local facilities for text editing, text formatting and storage.\u0000 The first results of the application of Ulisse in the environment of the scientific users of CNUCE are illustrated.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"44 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116645307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
