DOCSLIB.ORG

Comparison and Mapping of the Relational and Codasyl Data Models -- an Annotated Bibliography

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Comparison and Mapping of the Relational and Codasyl Data Models -- an Annotated Bibliography COMPARISON AND MAPPING OF THE RELATIONAL AND CODASYL DATA MODELS -- AN ANNOTATED BIBLIOGRAPHY Gary H. Sockut Institute for Computer Sciences and Technology National Bureau of Standards Washington, DC 20234 Two of the best-known data models are the Computing Surveys, ACM, vol. 8, no. relational model and the CODASYL model ], Mar. 1976, pp. 43-66. (sometimes called the DBTQ, network, or data structure set mode]~ . There have E. F. Codd, "A Relational Model of been many efforts at comparing the two Data For Large Shared Data Banks", mode3s and at defining mappings between Commun. ACM, vol. 13, no. 6, June them. The publications 3isted in this i~, pp. ~77-387. bibliography describe some o~ these efforts and some related topics. I invite For background on the CODASYL model, see readers' suggestions for additional sources such as: entries for possible inclusion in a future bibliography. % omit publications on the CODASYL Data Description Language more general topic of data base Committee, "Journal of Development", conversion. Materiel Data Management Branch, Dept. of Supply and Services, Following each reference, I describe the Canadian Govt., Hull, Que., Canada, publication briefly, usually by quoting Jan. 1978. parts of the author's abstract and/or main text. Often I supplement or replace the C0DASYL Programming Language author's text with my own words, enclosed Committee, "Data Base Task Group in brackets ([]). I do not guarantee that Report", ACM, Apr. 1971. an author's abstract accurately reflects the content of the publication. R. w. Taylor and R. L. Frank, "CODASYL Data-Base Management I do not evaluate the publications, nor do Systems", Computing Surveys, ACM, I guarantee the truth of their statements. vo]. 8, no. I, Mar. 197~, pp. 67-103. Each publication may reflect its author's opinions. Also, because specifications For background on both models, see sources have evolved over the last ten years, some such as: statements may be out of date. The bibliography reveals that the authors have C. J. Date, An Introduction to not reached consensus on equivalence of Database Sys'-~ems, 2nd ed~, the models, nor on the models' relative Addison-Wesley, R~ing, MA, 1977. merits, nor on the spelling of "data base". J. Martin, Computer Data-Base Organization, 2n~--e~., Prent~'~6~Ha~[ The mention or lack o~ mention of specific Eng]ewood Cliffs, NJ, 1977. commercial products does not imply endorsement or disapproval by the National I thank John Berg, Joe Collica, Don Bureau of Standards. Deutsch, Dennis Fife, Liz Fong, Len Gallagher, Alan Goldfine, Terry Hardgrave, The reader should have some Familiarity Be1 Leong-Hong, Chuck Sheppard, and Ben with data base management and with the two Shneiderman, whose libraries I raided models. For background on the relational innumerable times while amassing this model, see sources such as: bibliography. Terry Hardgrave and Matt Koll reviewed a draft of this paper. D. D. Chamberlin, "Relational Several authors helped me obtain Data-Base Management Systems", publications. CONTRIBUTION OF THE NATIONAL BUREAU OF The annotated bibliography follows: Sm~NDARDS. NOT SUBJECT TO COPYRIGHT. 55 - M. Adiba and C. De]obel, "The Problem of system which provides a high level the Cooperation Between Different relational data interface". [One D.B.M.S.", G. M. Nijssen (Ed.~ , section of the paper explains that the Architecture and Models in Data Base interface] "is designed in such a way Management- Systems (Proc. IFIP TC-2 that programs can be written on top of Wor~~---Con~ on Modelling in Data Base it to simulate 'navigation oriented' Management Syst., Jan. 1977), database interfaces". "In general our North-Holland, Amsterdam, Neth., 1977 , pp. strategy will be to represent each 1£5-1~6. record type as a relation and to represent information about ordering "We are investigating here the problem and connections between records in the of the cooperation between several form of explicit fields in the DBM~. This cooperation can take place, corresponding relations". [Another for example, via a computer network. section states that an] "important we address ourselves especially to the access path is a binary link". "Binary description of a globa] view of several links are similar to the notion of an data bases". "We have proposed some owner coupled set with manual mechanisms to transform any program membership found in the DBTG written in terms of the global view in specifications". "The main use of programs which can be executed at the binary links in System R is to connect local data base level". [See also child tuples to a parent based on value (Adiba, De]obeY, and L6onard, 1976) and matches in one or more fields". [See (Aaiba and Portal, Igv~)J. also (Lorie and Ni]sson, 1979)]. M. Adiba, C. De]obe], and M. L6onard, "A Auerbach Information Management Series on Unified Approach for Modelling Data in Data Base Management, "A Taxonomy of Data Logical Data Base Design", G. M. Nijssen Structure Models", written by G. C. (Ed.) , Modelling in Data Base Management Everest, Portfolio 21-03-~I, Auerbach Systems (Proc. TFIP TC-2 Wor~g Conf. on Publishers, Pennsauken, NJ, 1979. Modelling in Data Base Management Syst., ]an. ]97~) , North-Holland, Amsterdam, "This Portfolio presents a more Neth., Iq7~, pp. 311-~38. comprehensive taxonomy of data structures; it describes the basic "Here we examine how ... conversion can types of structures, highlighting their be made (in both ways) between network major characteristics and contrasting and relational concepts, using the them through the use of a common DBTG-CODASML and SOCRATE systems as example". [See also (Everest, 1976)]. examples". [See also (Adiba and Delobel, 1977~ and (Adiba and Portal, Igv~)]. C. W. Bachman, "The Data Structure Set Model", in (Rustin, 1974), pp. 1-10. M. Adiba and D. Portal, "A Cooperation "The relational debate, as I see it, is System For Heterogeneous Data Base over style in retrieval languages, and Management Systems", Information Syst., style, really, is only one aspect of a Pergamon Press, Oxford, UK, vol. 3, no. 3, data base system". "I accept the 1978, Pp. ~9-215. relational view and the data-structure-set view as being "We propose here a functional fundamentally compatible as they are architecture of a cooperation system applied in practice, and I'd like to For heterogeneous DBMS in a network demonstrate the equivalence between the environment" [The paper assumes] "the two views". existence of different local data bases already in use under DBMSs like IMS, Codasyl-]ike systems, SOCRATE, C. W. Bachman, "The Role Data Model re]ationa] systems, etc.". "The Approach to Data Structures", Proc. Intl. cooperation system should be able ... Conf. on Data Bases, Heyden, Lon~, UK, to provide facilities for creating and J~y 198~, pp. 1-18. modifying a global view of these local data bases". [See also (Adiba and "This paper examines the Role data Delobel, ]977) and (Adiba, Delobe], and model as an evolutionary step forward L~onard, 19v6)]. in the sequence of data models" [and compares it with other data models]. M. M. Astrahan et a]., "System R: Relationa] Approach to Database C. W. Bachman, "Trends in Database Management", ACM Trans. on Database Syst., Management -- 1975", Proc. Natl. Computer vo]. 1, no. ~, June ~h"~6, pp. 9~-137. Conf., AFIPS, vol. 44, May 1975, pp. ~-576. "System R is a database management - 56 - [One section says] "I consider the data transfer, and a global view of relational model and the different data bases in a distributed data-structure-set model essentially system. The author states that with compatible ann subiect to some restrictions upon the relational transformation From one form to the and CODASYL models], "the 'expressive other". "The relational mode] and the" powers' of the models are equivalent". [data independent accessing mode]] [See also (Borkin, 1978)]. "appear to be completely at odds with each other" "By comparison, the data-structure-set mode] seems to be an J. Bradley, "An Extended Owner-Coupled Set effective hybrid between these two Data Model and Predicate Calculus for extremes". Database Management", ACM Trans. on Database Syst., vol. 3, no. 4, Dec. 197~, pp. 385-416. R. Bell and P. M. D. Gray, "Description of Access Paths for Realising Relations from [In this data model,] "the logical view a CODASYL Database", Research Rep. of the data in the database is AUCS/TR-R~I, Dept. of Computing Sci., U. essentially relational but with the of Aberdeen, Aberdeen, UK, Jan. ]98~. superimposition of the owner-coupled set concept". "Extended Bachman "The ... system generates Fortran diagrams in modified form can easily be programs to retrieve data from a used in the design of relational CODASYL database in the form of databases". relations". "The system generates an internal description of a relation called a 'traversa]', which includes A. F. Cardenas and M. H. Pirahesh, "Data elements representing both algebraic Base Communication in a Heterogeneous Data operators and CODASYL DML commands". Base Management System Network", Information Syst., Pergamon Press, Oxford, UK, "~'?--~, no. l, 1980, pp. 55-79. H. Biller, "On the Equivalence of Data Base Schemas -- A Semantic Approach to "An architectural approach is outlined Data Translation", Information Syst., ... in which any user in any network Pergamon Press, Oxford, UK, v ol. a, no. I, node can be given an integrated and Iq79, pp. RS-4V. tailored view or schema (e.g. hierarchical, relational), while in "The equivalence of data base states reality the data may reside in one and data base schemas is defined". "It single data base or in physically is shown, how a semantic data model and separated data bases, managed data definition language (LDDL) can be individually by the same type of GDBMS used to construct a correct (e.g. CODASYL, IMS, relational) or by specification of a translation different GDBMS".
Load more

Recommended publications
  • IDMS Conversion
    IDMS Conversion The Modern Systems IDMS conversion includes the generation of a new relational database to replace the functionality, set relationships, indexes, and data structures that are currently part of the IDMS network database. The new target database can reside on or off the mainframe, and can use any of the standard relational database management systems (RDBMS): Microsoft SQL Server, Oracle or IBM DB2. Database Functionality DB-Shuttle™ provides The Modern Systems solution provides a complete replacement for all IDMS automated technology database functionality: that protects legacy assets, reduces • IDMS record layouts maintenance costs, • Group-level elements, Occurs and Redefines clauses within IDMS record provides agility and definitions flexibility, and enables • Set definitions (record-to-record relationships) Service-Oriented • System-owned indexes Architecture (SOA) • Bill-of-material structures within business-critical • Multi-member sets, multi-set relationships between two record types applications. • Duplicate CALC designations • Sorted sets, Chained sets and NEXT sets Relational Results The resulting database is fully relational. Primary keys, foreign keys and index definitions are automatically created. All constraints are generated into the resulting DDL. Table spaces, indexes, table names and column names are all generated according to your naming standards. Delivered Components As part of the delivery process, Modern Systems generates and delivers the following component types for installation in the new relational
    [Show full text]
  • Multiple-Aspect Analysis of Semantic Trajectories
    Konstantinos Tserpes Chiara Renso Stan Matwin (Eds.) Multiple-Aspect Analysis LNAI 11889 of Semantic Trajectories First International Workshop, MASTER 2019 Held in Conjunction with ECML-PKDD 2019 Würzburg, Germany, September 16, 2019 Proceedings Lecture Notes in Artificial Intelligence 11889 Subseries of Lecture Notes in Computer Science Series Editors Randy Goebel University of Alberta, Edmonton, Canada Yuzuru Tanaka Hokkaido University, Sapporo, Japan Wolfgang Wahlster DFKI and Saarland University, Saarbrücken, Germany Founding Editor Jörg Siekmann DFKI and Saarland University, Saarbrücken, Germany More information about this series at http://www.springer.com/series/1244 Konstantinos Tserpes • Chiara Renso • Stan Matwin (Eds.) Multiple-Aspect Analysis of Semantic Trajectories First International Workshop, MASTER 2019 Held in Conjunction with ECML-PKDD 2019 Würzburg, Germany, September 16, 2019 Proceedings Editors Konstantinos Tserpes Chiara Renso Harokopio University ISTI-CNR Athens, Greece Pisa, Italy Stan Matwin Dalhousie University Halifax, NS, Canada ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Artificial Intelligence ISBN 978-3-030-38080-9 ISBN 978-3-030-38081-6 (eBook) https://doi.org/10.1007/978-3-030-38081-6 LNCS Sublibrary: SL7 – Artificial Intelligence © The Editor(s) (if applicable) and The Author(s) 2020. This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
    [Show full text]
  • Powerdesigner 16.6 Data Modeling
    SAP® PowerDesigner® Document Version: 16.6 – 2016-02-22 Data Modeling Content 1 Building Data Models ...........................................................8 1.1 Getting Started with Data Modeling...................................................8 Conceptual Data Models........................................................8 Logical Data Models...........................................................9 Physical Data Models..........................................................9 Creating a Data Model.........................................................10 Customizing your Modeling Environment........................................... 15 1.2 Conceptual and Logical Diagrams...................................................26 Supported CDM/LDM Notations.................................................27 Conceptual Diagrams.........................................................31 Logical Diagrams............................................................43 Data Items (CDM)............................................................47 Entities (CDM/LDM)..........................................................49 Attributes (CDM/LDM)........................................................55 Identifiers (CDM/LDM)........................................................58 Relationships (CDM/LDM)..................................................... 59 Associations and Association Links (CDM)..........................................70 Inheritances (CDM/LDM)......................................................77 1.3 Physical Diagrams..............................................................82
    [Show full text]
  • OLAP, Relational, and Multidimensional Database Systems
    OLAP, Relational, and Multidimensional Database Systems George Colliat Arbor Software Corporation 1325 Chcseapeakc Terrace, Sunnyvale, CA 94089 Introduction Many people ask about the difference between implementing On-Line Analytical Processing (OLAP) with a Relational Database Management System (ROLAP) versus a Mutidimensional Database (MDD). In this paper, we will show that an MDD provides significant advantages over a ROLAP such as several orders of magnitude faster data retrieval, several orders of magnitude faster calculation, much less disk space, and le,~ programming effort. Characteristics of On-Line Analytical Processing OLAP software enables analysts, managers, and executives to gain insight into an enterprise performance through fast interactive access to a wide variety of views of data organized to reflect the multidimensional aspect of the enterprise data. An OLAP service must meet the following fundamental requirements: • The base level of data is summary data (e.g., total sales of a product in a region in a given period) • Historical, current, and projected data • Aggregation of data and the ability to navigate interactively to various level of aggregation (drill down) • Derived data which is computed from input data (performance rados, variance Actual/Budget,...) • Multidimensional views of the data (sales per product, per region, per channel, per period,..) • Ad hoc fast interactive analysis (response in seconds) • Medium to large data sets ( 1 to 500 Gigabytes) • Frequently changing business model (Weekly) As an iUustration we will use the six dimension business model of a hypothetical beverage company. Each dimension is composed of a hierarchy of members: for instance the time dimension has months (January, February,..) as the leaf members of the hierarchy, Quarters (Quarter 1, Quarter 2,..) as the next level members, and Year as the top member of the hierarchy.
    [Show full text]
  • Miami-Dade County
    MIAMI-DADE COUNTY Cognos Business Analytics and IDMS Integration at Miami-Dade County Abstract of the Program Miami-Dade County led the way as the first company in the world to successfully extract information from a CA IDMS network database using IBM Cognos Business Analytics. Miami- Dade County stores the majority of their critical data, such as Criminal Justice, Payroll, Traffic and Building information in CA IDMS mainframe databases and traditionally extracts this data using Computer Associates CA IDMS tools (CA ADS ADS/O and IDMS/Cobol/IDMS). Through the collaboration of CA Computer Associates, IBM, and Miami-Dade County, a driver was created for IBM Cognos to access this data directly by using Business Analytics tools without the need for exporting the data into a contemporary distributed environment. The problem or need for the program IDMS (Integrated Database Management System) is primarily a network (CODASYL) database management system for mainframes. Only CA tools could access IDMS data. IDMS mainframe technology did not have the capability to be accessed directly by contemporary business analytics software solutions. This limitation required data extraction, file transfer protocols, and script loading processes to expose IDMS, IMS, and DB2 mainframe data to contemporary technologies, including business analytics tools like IBM Cognos Analytics. Multiple data warehouses and operational data stores are loaded from the primary data sources originating from the IDMS mainframe platform and other relational data sources. More than 50 production IDMS databases are actively supported and used county-wide at Miami- Dade County. Access to data by the distributed world such as making the data available on an Oracle or MSSQL database requires adding multiple intermediate steps, using multiple technologies, and multiple points of failure to migrate data and make it available to analytic technologies.
    [Show full text]
  • On Active Deductive Databases
    On Active Deductive Databases The Statelog Approach Georg Lausen Bertram Ludascher Wolfgang May Institut fur Informatik Universitat Freiburg Germany flausenludaeschmayginfo rmat ikun ifr eibur gde Abstract After briey reviewing the basic notions and terminology of active rules and relating them to pro duction rules and deductive rules resp ectively we survey a number of formal approaches to active rules Subsequentlywe present our own stateoriented logical approach to ac tive rules which combines the declarative semantics of deductive rules with the p ossibility to dene up dates in the style of pro duction rules and active rules The resulting language Statelog is surprisingly simple yet captures many features of active rules including comp osite eventde tection and dierent coupling mo des Thus it can b e used for the formal analysis of rule prop erties like termination and expressivepo wer Finally weshowhow nested transactions can b e mo deled in Statelog b oth from the op erational and the mo deltheoretic p ersp ective Intro duction Motivated by the need for increased expressiveness and the advent of new appli cations rules have b ecome very p opular as a paradigm in database programming since the late eighties Min Today there is a plethora of quite dierent appli cation areas and semantics for rules From a birdseye view deductive and active rules may b e regarded as two ends of a sp ectrum of database rule languages Deductive Rules Production Rules Active Rules higher level lower level stratied well RDL pro ARDL Ariel Starburst Postgres
    [Show full text]
  • Multidimensional Network Analysis
    Universita` degli Studi di Pisa Dipartimento di Informatica Dottorato di Ricerca in Informatica Ph.D. Thesis Multidimensional Network Analysis Michele Coscia Supervisor Supervisor Fosca Giannotti Dino Pedreschi May 9, 2012 Abstract This thesis is focused on the study of multidimensional networks. A multidimensional network is a network in which among the nodes there may be multiple different qualitative and quantitative relations. Traditionally, complex network analysis has focused on networks with only one kind of relation. Even with this constraint, monodimensional networks posed many analytic challenges, being representations of ubiquitous complex systems in nature. However, it is a matter of common experience that the constraint of considering only one single relation at a time limits the set of real world phenomena that can be represented with complex networks. When multiple different relations act at the same time, traditional complex network analysis cannot provide suitable an- alytic tools. To provide the suitable tools for this scenario is exactly the aim of this thesis: the creation and study of a Multidimensional Network Analysis, to extend the toolbox of complex network analysis and grasp the complexity of real world phenomena. The urgency and need for a multidimensional network analysis is here presented, along with an empirical proof of the ubiquity of this multifaceted reality in different complex networks, and some related works that in the last two years were proposed in this novel setting, yet to be systematically defined. Then, we tackle the foundations of the multidimensional setting at different levels, both by looking at the basic exten- sions of the known model and by developing novel algorithms and frameworks for well-understood and useful problems, such as community discovery (our main case study), temporal analysis, link prediction and more.
    [Show full text]
  • Graph Databases – Are They Really So New
    International Journal of Advances in Science Engineering and Technology, ISSN: 2321-9009 Volume- 4, Issue-4, Oct.-2016 GRAPH DATABASES – ARE THEY REALLY SO NEW 1MIRKO MALEKOVIC, 2KORNELIJE RABUZIN, 3MARTINA SESTAK 1,2,3Faculty of Organization and Informatics Varaždin, University of Zagreb, Croatia E-mail: [email protected], [email protected], [email protected] Abstract- Even though relational databases have been (and still are) the most widely used database solutions for many years, there were other database solutions in use before the era of relational databases. One of those solutions were network databases with the underlying network model, whose characteristics will be presented in detail in this paper. The network model will be compared to the graph data model used by graph databases, the relatively new category of NoSQL databases with a growing share in the database market. The similarities and differences will be shown through the implementation of a simple database using network and graph data model. Keywords- Network data model, graph data model, nodes, relationships, records, sets. I. INTRODUCTION ● Hierarchical databases This type of databases is based on the hierarchical The relational databases were introduced by E. G. data model, whose structure can be represented as a Codd in his research papers in 1970s. In those papers layered tree in which one data table represents the he discussed relational model as the underlying data root of that tree (top layer), and the others represent model for the relational databases, which was based tree branches (nodes) emerging from the root of the on relational algebra and first-order predicate logic.
    [Show full text]
  • Oracle Rdb™ SQL Reference Manual Volume 4
    Oracle Rdb™ SQL Reference Manual Volume 4 Release 7.3.2.0 for HP OpenVMS Industry Standard 64 for Integrity Servers and OpenVMS Alpha operating systems August 2016 ® SQL Reference Manual, Volume 4 Release 7.3.2.0 for HP OpenVMS Industry Standard 64 for Integrity Servers and OpenVMS Alpha operating systems Copyright © 1987, 2016 Oracle Corporation. All rights reserved. Primary Author: Rdb Engineering and Documentation group This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish, or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this is software or related documentation that is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Government, the following notice is applicable: U.S. GOVERNMENT RIGHTS Programs, software, databases, and related documentation and technical data delivered to U.S. Government customers are "commercial computer software" or "commercial technical data" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental regulations. As such, the use, duplication, disclosure, modification, and adaptation shall be subject to the restrictions and license terms set forth in the applicable Government contract, and, to the extent applicable by the terms of the Government contract, the additional rights set forth in FAR 52.227-19, Commercial Computer Software License (December 2007).
    [Show full text]
  • Curriculum Vitae Michael Kay Phd FBCS
    Curriculum Vitae Michael Kay PhD FBCS Michael Kay is widely known in the XML world as an expert on the XML processing languages XSLT and XQuery. This reputation derives from his book XSLT Programmer's Reference, from the open-source Saxon XSLT and XQuery processor which he developed, and from his work within the W3C consortium as a member of the XSLT and XQuery working groups, and as editor of several of the specifications. His expertise in the field was recognized in 2005 when he was awarded the XML Cup, an annual international award made to individuals who have made outstanding contributions to the XML Community. Before moving into the XML field in 1998, Michael Kay specialized in database and information management technology. He designed a series of successful software products for the computer manufacturer ICL, and was one of the company's most senior engineers advising the company and it customers on technology strategy. Michael Kay is a member of the XML Guild, a loose federation of leading independent XML consultants who pool knowledge and experience to tackle the most challenging XML-related problems. Personal Details Name Michael Howard Kay Address 52 Matlock Road, Caversham Heights, Reading, Berks, UK. RG4 7BS Phone +44 118 948 3589 Email [email protected] Date of Birth 1951-10-11 Nationality British (born in Germany) Languages English, German, some French Career Summary Feb 2004 - present Director, Saxonica Limited Development and Marketing of commercial Saxon-SA product Ongoing development of open source Saxon-B product Independent
    [Show full text]
  • Appendix E: an Overview of the Network Data Model
    Elmasri_APPC Page 1 Monday, April 3, 2006 3:40 PM An Overview of the APPENDIXE Network Data Model This appendix provides an overview of the network data model.1 The original network model and language were presented in the CODASYL Data Base Task Group’s 1971 report; hence it is sometimes called the DBTG model. Revised reports in 1978 and 1981 incorporated more recent concepts. In this appendix, rather than concentrating on the details of a particular CODASYL report, we present the general concepts behind net- work-type databases and use the term network model rather than CODASYL model or DBTG model. The original CODASYL/DBTG report used COBOL as the host language. Regardless of the host programming language, the basic database manipulation commands of the net- work model remain the same. Although the network model and the object-oriented data model are both navigational in nature, the data structuring capability of the network model is much more elaborate and allows for explicit insertion/deletion/modification semantic specification. However, it lacks some of the desirable features of the object mod- els that we discussed in Chapter 11, such as inheritance and encapsulation of structure and behavior. 1. The complete chapter on the network data model and about the IDMS system from the second edition of this book is available at http://www.awl.com/cseng/titles/0-8053-1755-4. This appendix is an edited excerpt of that chapter. E–1 Elmasri_APPC Page 2 Monday, April 3, 2006 3:40 PM E–2 Appendix E / An Overview of the Network Data Model E.1 Network Data Modeling Concepts There are two basic data structures in the network model: records and sets.
    [Show full text]
  • CASE STUDY GE CAPITAL ASSESSING, CONVERTING, & REPLATFORMING a MASSIVE BUSINESS CRITICAL APPLICATION with ASTONISHING RESULTS Introduction
    CASE STUDY GE CAPITAL ASSESSING, CONVERTING, & REPLATFORMING A MASSIVE BUSINESS CRITICAL APPLICATION WITH ASTONISHING RESULTS Introduction GE Capital is the financial services unit of the American conglomerate General Electric, it provides commercial lending and leasing, as well as a range of financial services for consumers. Most of GE Capital’s commercial loans are to small and midsized companies, spread across multiple industries and geographies, and secured by tangible assets. GE Capital’s consumer lending activities are also diversified by product and geography and include operations in 55 countries. Project Summary GE Capital was looking to move their PMS suite of $ 2014 Net Income: $7.0 billion applications from ADS/O and COBOL/IDMS running 2014 Assets: $499 billion on a mainframe, to COBOL running with Oracle on Unix without changing the user interface in the Operations in 40+ Countries process. PMS was built by GE Capital in 1987 500,000+ Commercial Customers and began its life as a 20,000 account schedule system without any interfaces. 35,000+ Employees As with most homegrown systems, it was built out of necessity and to serve the business as it existed at the time. Over the decades, this small system grew in size and complexity to become the central nervous system of both GE Capital’s direct and indirect business units comprised of four highly customized implementations. With over 5 million account schedules, 382 interfaces, 1,700 concurrent users, and 3.5 million transactions per day running against 71 million lines of code, the PMS system had come a long way from its humble roots.
    [Show full text]