Jeffrey J. Folinus, S. Madnick, Howard B. Schutzman
{"title":"Virtual information in data-base systems","authors":"Jeffrey J. Folinus, S. Madnick, Howard B. Schutzman","doi":"10.1145/983070.983071","DOIUrl":"https://doi.org/10.1145/983070.983071","url":null,"abstract":"This paper examines the concept and implications of virtual information in data base systems. Virtual information is any fact which does not physically exist in the data base, but is nonetheless accessible through combinations of algorithms and other data. Physically recorded information is only one of a number of ways to obtain information from a data-base system. Viewing an information system as a collection of functions shows that pure data and pure algorithm from the endpoints of a spectrum of ways function values can be realized, with the middle range being various types of virtual information. Several classes of virtual information are identified, and their usefulness is examined to show the appropriateness of the concept in a data-base system. Finally, the model is evaluated in light of the implications of virtual information for inference and automatic restructuring within a data base.","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124636621","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":"Comments on the debate: data-structure-set versus relational","authors":"J. Clymer","doi":"10.1145/984403.984406","DOIUrl":"https://doi.org/10.1145/984403.984406","url":null,"abstract":"In the belief that it might be worthwhile for someone to attempt a summary of the \"Great Debate,\" I have tried to set down my own observations and wlll pass them on to you for whatever they may be worth. Suppose we consider that there wlll be three supported interfaces to future data base systems, and describe these suggestively as an End User Interface, an Application Programmer Interface, and a Systems Programmer Interface. Table 1 shows how these might very roughly be characterized. (Note: By systems programmer I am referring to the data base management system and not to the operating system.) There seems to be little argument that the End User Interface should have a basically relational view, or that some form of network view will be required for the Systems Programmer Interface. This is because the concept of independence from logical data structure more or less implies the relational view for the higher level~, and the requirement to eliminate redundancy from the stored data more or less implies a network view for the lower level. I gather, then that the central thrust of the debate is over what form the Application Programmer Interface should take. This does seem to be a substantive issue, and not merely a \"religious\" argument. Dr. Codd's position seems to be that the application programmer should be able to request data In relational terms and have it supplied by the data management facility into his work area, where he may then operate upon it in. whatever fashion he wishes; or that he be able to call upon the data management facility to take data from his work area described in relational terms and store it into the data base. To the extent that the data base contains linkages and indices required to reduce redundancy and improve efficiency, it will be the responsibility of the data management facility to manage these, and they should be essentially invisible to the application programmer. In this way the viewpoint of the application programmer and the end user will be essentially the same, and communication between them will be easy. The task of the application programmer will be reduced and he will make fewer mistakes because he will not have to be concerned with how he acquires the data he wants to manipulate, but only with its specification.","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367567","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 practitioner's view of relational data base theory","authors":"T. Olle","doi":"10.1145/984403.984404","DOIUrl":"https://doi.org/10.1145/984403.984404","url":null,"abstract":"The following paper represents a lightly edited version of Chapter 23 of my tutorial text \"The CODASYL Approach to Data Base Manage-ment\" to be published by John Wiley & Sons. This explains the tutorial style of the prose. The main aim of the chapter, however , is to analyze the differences and similarities not only between the CODASYL approach and the relational approach, but also between the latter approach, and IMS and TOTAL. These two systems are also each given a chapter in the textbook. Analysis shows that CODASYL and relationalism are in many ways closer to each other than either is to TOTAL or IMS. The acceptability of the constraints implied in the relational approach is accessed from a practitioner's perspective. Any comments on this analysis, either in the open pages of FDT or any private to the author, will be welcomed and addressed through the same media. i. Back@round There are three well known approaches to data base management which are commercially viable and in wide use among commercial installations all over the world. These are CODASYL, IMS and TOTAL. In this paper, we turn attention to an approach to data base management which is being widely studied among the academic fraternity and among the more research oriented in government and commercial organizations. The relational approach evolved in a series of papers by Codd (1,2) in 1971, although the number of papers on this topic which have been published is quite vast. For a good comprehensive overview of what relationalism is all about, a recent book by Date (6) is recommended. It must be emphasized that the relational approach is essentially a theory on which a number of experimental systems have been based. Rather than select one of these systems for presentation, we shall in this paper present the elements of the theory in such a way that explicit comparison with the CODASYL approach is facilitated, as well as a lesser degree of comparison with IMS and TOTAL.","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134028568","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 research: some comments on future directions","authors":"W. T. Hardgrave, E. Sibley","doi":"10.1145/984403.984405","DOIUrl":"https://doi.org/10.1145/984403.984405","url":null,"abstract":"1.0 The need for a Formalism for Database Analysis We have only to look at the 1974 Debate on Data Models (i) to see that there is no common basis for communicating ideas about database concepts. Each year we see dozens of articles proposing new data models, new database designs, and new techniques. Each paper describes the innovation, gives a sample database and application and argues that this new approach will solve the stated problem. Usually references are given to previous work, but rarely does an article even attempt to present a rigorous comparison of a new data model with an existing and accepted data model. The omission of adequate comparisons is not the fault of the authors individually; they have no tools for comparision. The problem is the lack of an accepted formalism for describing and comparing database requirements and database systems. The s~tuat~on may be remedied (to a large extent) by the selection of a common formalism for describing and documenting data models. Most sciences use mathematics in their discussions, and there have already been suggestions that we use mathematics in data modelling: e.g. J. T. Schwartz (2) says: \". .... one aspect of the data base situation seems to me not to pose significant difficulties at all. This nonproblem is the choice, at the abstract level, of sufficiently powerful modes of expression. Data base problems are generally quite simple from the logical point of view and easily formulated in set theoretic terms.\" As other examples: Codd (3,4) has presented most of his work in terms of set theory; Sibley (5) in the 1974 SIGFIDET (SIGMOD) Workshop uses set theory extensively as a metalanguage for describing data/storage management structures; graph theory is formally described in set theoretic terms. It therefore seems natural to propose mathematical set theory as the formalism for database analysis. 1.1 The CODASYL DBTG Data Model as an example One data model that has not been described in mathematical terms is the CODASYL DBTG (6) model. Although this model has been proposed as a standard, it is not yet clear whether the \"DBTG SET\"","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122510542","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":"Another look at data-bases","authors":"N. Minsky","doi":"10.1145/983082.983084","DOIUrl":"https://doi.org/10.1145/983082.983084","url":null,"abstract":"A data base is often viewed as a kind of glorified file which allows for the storage of complex data strucutures, and which can be shared by many users who have different needs. But there is a more fundamental difference between databases and files then just the complexity of data or the generality of its retrieval. The traditional file is essentially a passive collection of coded data which is devoid of any intrinsic meaning. Indeed the interpretation of the data stored in a file is entirely up to its users. The database , on the other hand, is usually used as a model, or representation, of some system in the real world. For example, a corporate data base is, in some sense, a model of a corporation; and it must reflect some of its structual and behavorial properties. This is not just a matter of recording correctly everything which happens within the corporation. For example, when we \"tell\" the DB that an employee is fired, we expect all necessary adjustments to be made automatically, so that only current employees will be on the payroll of the corporation at every moment in time. In short, we expect a DB to \"take care of itself\" to a certain extent; it therefore cannot be a completely passive collection of data. But if a database may contain procedural components and not just data, what kind of thing is it? In what way is it different from what we usually call pro-grams? (It might have never occurred to the reader to compare databases with programs, but as we will show later the two concepts have more in common than meets the eye.) In an attempt to clarify the concept of database I will now offer a definition for it. The definition is an oversimplification, as any definition of such a fuzzy concept must be; it will emphasize certain characteristics of databases , at the expense of other, equally important, properties. Definition: A database is a model (or representation) of some system in the real world, which satisfies all of the following properties : (a) The model contains a large amount of coded information. (b) It has a long life time (say, from several days to several years). (c) The model can be examined and interrogated at any moment of its life time. (d) The model changes primarily in response to operations applied to it from …","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594078","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":"Opportunities for data base reorganization","authors":"B. Shneiderman","doi":"10.1145/983082.983083","DOIUrl":"https://doi.org/10.1145/983082.983083","url":null,"abstract":"If the contents of the data base are volatile, automating the process does not eliminate the need for reorganization. In fact, the minor inefficiencies which could be tolerated with small files are a costly burden in the massive data bases which are increasingly common. There are numerous techniques for improving data base performance; this paper is concerned with the process known as reorganization. Reorganization is the rewriting of fields of data in such a way that the logical and physical accessing algorithms are unaffected (although the access paths may be altered) except that they now operate more economically. Economics include saving of storage space or execution time or both. In on-line systems there is the additional motivation of reducing the response time.","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115332032","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":"Bringing data base technology to the programmer","authors":"W. L. Honig","doi":"10.1145/983076.983077","DOIUrl":"https://doi.org/10.1145/983076.983077","url":null,"abstract":"This paper reports work toward melding some ideas from data base management with currently popular views of structured programming. The basic idea is to allow all data structures used inside programs (instead of just those in an external data base) to be described at multiple conceptual levels by a separate definition. This approach brings to programmers the benefits of data independence and also allows structured programming to have its hitherto unrealized full effect on data.","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123034360","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":"Review: proceedings of the fourth annual computer related information system symposium","authors":"J. Rothnie","doi":"10.1145/983076.983080","DOIUrl":"https://doi.org/10.1145/983076.983080","url":null,"abstract":"","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"51 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130263782","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":"Summary of current work ANSI/X3/SPARC/study group: database systems","authors":"C. Bachman","doi":"10.1145/983076.983078","DOIUrl":"https://doi.org/10.1145/983076.983078","url":null,"abstract":"In late 1972, SPARC (the Standards Planning and Requirements Committee of ANSI/X3) established the Study Group -Database Systems to review the current state of development in the database systems field with objective to determining whether standardization activities were appropriate. The Committee was charged with preparing \"SPARC 90's\" for each identified area. Loosely speaking, a SPARC 90 is a document which identifies a proposed area of standardization and develops for that area a recommendation as to what action should be taken. Part of that recommendation is technical, other parts deal with the social and economic justification for the action. For a detailed description of a SPARC 90, refer to document No. X3/SPARC/90, dated April i0, 1972, entitled \"Guideline for Presenting a Proposal...\"","PeriodicalId":123835,"journal":{"name":"FDT Bull. ACM SIGFIDET SIGMOD","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128141640","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}