{"title":"A visual tool for managing relational databases","authors":"A. Benjamin, Karl M. Lew","doi":"10.1109/ICDE.1986.7266275","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266275","url":null,"abstract":"Although the relational approach to databases has been revolutionary in terms of the conceptual simplicity it affords when designing database Schemas and their attendant applications, the task of implementing and managing a relational database is still very much a burden for the database administrator. In particular: 1) communication with the database system is usually restricted to primitive, teletype interfaces, 2) abstractions used by the DBA (e.g. default joins, default constraints, column domains, etc.) are not inherently supported by existing database systems, and 3) there are no safeguards against inadvertent catastrophic data dictionary modification. The Metaphor DBA Tool addresses these issues by providing a visual interface to the database data dictionary. It is, in essence, a specialized editor for the abstractions familiar to the DBA. Categories (i.e. collections of tables). Tables and Columns have specific screen depictions; relationships between objects are established by lines drawn between them. The DBA can create, modify, and display the structure of the database by manipulating these graphical objects.","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":"121562378","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":"On denial-of-service in computer networks","authors":"Virgil D. Gllgor","doi":"10.1109/ICDE.1986.7266268","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266268","url":null,"abstract":"The problem of denial of service and some of Its properties are reviewed. Some common misconceptions about denial of service are explained. Although fundamental changes to the notion of denial of service are unwarranted by use of computer networks, new and novel Instances of the problem appear. Research directions for solutions to the denlal-of-servlce problem are suggested.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"40 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":"114783750","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 UNIX-based Gist specification processor: The system factory experience","authors":"A. Castillo, Sean Corcoran, W. Scacchi","doi":"10.1109/ICDE.1986.7266265","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266265","url":null,"abstract":"The Gist specification language emerged at USC/ISI from more than five years of research into the development of operational specification languages and environments. We designed and implemented a Gist processor through extensive utilization of language development tools and a relational database management system available in a UNIX environment. We describe the architecture of this UNIX-based Gist language processor and investigate the process of system specification by examining usage of Gist language constructs in specifying nine software projects. This paper provides a preliminary empirical assessment of the system specification effort using Gist, and outlines directions for enhancements to the processor. To our knowledge, this is the first such analysis of a formal specification language.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"49 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":"125146882","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":"Towards an implementation of database management systems with temporal support","authors":"I. Ahn","doi":"10.1109/ICDE.1986.7266242","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266242","url":null,"abstract":"There are several issues to be investigated for implementation of database management systems with temporal support. Examples are the types of databases in terms of temporal support, handling of ever-growing storage size, use of optical disks, representation of temporal versions into physical storage, and efficient access methods for both temporal and non-temporal queries. This paper discusses characteristics of tuple versioning vs. attribute versioning, two distinct representation schemes for temporal versions. It then presents various forms of two level storage structures tailored for databases with temporal support.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"51 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":"124135896","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":"Some performance results on recursive query processing in relational database systems","authors":"Jiawei Han, Hongjun Lu","doi":"10.1109/ICDE.1986.7266260","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266260","url":null,"abstract":"The processing of recursive queries in relational database systems poses a great challenge in research on expert database systems. This paper uses both analytical and experimental methods to investigate the performance of several different algorithms in processing a recursive query in first-order recursive databases. The analytical method estimated the I/O and CPU cost and the storage needed in processing recursive queries. The experimental tests were performed on a synthetic relational database built on top of WISS (Wisconsin Storage System) on VAX 11/750. Both analytical and experimental results indicate that for efficient recursive database processing it is important to apply the following heuristics: performing selection first, making use of wavefront relations, and grouping those joins which reduce the size of intermediate results. The termination conditions for recursive queries are also discussed in the paper.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"87 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":"126332471","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 bucket accesses: A practical approach","authors":"Alle IJbema, H. Blanken","doi":"10.1109/ICDE.1986.7266203","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266203","url":null,"abstract":"In optimizing database queries one inevitably encounters two important estimation problems. The first problem is to estimate the number of page accesses when selecting k tuples from a relation. The other problem is to estimate the number of different equijoin values remaining after selecting k tuples from a relation. The estimated values strongly depend on how the tuples are distributed over the pages (first problem) and how the equijoin values are distributed over the relation (second problem). It appears to be possible to find restrictive upper and lower limits for these problems in many practical situations. Results derived elsewhere appear to fall significantly outside these limits. Finally, a (time) efficient algorithm to approximate the values to be estimated, is proposed.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"72 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":"128951446","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 office by example (D-OBE)","authors":"E. Kantorowitz, F. Maryanski, D. Shasha","doi":"10.1109/ICDE.1986.7266218","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266218","url":null,"abstract":"The D-OBE (Distributed Office By Example) language for distributed office information systems is introduced. D-OBE is an extension of the OBE (Office By Example) and QBE (Query By Example) languages. A major problem was the design of a language simple enough for office workers and yet sufficiently powerful to handle the many facilities of a distributed office system. It is suggested that D-OBE achieves these goals by employing the proven user friendly QBE interface. Surprisingly few extensions to QBE were needed. The states of the servers are presented to the user as QBE tables that are manipulated by the familiar QBE operations. Another problem was to design D-OBE such that it would fit ‘any’ office. D-OBE is based on the observation that large offices divide their tasks among departments. Each department is made responsible for accomplishing its tasks, and is given control over the facilities to do it. A department will thus control its ‘D-OBE cluster’, which is a number of workstations connected to a database, mail, hardcopy and name server. Such a cluster may cooperate with other clusters. The use of logical ports help to reconfigure the network as the structure and goals of the office evolve. A naming server provides the ‘yellow pages’ of the network services. D-OBE identifies for each data object, workstation and server the person responsible for its proper handling.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"23 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":"128579447","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 of new types in relational data base systems","authors":"M. Stonebraker","doi":"10.1109/ICDE.1986.7266230","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266230","url":null,"abstract":"This paper explores a mechanism to support user-defined data types for columns in a relational data base system. Previous work suggested how to support new operators and new data types. The contribution of this work is to suggest ways to allow query optimization on commands which include new data types and operators and ways to allow access methods to be used for new data types.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"74 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":"115884318","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":"Database integration in a distributed heterogeneous database system","authors":"Y. Breitbart, P. Olson, G. Thompson","doi":"10.1109/ICDE.1986.7266234","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266234","url":null,"abstract":"This paper describes the approach to database integration in a heterogeneous distributed database environment utilized by the Amoco Distributed Database System (ADDS). We start with the definition of the extended relational data model that is used by ADDS for database integration. We demonstrate various aspects of resolving possible data conflicts occurring in the database integration process. The ADDS query and data definition languages are defined and their expressive power is discussed. We conclude with presentation of a query conversion algorithm to convert a user data request into a set of queries against supported physical databases.","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":"124296719","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":"Assessment of data management security technology for military requirements","authors":"V. L. Rebbapragada","doi":"10.1109/ICDE.1986.7266270","DOIUrl":"https://doi.org/10.1109/ICDE.1986.7266270","url":null,"abstract":"The purpose of this paper is to assess recent developments in data management security technology in the context of tactical database systems requirements, to focus on key issues, and to serve as a catalyst for further investigation and discussion. Survivability and security are the two key issues that must be addressed in addition to functionality and performance in tactical database systems. While there has been a significant advancement in data management technology over the past few years, the benefits of this technology found limited applicability in the military environment because of the unique security requirements imposed by the tactical applications on battlefield automated systems.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"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":"131446314","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}