{"title":"The application of a geometric arithmetic parallel systolic array processor to database machine design","authors":"Alexis Koster, N. Sondak, Paul Sullivan","doi":"10.1109/ICDE.1986.7266239","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266239","url":null,"abstract":"This paper examines the use of the Geometric Arithmetic Parallel Processor (GAPP) IC systolic array chip as the major processing element in the design and construction of a high-speed, parallel, relational database machine. This chip is of particular interest because it is one of the first commercially available systolic array chips. A brief review of the architectural features of the GAPP is presented. Parallel algorithms for handling basic relational database operations-simple queries, joins, and sorts-are presented. Building blocks of cascaded systolic arrays are developed to implement these algorithms. A database machine architecture to incorporate these building blocks is described and compared to existing designs.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131070366","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}
E. Dubois, J. Hagelstein, Eugene Lahou, André Rifaut, Fiona Williams
{"title":"A data model for requirements analysis","authors":"E. Dubois, J. Hagelstein, Eugene Lahou, André Rifaut, Fiona Williams","doi":"10.1109/ICDE.1986.7266273","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266273","url":null,"abstract":"The use of a proper data model is a way to introduce rigour in requirements analysis, traditionally considered the most informal stage of software development, and responsible for the more costly errors. Several data models have emerged, but their comparative value is unclear. We think that an appraisal is only possible if the nature — and not only the goal — of requirements analysis is clearly perceived. We investigate this point and emphasise that requirements analysis is an activity of acquiring real-world knowledge, thereby forming a theory in which objectives can be stated and a solution specified. A suited language should thus restrict as little as possible the freedom of expression when describing some part of the world. A number of requirements are derived from this statement, such as the possibility to describe individual objects, as well as groups of objects, to explicitly refer to a global continuous time, to handle undefinedness, to allow simultaneous events, etc. When assessing the various existing data models with respect to these requirements, the entity-relationship model is found a suitable basis, but still lacking essential features. We extend it in a model called ERAE (entity, relationship, attribute, event), which is presented informally and illustrated on examples.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114377461","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":"Entity — Relationship modeling and fuzzy databases","authors":"A. Zvieli, Peter P. Chen","doi":"10.1109/ICDE.1986.7266236","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266236","url":null,"abstract":"This work describes an integration of an entity/relationship model and fuzzy databases. It outlines a formal model for representing fuzziness in the ER model, and sketchs a version of the ER algebra, adapted to manipulating fuzzy databases.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878183","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 distributed query processing strategy using decomposition, pipelining and intermediate result sharing techniques","authors":"S. Su, K. Mikkilineni, R. Liuzzi, Y. Chow","doi":"10.1109/ICDE.1986.7266210","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266210","url":null,"abstract":"The future data systems are likely to be integrated data networks (IDNs) consisting of a mix of general-purpose computer systems and special-purpose functional processors that are produced by different vendors and have quite different computational power and database management capabilities. Data stored in these networks need to be integrated and shared by the network users. It is important to have a query processing strategy in this type of network that can take advantage of the diverse functional capabilities of the component systems and the parallel processing potential of the network. In this paper, we present a query processing strategy which combines three known techniques: 1) query decomposition, 2) pipelined and data-flow processing of queries, and 3) intermediate result sharing among concurrent queries. The strategies for controlling and managing query and data pipelines are presented. Algorithms for the pipelined execution of the relational join operation are also described. Selected results of the evaluation of the query processing strategy, pipeline control strategies, and parallel algorithms are presented.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115034293","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":"Component aggregation: A mechanism for organizing efficient engineering databases","authors":"M. Ketabchi, V. Berzins","doi":"10.1109/ICDE.1986.7266246","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266246","url":null,"abstract":"An implementation technique for design databases is introduced. The technique is based on the component aggregation abstraction, which ignores the details of assembly structures of objects and considers assemblies which have exactly the same type of parts as equivalent assemblies. Component aggregation allows structural properties of design objects to be explored and utilized to achieve efficient organization of design data. A mathematical model of design objects is developed, and used to demonstrate the benefits of component aggregation in the execution of frequent operations in design applications.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302129","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":"Statistical data reduction lor manufacturing testing","authors":"Sakti P. Ghosh","doi":"10.1109/ICDE.1986.7266206","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266206","url":null,"abstract":"This paper deals with statistical reduction of the large volume of data that are generated by modern computerized testing in manufacturing environment. Two statistical algorithms have been developed to reduce dynamically, in real time, the amount of manufacturing testing, while maintaining the quality level, thus reducing the volume of data generated. In algorithm 1, homogeneous clusters of tests are formed based on statistical correlation coefficients, and then a subset of tests from each cluster are executed. In algorithm 2, the correlation coefficients arc used to derive statistical prediction equations, which are then used to decide if certain test are to be performed on an item. A method and algorithm for statistically discarding manufacturing test data (associated with an item) is given in algorithm 3. Algorithm 4, deals with computerized stratification and sample selection of manufacturing test data. An method for computerized sampling based on test values, for retaining a subset of the data, is provided in the algorithm 5.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128315729","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 controllable Prolog database system","authors":"N. Minsky, D. Rozenshtein, J. Chomicki","doi":"10.1109/ICDE.1986.7266269","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266269","url":null,"abstract":"This paper presents a model that provides a single comprehensive mechanism to control the use, operation and evolution of database systems. This model unifies several concepts generally considered to be quite distinct. In particular, it minimizes the formal distinction between the users of the database, the programs embedded in it and even the administrators and the programmers maintaining it. Furthermore, under this model, the concepts of subschema and of program module are replaced with a single concept of frame, which serves as the locus of power and of activity in the system. Moreover, the proposed control mechanism is closed, in the sense that the process of establishing controls is itself controllable by the same mechanism. This can be used to formalize and control managerial policies about the use and evolution of database systems.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123514736","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":"Do semantically equivalent SQL queries perform differently?","authors":"G. Lohman","doi":"10.1109/ICDE.1986.7266225","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266225","url":null,"abstract":"The relational database query language SQL (originally, \"SEQUEL\") was first developed as a non-procedural language: the user should specify only what data is desired, leaving it to the the system's query optimizer to determine how the data is accessed [ASTR 75]. IBM pioneered the development of query optimizer technology that would achieve this ideal, beginning with the well-known optimizer of System R [SELI 79], the prototype relational database management system (DBMS) developed at IBM Research Laboratory in San Jose, California during the late 1970's. The IBM products SQL/DS [SQL 84] and DB2 [CHEN 84], as well as the experimental distributed DBMS prototype R∗ [LOHM 85], contain optimizers that are based upon the System R prototype.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124822891","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":"Implementation of multi-key extendible hashing as an access method for a relational DBMS","authors":"Keith L. Kelley, M. Rusinkiewicz","doi":"10.1109/ICDE.1986.7266214","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266214","url":null,"abstract":"Extendible hashing addressing schemes have been introduced to resolve collisions and improve storage utilization by dynamically adjusting the address space and modifying the hash function. Recently, generalizations of extendible hashing have been proposed which allow multi-attribute keys to be used for improved partial-match query performance. In this paper the design and implementation of a multi-key extendible hashing access method for a relational DBMS is presented. The results of an experimental evaluation of performance of multi-key extendible hashing in a testbed relational DBMS suggest that for a wide class of queries it constitutes a viable alternative to ISAM-like files. The limitations of multi-key extendible hashing files and research problems which have to be solved before a practical access method for a relational DBMS can be developed are also discussed.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125118017","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":"Dynamic attributes in the multidatabase system MRPSM","authors":"W. Litwin, Philippe Vigier","doi":"10.1109/ICDE.1986.7266211","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266211","url":null,"abstract":"Dynamic attributes are attributes that are instantly defined in a query and unknown to the database or view schemes. This concept provides new possibilities, especially for multidatabase users. We first discuss the general interest of the concept. Then we present the implementation of the corresponding functionality within the prototype relational multidatabase system MRDSM.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125941635","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}