{"title":"A word-parallel, bit-serial signature processor for superimposed coding","authors":"Lee","doi":"10.1109/ICDE.1986.7266240","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266240","url":null,"abstract":"The design of a word-parallel, bit-serial (WPBS) signature processor for searching superimposed codes is presented. The WPBS signature processor is based on a transposed file organization and is optimal in the sense that the smallest possible amount of data is read. As such, it performs much faster than the word-serial, bit-parallel (WSBP) signature processor proposed in the literature. In addition, it can easily accommodate signatures of different lengths in the same signature store. This feature is important in utilizing the signature store efficiently but difficult to implement with a WSBP architecture. We also discuss the implementation of the processor with magnetic bubble memory.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"9 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":"115133270","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 virtual database interface for ADA applications","authors":"Zeynep Kamel, Don Vines","doi":"10.1109/ICDE.1986.7266257","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266257","url":null,"abstract":"This paper describes a virtual database interface for Ada applications. The interface itself is written in Ada. It provides Ada applications with the data manipulation and concurrency control capabilities of a production quality DBMS. It isolates all DBMS sensitive characteristics from the applications by the use of Ada abstract data types. It is accomplished without changing the Ada language definition.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"76 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":"115693502","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}
M. Templeton, David Brill, Arbee L. P. Chen, S. Dao, E. Lund
{"title":"Mermaid — Experiences with network operation","authors":"M. Templeton, David Brill, Arbee L. P. Chen, S. Dao, E. Lund","doi":"10.1109/ICDE.1986.7266233","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266233","url":null,"abstract":"AIDA is a distributed data management (DDM) front-end system which runs on top of existing databases stored in different data management systems (DBMSs). It appears to the user to be a distributed DBMS, although many of the DBMS functions are actually provided by the underlying DBMS. It currently runs above three relational DBMSs, the IDM database machine connected to a VAX, Ingres on two Suns, and Mistress on a third Sun. One of the key components of the AIDA system is Mermaid which provides query optimization, networking, and system control. Mermaid required research into query optimization where the costs of operations on the different processors and DBMSs is variable, the network cost is variable, and capabilities of the different DBMSs is variable. We extended existing distributed query optimization algorithms to support replicated and fragmented relations. In this paper, we discuss our experiences with the development and testing of the Mermaid system and with the integration of Mermaid with the AIDA translator. We discuss the types of commands, the system controller, and our experiences with distributed debugging. Then we give the results of our initial performance tests.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"17 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120809153","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":"Optimal granularity and degree of multiprogramming in a distributed database system","authors":"K. H. Pun, G. Belford","doi":"10.1109/ICDE.1986.7266201","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266201","url":null,"abstract":"The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (maximum number of transactions allowed to run concurrently) for a single-site database system (SDBS) using a locking mechanism for concurrency control have been investigated by many researchers, but the case for a distributed database system (DDBS) has not been examined. Using a simulation model, we study the problem for a DDBS in various application and system environments. In particular, we have considered: the preclaim, and the claim-as-needed locking policies; three different granule placements; two different transaction sizes; and two different communication delays. Conclusions concerning the optimal choices of granularity and the degree of multiprogramming in different environments are then drawn to provide guidelines in achieving good performance in a DDBS.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"156 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":"127361213","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":"Inclusion dependencies in database design","authors":"H. Mannila, Kari-Jouko Räihä","doi":"10.1109/ICDE.1986.7266283","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266283","url":null,"abstract":"A design methodology for relational databases is developed. The main aspects of the methodology are the following. (a) It uses functional dependencies and inclusion dependencies. The latter are essential to model properly e.g. isa-relationships. (b) It is incremental: the database scheme evolves step by step as new information is considered. (c) It is based on an interaction between the designer and a tool that implements the methodology. The basis of the methodology is a normal form for schemes with functional dependencies and inclusion dependencies. Transformations for incrementally changing a scheme into normal form are given.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"61 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":"129949098","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":"Deductive database system based on unit resolution","authors":"H. Yokota, Sko Sakai, H. Itoh","doi":"10.1109/ICDE.1986.7266226","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266226","url":null,"abstract":"This paper presents a methodology for constructing a deductive database system consisting of an intensional processor and a relational database management system. A setting evaluation approach is introduced. The intensional processor derives a setting from the in-tensional database and a given goal and sends the setting and the relationship between setting elements to the management system. The management system performs a unit resolution with setting using relational operations for the extensional databases. An extended least fixed point operation is introduced to terminate all types of recursive queries.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"34 6 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":"129150367","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":"Modeling mechanical CAD data with data abstraction and object-oriented techniques","authors":"D. Spooner, Michael A. Milicia, D. Faatz","doi":"10.1109/ICDE.1986.7266248","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266248","url":null,"abstract":"This paper focuses on the problem of management of CAD data by investigating the use of the software engineering principles of data abstraction and object-oriented programming as means for managing the volume and complexity of design data. It discusses how a data management system which manages abstract data types provides a framework for integrating a CAD environment by providing a single mechanism to manage data, programs, and the manipulation of the data with the programs. It also shows how two forms of abstraction, aggregation and generalization, can be used to model hierarchies of parts and components, and multiple design alternatives, respectively. These abstractions are then used to model the geometrical and topological data required to describe three-dimensional mechanical parts.","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":"129431813","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 dynamic tree-locking protocol","authors":"A. Croker, D. Maier","doi":"10.1109/ICDE.1986.7266205","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266205","url":null,"abstract":"The tree-locking protocol proposed by Silberschatz and Kedem5 guarantees transaction schedules that are both serializable and deadlock-free. The tree-locking protocol assumes the existence of a partial order defined over all of the objects in a database. Requiring all transactions to be tree-locked with respect to this single partial order limits the degree of concurrency obtainable in a database system by increasing the potential for conflict between transactions. In this paper we define a new locking protocol that is derived from the tree-locking protocol, but allows a changing set of partial orders to be defined over the objects in a database. We call this protocol dynamic tree-locking.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"58 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":"114350316","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":"Performance evaluation of relational databases in a corporate environment","authors":"Cho Fong To, John K. Chan, Jocelyn S. Yu","doi":"10.1109/ICDE.1986.7266280","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266280","url":null,"abstract":"This paper presents a method of testing relational product performance that is specifically oriented to a corporate environment with very large volume data handling needs. The methodology is detailed and the configuration of the assessment environment is presented. The actual implementation of the assessment, in both VM and MVS, is discussed. Preliminary results are given. Finally, the benefits of conducting such a product assessment for this specific corporate environment are presented.","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":"132486917","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}
C. L. Viet, Mark D. Yanike, Eric J. Johnson, E. J. Byrne
{"title":"Design and implementation of a relational database server in a heterogeneous network enviroment","authors":"C. L. Viet, Mark D. Yanike, Eric J. Johnson, E. J. Byrne","doi":"10.1109/ICDE.1986.7266279","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266279","url":null,"abstract":"This paper discusses the architecture and application program interface of a relational database server. A database server provides database access services such as ad-hoc query, database update, database creation, database administration support, etc. These services are provided to multiple application programs running on one or more networks of heterogeneous host computers. A prototype database server consisting of a relational database machine and a front-end query processor was implemented in a HYPERchannel network environment. The requirements and design of the prototype and some initial applications of the database server are discussed.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"100 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":"133378774","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}