I Introduction Entity Relationship Model: Basic Concepts Mapping Ca
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). -
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. -
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. -
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. -
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. -
Studies and Analysis of Popular Database Models
Pramod Singh et al, International Journal of Computer Science and Mobile Computing, Vol.4 Issue.5, May- 2015, pg. 834-838 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 4, Issue. 5, May 2015, pg.834 – 838 RESEARCH ARTICLE Studies and Analysis of Popular Database Models Dr. P. K. Rai Prof. I/C, BCA & Head, Computer Centre APSU Rewa Pramod Singh Research Scholar M.G.C.G.V Chitrakoot Satna (M.P), Satna, India; Email: [email protected] ABSTRACT: Data is most valuable part of today world because it is used in everyday of life from a single individual to large organizations. To make the selection and maintenance easy and support strong data protection it is stored in a data model. A data model is a repository of subjectively selected and adapted operational data which can successfully answer any, statistical, complex or analytical queries. Nowadays the database is shared by a globally competitive environment where large amounts of data are required to be processed faster and efficient way .data model keep a subject oriented data which gives the support for management's decision making process. This paper discusses in detail four existing database models like Hierarchical, network, relational and object oriented database and does an analysis to understand the advantages and disadvantages of these database models. Keywords: RDB, OODB. Introduction A Database is an important part of any organization because all information is store in the database where all users can easily access this information in well organized manner. -
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 . -
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. -
The Network Model
Unit 5 The Network Model 5.1 The Network Model 5.2 IDMS Unit 5 The Network Model Data Modeling Issue . Issue: How to represent entities and relationships? . Two major paradigms S P SP • Relational Hierarchical • Graph { Network . E.g., a 'pile' of data • John, 25, NCTU, CS Dept, ... 01 • Mary, 22, NCTU, IS Dept, ... 02 02 02 02 .. 03 03 COBOL 01 data-record 01 02 name PIC X(6) 02 02 02 02 02 age PIC 9(2) 0303 02 univ PIC X(4) 02 dept PIC X(3) Wei-Pang Yang, Information Management, NDHU Unit 5 The Network Model 5-2 Model 1: Relational . Model 1: Relational - Decomposition (normalization issue) Emp Dept Project Wei-Pang Yang, Information Management, NDHU Unit 5 The Network Model 5-3 Model 2: Hierarchical Dept Emp Project Wei-Pang Yang, Information Management, NDHU Unit 5 The Network Model 5-4 Model 3: Network . Model 3: Network proposed by CODASYL Dept 1:M M : M Project Emp 1:M 1:M E-P Wei-Pang Yang, Information Management, NDHU Unit 5 The Network Model 5-5 5.1 The Network Model . Data Structure Consider the 'supplier-and-parts‘ database S P SP S# SNAME STATUS CITY P# PNAME COLOR WEIGHT CITY S# P# QTY } Structure S1 Smith 20 London P1 Nut Red 12 London S1 P1 300 S2 Jones 10 Paris P2 Bolt Green 17 Paris S1 P2 200 S3 Blake 30 Paris P3 Screw Blue 17 Rome S1 P3 400 S4 Clark 20 London P4 Screw Red 14 London S1 P4 200 S5 Adams 30 Athens P5 Cam Blue 12 Paris S1 P5 100 P6 Cog Red 19 London S1 P6 100 Sample values S2 P1 300 S2 P2 400 S3 P2 200 S4 P2 200 S4 P4 300 S4 P5 400 Wei-Pang Yang, Information Management, NDHU Unit 5 The Network Model 5-6 The Network Model: Sets and Structure Network Model a set of records (Record types): entities . -
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. -
Execution Time Analysis of Electrical Network Tracing in Relational and Graph Databases
DEGREE PROJECT IN COMPUTER SCIENCE AND ENGINEERING, SECOND CYCLE, 30 CREDITS STOCKHOLM, SWEDEN 2019 Execution Time Analysis of Electrical Network Tracing in Relational and Graph Databases FELIX DE SILVA KTH ROYAL INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE Execution Time Analysis of Electrical Network Tracing in Relational and Graph Databases FELIX DE SILVA Master in Computer Science Date: March 16, 2019 Supervisor: Mika Cohen Examiner: Mads Dam School of Electrical Engineering and Computer Science iii Abstract In today’s society, we handle a lot of connected data. Examples are companies like Facebook and Amazon, that handle connected data in different ways. Geographic Information Systems and Network Informa- tion Systems handle connected data in the form of networks or graphs that can represent anything from an electrical network to a product network. When it comes to connected data, the most commonly used database technology is relational databases. However, with a lot of new databases emerging, there may be better alternatives for connected data that can provide higher performance. In this study we look at the Oracle relational database and the Neo4j graph database and study how both databases traverse an electrical network. The findings indicate that the Neo4j graph database outper- forms the Oracle relational database regarding execution time of search queries. iv Sammanfattning I dagens samhälle hanterar vi mycket kopplad data. Exempel är företag som Facebook och Amazon, som hanterar kopplad data på olika sätt. Geografiska informationssystem och nätverksinformationssystem han- terar kopplad data i form av nätverk eller grafer som kan representera allt från elnät till ett produktnätverk. -
DBMS; IMBA18205DCE Database Models Hierarchical Model
DBMS; IMBA18205DCE Course Instructor: Dr. Tariq Ahmad Lone Lecture-5 Dated 14.05.2020 Thursday IMBA-2nd Semester Database Models After going through the database architecture, let us now dwell on an important question: how is the data organized in a database? There are many basic structures that exist in a database system. They are called the database models. A database model defines • The logical data structure • Data relationships • Data consistency constraints. Following are the different types of database models used in database systems: Hierarchical Model The hierarchical data model organizes data in a tree structure. There is a hierarchy of parent and child data segments. This structure implies that a record can have repeating information, generally in the child data segments. Data is a series of records, which have a set of field values attached to it. It collects all the instances of a specific record together as a record type. These record types are the equivalent of tables in the relational model, and with the individual records being the equivalent of rows. To create links between these record types, the hierarchical model uses Parent Child Relationships. These are a 1:N mapping between record types. This is done by using trees, like set theory used in the relational model, "borrowed" from mathematics. For example, an organization might store information about an employee, such as name, employee number, department, and salary. The organization might also store information about an employee's children, such as name and date of birth. The employee and children data forms a hierarchy, where the employee data represents the parent segment and the children data represents the child segment.