LS04EN. Conceptual Database Model. Entity Relationship Diagram (ERD)
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Development Team Principal Investigator Prof
Paper No: 6 Remote Sensing & GIS Applications in Environmental Sciences Module: 22 Hierarchical, network and relational data Development Team Principal Investigator Prof. R.K. Kohli & Prof. V.K. Garg & Prof. Ashok Dhawan Co- Principal Investigator Central University of Punjab, Bathinda Dr. Puneeta Pandey Paper Coordinator Centre for Environmental Sciences and Technology Central University of Punjab, Bathinda Dr Dinesh Kumar, Content Writer Department of Environmental Sciences Central University of Jammu Content Reviewer Dr. Puneeta Pandey Central University of Punjab, Bathinda Anchor Institute Central University of Punjab 1 Remote Sensing & GIS Applications in Environmental Sciences Environmental Hierarchical, network and relational data Sciences Description of Module/- Subject Name Environmental Sciences Paper Name Remote Sensing & GIS Applications in Environmental Sciences Module Name/Title Hierarchical, network and relational data Module Id EVS/RSGIS-EVS/22 Pre-requisites Introductory knowledge of computers, basic mathematics and GIS Objectives To understand the concept of DBMS and database Models Keywords Fuzzy Logic, Decision Tree, Vegetation Indices, Hyper-spectral, Multispectral 2 Remote Sensing & GIS Applications in Environmental Sciences Environmental Hierarchical, network and relational data Sciences Module 29: Hierarchical, network and relational data 1. Learning Objective The objective of this module is to understand the concept of Database Management System (DBMS) and database Models. The present module explains in details about the relevant data models used in GIS platform along with their pros and cons. 2. Introduction GIS is a very powerful tool for a range of applications across the disciplines. The capacity of GIS tool to store, retrieve, analyze and model the information comes from its database management system (DBMS). -
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. -
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. -
The Entity-Relationship Model — 'A3s
.M414 INST. OCT 26 1976 WORKING PAPER ALFRED P. SLOAN SCHOOL OF MANAGEMENT THE ENTITY-RELATIONSHIP MODEL — 'A3S. iflST. l^CH. TOWARD A UNIFIED VIEW OF DATA* OCT 25 197S [ BY PETER PIN-SHAN CHEN WP 839-76 MARCH, 1976 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 50 MEMORIAL DRIVE CAMBRIDGE, MASSACHUSETTS 02139 THE ENTITY-RELATIONSHIP MODEL — — A3S. iHST.TiiCH. TOWARD A UNIFIED VIEW OF DATA* OCT 25 1976 BY PETER PIN-SHAN CHEN WP 839-76 MARCH, 1976 * A revised version of this paper will appear in the ACM Transactions on Database Systems. M.I.T. LlBaARiE; OCT 2 6 1976 ' RECEIVE J I ABSTRACT: A data model, called the entity-relationship model^ls proposed. This model incorporates some of the Important semantic information in the real world. A special diagramatic technique is introduced as a tool for data base design. An example of data base design and description using the model and the diagramatic technique is given. Some implications on data integrity, information retrieval, and data manipulation are discussed. The entity-relationship model can be used as a basis for unification of different views of data: the network model, the relational model, and the entity set model. Semantic ambiguities in these models are analyzed. Possible ways to derive their views of data from the entity-relationship model are presented. KEY WORDS AND PHRASES: data base design, logical view of data, semantics of data, data models, entity-relationship model, relational model. Data Base Task Group, network model, entity set model, data definition and manipulation, data integrity and consistency. CR CATEGORIES: 3.50, 3.70, 4.33, 4.34. -
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. -
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. -
DATA INTEGRATION GLOSSARY Data Integration Glossary
glossary DATA INTEGRATION GLOSSARY Data Integration Glossary August 2001 U.S. Department of Transportation Federal Highway Administration Office of Asset Management NOTE FROM THE DIRECTOR Office of Asset Management, Infrastructure Core Business Unit, Federal Highway Administration his glossary is one of a series of documents on data integration being published by the Federal Highway Administration’s Office of Asset T Management. It defines in simple and understandable language a broad set of the terminologies used in information management, particularly in regard to database management and integration. Our objective is to provide convenient reference material that can be used by individuals involved in data integration activities. The glossary is limited to the more fundamental concepts and taxonomies applied in transportation database management and is not intended to be comprehensive. The importance of data integration in implementing Asset Management processes cannot be overstated. My office will continue to provide information and support to all transportation agencies as they work to integrate their data. Madeleine Bloom Director, Office of Asset Management DATA INTEGRATION GLOSSARY 3 LIST OF TERMS Aggregate data . .7 Dynamic segmentation . .12 Application . .7 Enterprise . .12 Application integration . .7 Enterprise application integration (EAI) . .12 Application program interface (API) . .7 Enterprise resource planning (ERP) . .12 Archive . .7 Entity . .12 Asset Management . .7 Entity relationship (ER) diagram . .12 Atomic data . .7 Executive information system (EIS) . .13 Authorization request . .7 Extensibility . .13 Bulk data transfer . .7 Geographic information system (GIS) . .13 Business process . .7 Graphical user interface (GUI) . .13 Business process reengineering (BPR) . .7 Information systems architecture . .13 Communications protocol . .7 Interoperable database . .13 Computer Aided Software Engineering (CASE) tools . -
(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. -
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. -
Describing Data Patterns. a General Deconstruction of Metadata Standards
Describing Data Patterns A general deconstruction of metadata standards Dissertation in support of the degree of Doctor philosophiae (Dr. phil.) by Jakob Voß submitted at January 7th 2013 defended at May 31st 2013 at the Faculty of Philosophy I Humboldt-University Berlin Berlin School of Library and Information Science Reviewer: Prof. Dr. Stefan Gradman Prof. Dr. Felix Sasaki Prof. William Honig, PhD This document is licensed under the terms of the Creative Commons Attribution- ShareAlike license (CC-BY-SA). Feel free to reuse any parts of it as long as attribution is given to Jakob Voß and the result is licensed under CC-BY-SA as well. The full source code of this document, its variants and corrections are available at https://github.com/jakobib/phdthesis2013. Selected parts and additional content are made available at http://aboutdata.org A digital copy of this thesis (with same pagination but larger margins to fit A4 paper format) is archived at http://edoc.hu-berlin.de/. A printed version is published through CreateSpace and available by Amazon and selected distributors. ISBN-13: 978-1-4909-3186-9 ISBN-10: 1-4909-3186-4 Cover: the Arecibo message, sent into empty space in 1974 (image CC-BY-SA Arne Nordmann, http://commons.wikimedia.org/wiki/File:Arecibo_message.svg) CC-BY-SA by Widder (2010) Abstract Many methods, technologies, standards, and languages exist to structure and de- scribe data. The aim of this thesis is to find common features in these methods to determine how data is actually structured and described. Existing studies are limited to notions of data as recorded observations and facts, or they require given structures to build on, such as the concept of a record or the concept of a schema. -
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. -
Week 4 Tutorial - Conceptual Design
Week 4 Tutorial - Conceptual Design Tutorial 4 – Conceptual Design Remember we can classify an ERDs at one of three levels: 1. Conceptual ERD - an ERD drawing which makes no assumptions about the Data Model which the system will be implemented in 2. Logical ERD (also called a Data Structure Diagram) - an ERD created from the Conceptual ERD which is redrawn in terms of a selected Data Model eg. Relational. The major issues at this stage, if a Relational Data Model is selected, are: relationships are represented by FK's M:N relationships are replaced by 1:M relationships 3. Physical ERD (also represented by a schema file) - an ERD created from the Logical ERD which is redrawn in terms of a selected DBMS eg. Oracle. Most of the issues at this stage of translation will relate to Oracle data types and the Oracle create table/index syntax. Conceptual and Logical ERDs are drawn in terms of a portable ('idealised') data type, now you must translate these types to those supported by your selected DBMS software. For DBMS you may draw ERDs using any of the following (or any combination of the following): (i) using a general drawing package - hand drawn submissions are not acceptable, however you may make use of any standard drawing package to create your diagrams. This approach will support all three ERD levels, you will need to manually make the appropriate translations. (ii) Microsoft VISIO - VISIO is available in the on-campus labs and also available for you (as a Monash student) to install at home. If you wish to install VISIO at home please speak to your lecturer who will explain the local arrangements.