DOCSLIB.ORG

Historical Reflections How Charles Bachman Invented the DBMS, a Foundation of Our Digital World

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Historical Reflections How Charles Bachman Invented the DBMS, a Foundation of Our Digital World viewpoints VDOI:10.1145/2935880 Thomas Haigh Historical Reflections How Charles Bachman Invented the DBMS, a Foundation of Our Digital World His 1963 Integrated Data Store set the template for all subsequent database management systems. IFTY-THREE YEARS AGO a small team working to automate the business processes of the General Electric Company built the first database man- Fagement system. The Integrated Data Store—IDS—was designed by Charles W. Bachman, who won the ACM’s 1973 A.M. Turing Award for the accomplish- ment. Before General Electric, he had spent 10 years working in engineering, finance, production, and data process- ing for the Dow Chemical Company. He was the first ACM A.M. Turing Award winner without a Ph.D., the first with a background in engineer- ing rather than science, and the first to spend his entire career in industry rather than academia. Some stories, such as the work of Babbage and Lovelace, the creation of the first electronic computers, and the emergence of the personal computer industry have been told to the public again and again. They appear in popu- lar books, such as Walter Isaacson’s recent The Innovators: How a Group of Hackers, Geniuses and Geeks Created the Digital Revolution, and in museum exhibits on computing and innova- tion. In contrast, perhaps because da- tabase management systems are rarely Figure 1. This image, from a 1962 internal General Electric document, conveyed the idea COURTESY OF CHARLES W. BACHMAN AND THE CHARLES BABBAGE INSTITUTE. BABBAGE AND THE CHARLES BACHMAN W. OF CHARLES COURTESY experienced directly by the public, of random access storage using a set of “pigeon holes” in which data could be placed. JULY 2016 | VOL. 59 | NO. 7 | COMMUNICATIONS OF THE ACM 25 viewpoints database history has been largely ne- establish a “totally integrated man- glected. For example, the index of Isaa- agement information system.”8 This cson’s book does not include entries If any technology would integrate and automate all the for “database” or for any of the four was essential to the core operations of a business, ideally people to have won Turing Awards in with advanced management report- this area: Charles W. Bachman and Ed- rebuilding of our daily ing and simulation capabilities built gar F. Codd (1981), James Gray (1988), lives around digital right in. The latest and most expensive or Michael Stonebraker (2014). computers of the era had new capabili- That’s a shame, because if any tech- infrastructures, ties that seemed to open the door to a nology was essential to the rebuild- it was the database more aggressive approach. Compared ing of our daily lives around digital to the machines of the 1950s they infrastructures, which I assume is management system. had relatively large memories. They what Isaacson means by “the Digital featured disk storage as well as tape Revolution,” then it was the database drives, could process data more rap- management system. Databases un- idly, and some were even used to drive dergird the modern world of online interactive terminals. information systems and corporate The reality of data processing intranet applications. Few skills are of subjectivity in judgments about changed much more slowly than the more essential for application develop- “firsts,” particularly as IDS predated hype, and remained focused on simple ers than a basic familiarity with SQL, the concept of a database management administrative applications that batch the standard database query language, system. As a fusty historian I value nu- processed large files to accomplish and a database course is required for ance and am skeptical of the idea that tasks such as weekly payroll process- most computer science and informa- any important innovation can be fully ing, customer statement generation, tion systems degree programs. Within understood by focusing on a single or accounts payable reporting. ACM, SIGMOD—the Special Interest breakthrough moment. I have docu- Many companies announced their Group for Management of Data—has mented many ways in which IDS built intention to build totally integrated a long and active history fostering da- on earlier file management and report management information systems, tabase research. Many IT professionals generation systems.7 However, if any but few ever claimed significant suc- center their entire careers on database system deserves the title of “first data- cess. A modern reader would not be technology: the census bureau esti- base management system” then it is shocked to learn that firms were un- mates the U.S. alone employed 120,000 clearly IDS. It became a model for the able to create systems of comparable database administrators in 2014 and earliest definitions of “data base man- scope to today’s Enterprise Resources predicts faster than average growth for agement system” and included most of Planning and data warehouse proj- this role. the core capabilities later associated ects using computers with perhaps the Bachman’s IDS was years ahead of with the concept. equivalent of 64KB of memory, no real its time, implementing capabilities operating system, and a few megabytes that had until then been talked about What Was IDS For? of disk storage. Still, even partially in- but never accomplished. Detailed func- Bachman created IDS as a practical tegrated systems covering significant tional specifications for the system tool, not an academic research project. portions of a business would have real were complete by January 1962, and In 1963 there was no database research value. The biggest roadblocks to even Bachman was presenting details of the community. Computer science was just modest progress toward this goal were planned system to his team’s in-house beginning to emerge as an academic the sharing of data between applica- customers by May of that year. It is less field, but its early stars focused on pro- tions and the difficulties application clear from archival materials when the gramming language design, theory of programmers faced in exploiting ran- system first ran, but Bachman tells me computation, numerical analysis, and dom access disk storage. that a prototype installation of IDS was operating system design. In contrast Getting a complex job done might tested with real data in the summer of to this academic neglect, the efficient involve dozens of small programs and 1963, running twice as fast as a custom- and flexible handling of large collec- the generation of many working tapes built manufacturing control system tions of structured data was the central full of intermediate data. These banks performing the same tasks. challenge for what we would now call of whirring tape drives provided com- The details of IDS, Bachman’s life corporate information systems depart- puter centers with their main source story, and the context in which it arose ments, and was then called business of visual interest in the movies of the have been explored elsewhere.2,6 In this data processing. era. Tape-based processing techniques column, I focus on two specific ques- During the early 1960s the hype and evolved directly from those used with tions: reality of business computing diverged pre-computer mechanical punched ˲ Why do we view IDS as the first da- dramatically. Consultants, visionaries, card machines: files, records, fields, tabase management system, and business school professors, and com- keys, grouping, merging data from ˲ What were its similarities and dif- puter salespeople had all agreed that two files, and the hierarchical combi- ferences versus later systems? the best way to achieve real economic nation of master and detail records There will always be an element payback from computerization was to within a single file. These applied to 26 COMMUNICATIONS OF THE ACM | JULY 2016 | VOL. 59 | NO. 7 viewpoints magnetic tape much as they had done support for structuring data in tape what we still consider the core task of to punched cards, except that tape files but lacked comparable support a database management system. Pro- storage made sorting much harder. for random access storage. Harnessing grams could not manipulate data files The formats of tape files were usually the power of disks meant finding ways directly, instead making calls to IDS so fixed by the code of the application to sequence, insert, delete, or search that it would perform the data opera- programs working with the data. Ev- for records that did not simply repli- tions on their behalf. ery time a field was added or changed cate the sequential techniques used Like modern database manage- all the programs working with the file with tape. Solutions such as hashing, ment systems, IDS explicitly stored would need to be rewritten. If applica- linked lists, chains, indexing, inverted and manipulated metadata about the tions were integrated, for example, by files, and so on were quickly devised records and their relationships, rather treating order records from the sales but these were relatively complex to than expecting each application pro- accounting system as input for the pro- implement and demanded expert gram to understand and respect the duction scheduling application, the judgment to select the best method for format of every data file it worked with. resulting web of dependencies made a particular task (see Figure 1). It enforced relationships between dif- it increasingly difficult to make even IDS was intended to substantially ferent record types, and would protect minor changes when business needs solve these two problems, so that ap- database integrity. Database design- shifted. plications could be integrated to share ers specified record clusters, linked The other key challenge was mak- data files and ordinary programmers list sequencing, indexes, and other ing effective use of random access stor- could effectively develop random ac- details of record organization to boost age in business application programs. cess applications using high-level lan- performance based on expected usage Sequential tape storage was conceptu- guages.
Load more

Recommended publications
  • Available in PDF Format
    Defining Business Rules ~ What Are They Really? the Business Rules Group formerly, known as the GUIDE Business Rules Project Final Report revision 1.3 July, 2000 Prepared by: Project Manager: David Hay Allan Kolber Group R, Inc. Butler Technology Solutions, Inc. Keri Anderson Healy Model Systems Consultants, Inc. Example by: John Hall Model Systems, Ltd. Project team: Charles Bachman David McBride Bachman Information Systems, Inc. Viasoft Joseph Breal Richard McKee IBM The Travelers Brian Carroll Terry Moriarty Intersolv Spectrum Technologies Group, Inc. E.F. Codd Linda Nadeau E.F. Codd & Associates A.D. Experts Michael Eulenberg Bonnie O’Neil Owl Mountain MIACO Corporation James Funk Stephanie Quarles S.C. Johnson & Son, Inc. Galaxy Technology Corporation J. Carlos Goti Jerry Rosenbaum IBM USF&G Gavin Gray Stuart Rosenthal Coldwell Banker Dyna Systems John Hall Ronald Ross Model Systems, Ltd. Ronald G. Ross Associates Terry Halpin Warren Selkow Asymetrix Corporation CGI/IBM David Hay Dan Tasker Group R, Inc. Dan Tasker John Healy Barbara von Halle The Automated Reasoning Corporation Spectrum Technologies Group, Inc. Keri Anderson Healy John Zachman Model Systems Consultants, Inc. Zachman International, Inc. Allan Kolber Dick Zakrzewski Butler Technology Solutions, Inc. Northwestern Mutual Life - ii - GUIDE Business Rules Project Final Report Table of Contents 1. Introduction 1 Project Scope And Objectives 1 Overview Of The Paper 2 The Rationale 2 A Context for Business Rules 4 Definition Of A Business Rule 4 Categories of Business Rule 6 2. Formalizing Business Rules 7 The Business Rules Conceptual Model 8 3. Formulating Business Rules 9 The Origins Of Business Rules — The Model 10 Types of Business Rule 13 Definitions 14 4.
    [Show full text]
  • Charles Bachman
    Charles Bachman Born December 11, 1924, Manhattan, Kan.; Proposer of a network approach to storing data as in the Integrated Data Store (IDS) and developer of the OSI Reference Model. Education: BS, mechanical engineering, Michigan State University, 1948; MS, mechanical engineering, University of Pennsylvania, 1950. Professional Experience: Dow Chemical Corporation, 1950-1960; General Electric Company, 1960-1970; Honeywell Information Systems, 1970-1981; Cullinet, 1981- 1983; founder and chairman, BACHMAN Information Systems, 1983-present. Honors and Awards: ACM Turing Award, 1973; distinguished fellow, British Computer Society, 1978. Bachman began his service to the computer industry in 1958 by chairing the SHARE Data processing Committee that developed the IBM 709 Data Processing Package (9PAC), and which preceded the development of the programming language Cobol. He continued this development work through the American National Standards Institute SPARC Study Group on Data Base Management Systems (ANSI/ SPARC/DBMS) that created the layer architecture and conceptual schema for database systems. This work led to the development of the international “Reference Model for Open Systems Integration,” which included the basic idea of a seven- layer architecture, the basis of the OSI networking standard. Bachman received the 1973 ACM Turing Award for his development of the Integrated Data Store, which lifted database work from the status of a specialty to first-class citizenship in computing. IDS provided an elegant logical framework for organizing large on-line collections of variously interrelated data. The system had pragmatic significance also in taking into account advice on expected usage patterns, to improve physical data layouts. The facilities of IDS were fully integrated into the Cobol language and so became available for full-scale practical use.
    [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]
  • Mcgraw-Hill/Osborne New York Chicago San Francisco Lisbon London Madrid Mexico City Milan New Delhi San Juan Seoul Singapore Sydney Toronto
    http://videogames.gigcities.com Color profile: Generic CMYK printer profile Composite Default screen DATABASES DEMYSTIFIED P:\010Comp\DeMYST\364-9\fm.vp Tuesday, February 10, 2004 9:57:24 AM Color profile: Generic CMYK printer profile Composite Default screen This page intentionally left blank. P:\010Comp\DeMYST\364-9\fm.vp Tuesday, February 10, 2004 9:57:24 AM Color profile: Generic CMYK printer profile Composite Default screen DATABASES DEMYSTIFIED ANDREW J. OPPEL McGraw-Hill/Osborne New York Chicago San Francisco Lisbon London Madrid Mexico City Milan New Delhi San Juan Seoul Singapore Sydney Toronto P:\010Comp\DeMYST\364-9\fm.vp Tuesday, February 10, 2004 9:57:24 AM Color profile: Generic CMYK printer profile Composite Default screen Copyright © 2004 by The McGraw-Hill Companies. All rights reserved. Manufactured in the United States of America. Except as permitted under the United States Copyright Act of 1976, no part of this publication may be reproduced or distributed in any form or by any means, or stored in a database or retrieval system, without the prior written permission of the publisher. 0-07-146960-5 The material in this eBook also appears in the print version of this title: 0-07-225364-9. All trademarks are trademarks of their respective owners. Rather than put a trademark symbol after every occurrence of a trademarked name, we use names in an editorial fashion only, and to the benefit of the trademark owner, with no intention of infringement of the trademark. Where such designations appear in this book, they have been printed with initial caps.
    [Show full text]
  • The Growth of Structure
    Chapter 7 The Growth of Structure Evolution is an ascent towards consciousness. Therefore it must culminate ahead in some kind of supreme consciousness. Pierre Teilhard de Chardin he main purpose of this chapter is to illustrate the exponential chararacteristics of the growth curve, which occurs throughout Nature, with the growth of structure in the T computer industry in particular. We can thereby see how evolution could overcome the limits of technology, outlined in Chapter 8, ‘Limits of Technology’ on page 619, taking humanity out of the evolutionary cul-de-sac we find ourselves in today, outlined in Chapter 9, ‘An Evolutionary Cul-de-Sac’ on page 643. Chapter 6, ‘A Holistic Theory of Evolution’ on page 521 showed how the accelerating pace of evolutionary change can be modelled by an exponential series of diminishing terms, which has a finite limit at the present time, the most momentous turning point in some fourteen billion years of evolutionary history. But because of science’s ignorance of the Principle of Unity—the fundamental design principle of the Universe—science has no satisfactory explanation for this exponential rate of evolutionary change. As a consequence, we are managing our business affairs with little un- derstanding of the evolutionary energies that cause us to behave as we do. Even when the Principle of Unity is presented to scientists, they tend to deny that it is a universal truth, be- cause it threatens their deeply held scientific convictions, the implications of which we shall look at in the Epilogue. In the meantime, we can use the Principle of Unity to examine this critical situation.
    [Show full text]
  • (Spring 2020) :: History of Databases
    ADVANCED DATABASE SYSTEMS History of Databases @Andy_Pavlo // 15-721 // Spring 2020 Lecture #01 2 15-721 (Spring 2020) 3 Course Logistics Overview History of Databases 15-721 (Spring 2020) 4 WHY YOU SHOULD TAKE THIS COURSE DBMS developers are in demand and there are many challenging unsolved problems in data management and processing. If you are good enough to write code for a DBMS, then you can write code on almost anything else. 15-721 (Spring 2020) 5 15-721 (Spring 2020) 6 COURSE OBJECTIVES Learn about modern practices in database internals and systems programming. Students will become proficient in: → Writing correct + performant code → Proper documentation + testing → Code reviews → Working on a large code base 15-721 (Spring 2020) 7 COURSE TOPICS The internals of single node systems for in- memory databases. We will ignore distributed deployment problems. We will cover state-of-the-art topics. This is not a course on classical DBMSs. 15-721 (Spring 2020) 8 COURSE TOPICS Concurrency Control Indexing Storage Models, Compression Parallel Join Algorithms Networking Protocols Logging & Recovery Methods Query Optimization, Execution, Compilation 15-721 (Spring 2020) 9 BACKGROUND I assume that you have already taken an intro course on databases (e.g., 15-445/645). We will discuss modern variations of classical algorithms that are designed for today’s hardware. Things that we will not cover: SQL, Serializability Theory, Relational Algebra, Basic Algorithms + Data Structures. 15-721 (Spring 2020) 10 COURSE LOGISTICS Course Policies + Schedule: → Refer to course web page. Academic Honesty: → Refer to CMU policy page. → If you’re not sure, ask me.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • Charles Bachman 1973 Turing Award Recipient Interviewed by Gardner Hendrie February 4, 2015 Lexington, Massachusetts Video Inter
    Oral History of Charles W. (Charlie) Bachman Charles Bachman 1973 Turing Award Recipient Interviewed by Gardner Hendrie February 4, 2015 Lexington, Massachusetts Video Interview Transcript This video interview and its transcript were originally produced by the Computer History Museum as part of their Oral History activities and are copyrighted by them. CHM Reference number: X7400.2015 © 2006 Computer History Museum. The Computer History Museum has generously allowed the ACM to use these resources. Page 1 of 58 Oral History of Charles W. (Charlie) Bachman GH: Gardner Hendrie, interviewer CB: Charles Bachman, 1973 Turing Award Recipient GH: …Alright. We have here today with us Charlie Bachman, who’s graciously agreed to do an oral history for the Computer History Museum. Thank you very much Charlie. I think I’d like to start out with a very simple question: What is your earliest recollection of what you wanted to do when you grew up? CB: Well I guess the best answer, I don’t really think of any early recollection... GH: Okay. CB: …about that. I just kind of grew into it. GH: Alright. Now I have read that you decided to become a mechanical engineer relatively early. How did that come about? What influenced you to make that decision? And when did you make it? CB: Well I grew up in East Lansing, Michigan, which is the heart of General Motors and Ford and Chrysler, building automobiles. And so you thought engineers were people who designed cars and things that go with them, and that’s mainly mechanical engineering. So I just somehow thought that was the general course you took in engineering; if you didn’t know what kind of engineer you want to be, you do mechanical engineer.
    [Show full text]
  • Entity-Relationship Modeling 3
    Peter P. Chen Entity-Relationship Modeling Peter P. Chen Entity-Relationship Modeling Overview • Historical Background – Competing Forces – The Needs – How ERM was Developed – Fufilling the Needs • Last Twenty-Five Years • In Retrospect, Another Important Factor • The Future • Lessons Learned & Conclusions 2 Peter P. Chen Entity-Relationship Modeling Historical Background • Competing Forces •The Needs •How the ERM was Developed – Right Place, Right Time, Right Idea? • Fufilling the Needs 3 Peter P. Chen Entity-Relationship Modeling Competing Forces in Database Field in Early 70‘s (I) • In the Real World – File Systems Dominated – Commercial DBMS‘s are Based on: – Hierarchical Model (IBM‘s IMS) – Network Model (Codasyl Model) developed by Charles Bachman 4 Peter P. Chen Entity-Relationship Modeling Competing Forces in Database Field in Early 70‘s (II) • In the Academic World – Several Data Models Were Proposed – Relational Model (Codd, 1970) – Most Academic People Worked on: – RDBMS prototypes – Relational Normal Forms 5 Peter P. Chen Entity-Relationship Modeling The Needs of the DB Community in the Early 70‘s • For Software/Hardware Vendors – Integration of Various File and DB Formats – Incorporating More „Data Semantics“ • For User Organizations – A Unified Methodology for File and DB design for Various File and DBMS‘s – Incorporating More Business Rules 6 Peter P. Chen Entity-Relationship Modeling Weaknesses of Relational Model (I) Figure 2 7 Peter P. Chen Entity-Relationship Modeling Weaknesses of Relational Model (II) • No Explicit Entity and Relationship Concepts • Linking of Data is Done Dynamically via „joining“ Data Values • Certain Semantic Information Missing – Cardinality of relationship (one-to-one mapping, one-to-many-mapping, many-to-many mapping) 8 Peter P.
    [Show full text]
  • Database History
    History of Database Systems JIANNAN WANG SIMON FRASER UNIVERSITY JIANNAN @ SFU 1 Database Systems in a Half Century (1960s – 2010s) When What Early 1960 – Early 1970 The Navigational Database Empire Mid 1970 – Mid 1980 The Database World War I Mid 1980 – Early 2000 The Relational Database Empire Mid 2000 – Now The Database World War II References. • https://en.wikipedia.org/wiki/Database#History • What Goes Around Comes Around (Michael Stonebraker, Joe Hellerstein) • 40 Years VLDB Panel JIANNAN @ SFU 2 The Navigational Database Empire (Early1960 – Early 1970) Data Model 1. How to organize data 2. How to access data Navigational Data Model 1. Organize data into a multi-dimensional space (i.e., A space of records) 2. Access data by following pointers between records Inventor: Charles Bachman 1. The 1973 ACM Turing Award 2. Turing Lecture: “The Programmer As Navigator” JIANNAN @ SFU 3 The Navigational Database Empire (Early1960 – Early 1970) Representative Navigational Database Systems ◦ Integrated Data Store (IDS), 1964, GE ◦ Information Management System (IMS), 1966, IBM ◦ Integrated Database Management System (IDMS), 1973, Goodrich CODASYL ◦ Short for “Conference/Committee on Data Systems Languages” ◦ Define navigational data model as standard database interface (1969) JIANNAN @ SFU 4 The Birth of Relational Model Ted Codd ◦ Born in 1923 ◦ PHD in 1965 ◦ “A Relational Model of Data for Large Shared Data Banks” in 1970 Relational Model ◦ Organize data into a collection of relations ◦ Access data by a declarative language (i.e., tell me what you want, not how to find it) Data Independence JIANNAN @ SFU 5 The Database World War I: Background One Slide (Navigational Model) ◦ Led by Charles Bachman (1973 ACM Turing Award) ◦ Has built mature systems ◦ Dominated the database market The other Slide (Relational Model) ◦ Led by Ted Codd (mathematical programmer, IBM) ◦ A theoretical paper with no system built ◦ Little support from IBM JIANNAN @ SFU 6 The Database World War I: Three Big Campaigns 1.
    [Show full text]
  • Database Management Systems Ebooks for All Edition (
    Database Management Systems eBooks For All Edition (www.ebooks-for-all.com) PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sun, 20 Oct 2013 01:48:50 UTC Contents Articles Database 1 Database model 16 Database normalization 23 Database storage structures 31 Distributed database 33 Federated database system 36 Referential integrity 40 Relational algebra 41 Relational calculus 53 Relational database 53 Relational database management system 57 Relational model 59 Object-relational database 69 Transaction processing 72 Concepts 76 ACID 76 Create, read, update and delete 79 Null (SQL) 80 Candidate key 96 Foreign key 98 Unique key 102 Superkey 105 Surrogate key 107 Armstrong's axioms 111 Objects 113 Relation (database) 113 Table (database) 115 Column (database) 116 Row (database) 117 View (SQL) 118 Database transaction 120 Transaction log 123 Database trigger 124 Database index 130 Stored procedure 135 Cursor (databases) 138 Partition (database) 143 Components 145 Concurrency control 145 Data dictionary 152 Java Database Connectivity 154 XQuery API for Java 157 ODBC 163 Query language 169 Query optimization 170 Query plan 173 Functions 175 Database administration and automation 175 Replication (computing) 177 Database Products 183 Comparison of object database management systems 183 Comparison of object-relational database management systems 185 List of relational database management systems 187 Comparison of relational database management systems 190 Document-oriented database 213 Graph database 217 NoSQL 226 NewSQL 232 References Article Sources and Contributors 234 Image Sources, Licenses and Contributors 240 Article Licenses License 241 Database 1 Database A database is an organized collection of data.
    [Show full text]
  • The Computer Museum Report, Fall 1984
    THE COMPUTER MUSEUM REPORT NUMBER 10 FALL 1984 Individual Founders D Charles W. Adams D Ken R. Adcock D David Ahl D John Alexanderson D Kendall Allphin D Gene M. Amdahl D Michael and Merry Andelman D Harlan E. & Lois Anderson D Applied Magnetics Corp. D Mr. & Mrs. Rolland B. Arndt D Dr. John Atanasoff D Isaac 1. Auerbach D AVX Corporation D Charles and Constance Bachman D Jean-Loup Baer D Robert W. Bailey, Ph.D. D John Banning D Jeremy Barker D Steve F. Barnebey D Harut Barsamian D John C. Barstow D Jordan and Rhoda Baruch D Gordon & Barbara Beeton D G. C. Belden, Jr. D C. Gordon & Gwen Bell D James and Roberta Bell D Chester Bell D Alan G. Bell D J. Weldon Bellville D Dr. Leo 1. Beranek D Roger & Kay Berger D Jeffrey Bernstein D Alfred M. Bertocchi D Gregory C . F. Bettice D Lamar C . Bevil. Jr. D Bitstream, Inc. D Erich & Renee Bloch D David R. Block D Elizabeth Boiger D Ted Bonn D Allen H. Brady D John G. Brainerd D David H. Brandin D Daniel S. Bricklin D Richard A. Brockelman D David A. Brown D Gordon S. Brown D Lawrence C. Brown D Arthur and Alice Burks D James R. Burley D Max Burnet D Jim & Margaret Butler D Marshall D. Butler D~oger C. Cady D Philip and Betsey Caldwell D Walter M. Carlson D Charles T. & Virginia G . Casale D George A. Chamberlain III D George A. Champine D Alan Chinnock D Donald Christiansen D Peter Christy and Carol Peters D Dr.
    [Show full text]