{"title":"On the application of data engineering to the configuration management of a hybrid simulator","authors":"D. Berg","doi":"10.1109/ICDE.1986.7266278","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266278","url":null,"abstract":"The development and implementation of an information model for the configuration management of a hybrid simulator is discussed. The simulator is used in the development, test, and evaluation of electronic guidance and control systems. It is modelled as a configuration hierarchy with logical access paths enabled via intersections between each level in the hierarchy. The model is implemented partially on an INGRES data base and partially in a UNIX™ directory structure. The mappings of the information model to the database schema and the configuration processes to the database operations are described.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"15 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":"132589631","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":"HAS, a relational algebra operator or divide is not enough to conquer","authors":"J. Carlis","doi":"10.1109/ICDE.1986.7266229","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266229","url":null,"abstract":"The relational algebra operator division is misnamed, hard to understand and insufficient. This paper explains division and presents HAS, a generalization of division which is useful for answering questions about an M-M relationship between entities.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"83 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":"131692916","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":"Distributed processing systems security: Communications, computer, or both","authors":"P. Woodie","doi":"10.1109/ICDE.1986.7266271","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266271","url":null,"abstract":"Information security involves many components, including communication security, computer security, physical security, and personnel security. This paper deals only with communication and computer security. In systems that involve either communications systems or monolithic computer systems (but not both) the overall requirements for information security are relatively straightforward, or at least relatively well understood. However, in distributed processing systems that usually involve both communications and computer components, there is a need for both communications as well as computer security techniques. This paper addresses communications security, computer security, and their relationship in information protection in the distributed processing environment.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"253 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":"114446725","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 locking scheme for associative retrieval","authors":"E. Onuegbe, H. Du","doi":"10.1109/ICDE.1986.7266264","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266264","url":null,"abstract":"The general problem of concurrency control for database systems has been studied intensively. However, the studies often ignored the underlying file systems. A locking scheme for multi-key hashed file structures is presented in this paper. First, we define a transaction model for such file structures, then we present techniques for conflict detection as well as a new locking scheme. The locking scheme combines aspects of both physical and predicate locking schemes. It places locks on buckets while guaranteeing record-level access; this results in increased concurrency with minimal overhead.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"119 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":"124711852","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":"Effect of update merging on reliable storage performance","authors":"Ching-Chao Liu, Toshimi Minoura","doi":"10.1109/ICDE.1986.7266222","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266222","url":null,"abstract":"Performance of a reliable storage subsystem for a centralized database system was studied by simulation. The reliable storage subsystem studied consists of three redundant disk units that are updated one at a time from a consistent database state to another consistent database state. Thus, even if a central processor and/or one disk unit fail simultaneously, at least one disk unit will contain a consistent database state. Redundant multiple disk units allow simultaneous processing of multiple read operations. Our simulation result shows that when all transactions are read-only transactions, the throughput of a three-unit system is 2.5 times higher than that of a single-unit system. On the other hand, redundant disk units slows down write operation because each disk unit must be updated for each virtual page updated. The major result in this paper shows that this adverse effect can be mitigated if updates of multiple transactions are merged and if an efficient disk scheduling policy (e.g., CSCAN) is employed. When the ratio of write operations to read operations is between 10 to 30%, the throughput of the three-unit system is still 89 to 144% higher than that of the single-unit system, which is not reliable. This result is significant when we consider that the performance of a reliable storage subsystem based on logging cannot exceed that of a single-unit storage subsystem.","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":"125033798","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":"Estimating temporary files sizes in distributed realtional database systems","authors":"T. Chao, C. Egyhazy","doi":"10.1109/ICDE.1986.7266200","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266200","url":null,"abstract":"The estimated sizes of temporary files are one of the most important statistics used by an Optimizer in generating a minimum cost processing strategy. Statistical information is the primary input to the estimation technique. The amount of statistics kept concerning the key attributes and the distribution of data values within a domain in a relation will greatly affect the accuracy of the estimates. However, the cost of storing this information may outweigh its value. Ultimately such a determination is left to those responsible for designing and implementing distributed realtional DBMSs. This paper presents a new method to calculate temporary files sizes. It also describes specific data structures and algorithms to implement the proposed method. The major tools suggested are a Log File and several specialized data matrices. The latter contain information unique to each relation. The Log Files is a posting files that records the number of occurrences of different values in the database.","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":"128887122","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":"Security of statistical databases compromise through attribute correlational modeling","authors":"M. Palley","doi":"10.1109/ICDE.1986.7266207","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266207","url":null,"abstract":"Statistical databases seek to provide accurate aggregate information to legitimate users, while protecting the confidentiality of individuals' information. This study develops, defines, and applies a statistical technique for the compromise of confidential information in a statistical database. Attribute Correlational Modeling (ACM) recognizes that the information contained in a statistical database represents real world statistical phenomena. As such, ACM utilizes the correlational behavior existing among the database attributes in order to compromise confidential information. The technique is applied to the 1980 U.S. Census Database and is found to be effective as a compromise tool. The contribution of the study is additional knowledge of the degree of security of confidential statistical databases. Knowledge of additional threats to security may lead to the eventual ability to identify high privacy risk databases, and possibly to reduce that degree of risk.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"2 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":"127923645","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":"Load control and load balancing in a shared database management system","authors":"A. Reuter","doi":"10.1109/ICDE.1986.7266220","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266220","url":null,"abstract":"In shared database management systems, there is a need for dynamically setting a large number of operational parameters, like transaction routing tables, assignment of central resources, multiprogramming level, etc. It is shown that static techniques as they are applied in current centralized DBMSs are inadequate for exploiting the performance potential of a shared DBMS. We therefore plead for using dynamic load control methods for adaptive modification of the DBMS's operational parameters. After a brief survey of the state of the art in database load control, we outline an approach for load balancing in a shared system, which consists of both analytic models and heuristics. The key concepts are illustrated by a simple example, and a number of areas for future research are identified.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"582 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":"123168359","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 multi-backend database system for performance gains, capacity growth and hardware upgrade","authors":"S. Demurjian, D. K. Hsiao, J. Menon","doi":"10.1109/ICDE.1986.7266261","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266261","url":null,"abstract":"Traditional database systems have long been plagued by performance problems when there is either an increase in the mainframe usage or in the database applications. Solutions to these problems have been sought, first, by offloading the database system from the mainframe computer to a single, dedicated backend computer. The backend computer has its own disk storage, is used to perform all of the database operations, and interacts with the mainframe. However. database systems with this software single-backend approach still encounter the performance problems when either the backend usage or database applications increase. The software multiple-backend approach to database management and hardware upgrade is therefore proposed to overcome the performance-gains and capacity-growth problems of either traditional mainframe-based database systems or conventional software single-backend database systems. In this paper we specify the design requirements and issues of the software multi-backend database systems. We show how these requirements and issues affect the design and implementation of a multi-backend database system known as MBDS. Since MBDS is designed specifically for performance gains, capacity growth, and hardware upgrade, we benchmark MBDS in order to verify whether its design and implementation can indeed relate the gains and growth directly to the multiplicity of backends in terms of the response-time reduction and invariance.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"30 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":"122299788","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 relation-partitioning approach to processing star queries in distributed databases","authors":"C. Wang, Victor O. K. Li","doi":"10.1109/ICDE.1986.7266202","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266202","url":null,"abstract":"In a distributed database system, query processing involves considerable amount of data transmission among different computer sites. Since communication delay is substantial, minimizing inter-site data transmissions becomes an important issue. In this paper, we propose an abstract relation-partitioning approach to the distributed query processing problem. This approach transforms a query processing problem into a pseudo query processing problem, solves the query processing problem in the pseudo space, and then transforms the solution back to the original solution space. We then apply this method to derive optimal algorithms for star queries.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"26 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":"116624315","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}