{"title":"Data Structuring and Indexing for Data Base Machines","authors":"J. Banerjee","doi":"10.1145/647003.711862","DOIUrl":"https://doi.org/10.1145/647003.711862","url":null,"abstract":"Our focus in this paper is not the design of new and improved hardware for data base management. Instead, our main interest is to document the results of our investigation on the data structuring and indexing requirements of the class of data base machines that contain partitioned content-addressable memory (PCAM).","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"253 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":"123074529","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 Microprogrammed Search Controller for a Text Scanning Processor","authors":"F. Burkowski","doi":"10.1145/647003.711746","DOIUrl":"https://doi.org/10.1145/647003.711746","url":null,"abstract":"The objective of the research in this paper is the design of a non-numeric processor to be used in the scanning of textual information brought in from serial storage. Source text progresses through a linear array of 32 cells each cell capable of holding one character. With all cells operating in parallel, character subsequences in the source stream can be compared with character strings in any one of 16 registers associated with the cellular array. Various modules associated with the array are used to aid the query resolution process. The overall design emphasizes speed of execution and versatility of operation.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"121 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":"116837007","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}
K. Bratbergsengen, Rune Larsen, O. Risnes, Terje Aandalen
{"title":"A Neighbor Connected Processor Network for Performing Relational Algebra Operations","authors":"K. Bratbergsengen, Rune Larsen, O. Risnes, Terje Aandalen","doi":"10.1145/647003.711747","DOIUrl":"https://doi.org/10.1145/647003.711747","url":null,"abstract":"In a data base computer consisting of cells with processing capability, the desired goal is to achieve an execution time - for each data base operation - to be inversely proportional to the number of cells. Using rings as a basic building block, we have constructed different intercell communication networks. The capacity of the communication network have been analyzed under the workload of relational algebra operations. A k-dimensional network of intersecting rings, each of 2 or 3 cells have been found to give the highest processing capacity per cell in the network. Here k is log 2 C, where C is the total number of cells. A simple wiring scheme for k-dimensional network of 2 cells per ring has been presented. For this type of network, we have also described the routing logic, and given an estimate of the queueing delay.","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":"125773175","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":"The Harpy Machine: A Data Structure-Oriented Architecture","authors":"R. Bisiani","doi":"10.1145/647003.711861","DOIUrl":"https://doi.org/10.1145/647003.711861","url":null,"abstract":"Efficiently storing and retrieving data has always been one of the major problems in computer technology. Until recently there has been more interest for the technology of storing and retrieving data in mass memory than for the problem of accessing data in main memory. Semiconductor technology improvements have lowered main memory cost and increased speed, therefore opening new application areas (e.g. image and speech understanding, graphics) to low cost systems. Some of the tasks in these areas are data intensive and require complex data structures. In these cases, most of the computing power is used to access data rather than to perform operations on them. The performance of such applications can be improved if the memories are tailored to the data structures they contain and to the access operations that can be performed on those data structures. The paper describes an architecture designed to explore the advantages offered by tailored, intelligent memories. The architecture has been implemented and tested on the Harpy speech understanding system. The implementation has been measured and the results are reported in the paper.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"17 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":"130059055","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":"SYNGLISH - A High-Level Query Language for the RAP Database Machine","authors":"M. Tamer Özsu, E. Ozkarahan","doi":"10.1145/647003.711865","DOIUrl":"https://doi.org/10.1145/647003.711865","url":null,"abstract":"This paper describes a high-level query language developed and implemented for the RAP database machine. The language, called SYNGLISH, is based on the semantic structure of the English sentences. The software system developed accepts SYNGLISH queries and produces RAP assembler code which is then executed by the RAP software emulator.","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":"130073648","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":"Evaluation of Alternative Data Base Machine Designs","authors":"V. Vemuri, R. Liuzzi, Joseph P. Cavano, P. Berra","doi":"10.1145/647003.711744","DOIUrl":"https://doi.org/10.1145/647003.711744","url":null,"abstract":"The purpose of this paper is to point out the need for performance evaluation measures and techniques suitable for the evaluation of specialized architectural features in nonnumeric applications. Toward this end, problems associated with the use of data base machines are examined at three levels of detail: the user level, the system level and the device level.","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":"130438770","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":"An Approach Towards Information Systems with Very Large Numbers of Subscribers","authors":"G. Creutz, F. Kiel","doi":"10.1145/647003.711748","DOIUrl":"https://doi.org/10.1145/647003.711748","url":null,"abstract":"The Federal Ministry of Research and Technology (BMFT) took the initiative in starting a project concerning two-way cable television in 1976 at the Heinrich-Hertz-Institute. The two-way cable television provided a model for investigating the possibilities of new screen-orientated, interactive systems for large numbers of subscribers using alpha-numerics, graphics, motion-pictures, and sound. One of the most important research aspects proved to be the construction of a computer control centre which would cater for this type of hybrid information system. At present a laboratory model of such a control centre is being developed by the Heinrich-Hertz-Institute in collaboration with the Computer Industry. This model is based on a mini-computer multi-processor system.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"40 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":"115512853","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":"APCAM (A Practical Cellular Associative Memory)","authors":"Tom R. Kibler","doi":"10.1145/647003.711860","DOIUrl":"https://doi.org/10.1145/647003.711860","url":null,"abstract":"This paper discusses about APCAM. APCAM was designed as a practical intelligent parallel search disk for support of relational data base systems. The aim was not to provide a complete relational engine but to provide a machine which would search large volumes of data and perform projections and restrictions along with helping with sorting.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"88 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":"121209673","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 Relational Database Machine Architecture","authors":"D. E. Shaw","doi":"10.1145/647003.711745","DOIUrl":"https://doi.org/10.1145/647003.711745","url":null,"abstract":"Algorithms are described and analyzed for the efficient evaluation of the project and join operators of a relational algebra on a proposed non-von Neumann machine based on a hierarchy of associative storage devices. This architecture permits an O (log n ) decrease in time complexity over the best known evaluation methods on a conventional computer system, without the use of redundant storage, and using currently available and potentially competitive technology. In many cases of practical import, the proposed architecture may also permit a significant improvement (by a factor roughly proportional to the capacity of the primary associative storage device) over the performance of previously implemented or proposed database machine architectures based on associative secondary storage devices.","PeriodicalId":328859,"journal":{"name":"Computer Architecture Workshop","volume":"23 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":"129699954","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}