DOCSLIB.ORG

DBMS for Business Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DBMS for Business Systems DBMS for Business Systems Evgeniy Grigoriev RxO project LTD (www.RxO-project.com), Moscow, Russian Federation Keywords: Relational DBMS, Object-oriented Paradigm, Informational Business System, Business Modelling, Heterogeneous Data Schema, Persistent Object, Encapsulation, Group Operation, Nested Structures, Algorithm Transformation. Abstract: Many problems of traditional business systems (SAP, Microsoft Dynamics, etc.) are largely caused by their architecture where a tier that implements the business model and data processing (application server or thick client) is separated from the DBMS where the data is stored. A new approach to extend the relational DBMS with a means for creating expressive heterogeneous business models according to principles well- known to users of existing business systems is discussed. With it the business system architecture can be simplified fundamentally because of transferring all data modelling and processing directly to the place of their storage. Principles of a creation and a use of complex business models and data access in these models are discussed. Some questions related to system performance are reviewed. 1 INTRODUCTION . Like any multi-tier system, they are very complex and hard to create, modify, and With the advent of the first relational DBMS, it maintain. became clear that "that they are inadequate for a . The need to process the data outside of the broader class of applications" that business data DBMS leads to catastrophic performance processing applications (Stonebraker et al., 1990). degradation because of non-optimal (and Moreover when we say about necessity to build and hardly optimized) data exchange between the use expressive complex business models, the tiers. relational DBMSs are not good enough even for the . There are obvious difficulties of integration business application (Fowler et al., 2003). This with third-part programs (e.g. Excel) using problem was tried to be solved in two ways. standard means of access to data in a DBMS DBMS experts solved it by changing capabilities (e.g. ODBC). The DB schema generated by an of the DBMS; in fact, they suggested changes of outer tier is usually incomprehensible to the DBMS technology or even of base DBMS logic, up business users or/and inaccessible because of to a full refusal of relational systems (Atkinson et security reasons. On other hand, the business al., 1990). In the context of this article we will model existing on the outer tier is inaccessible consider only those proposals that involve the because this tier usually does not support the evolutionary development of a relational DBMS standard data access protocols and interfaces. (e.g. SQL99, Oracle, PostgreSQL). We will denote Both groups showed a rare unanimity, this group as solutions "inside DBMS". considering the object-oriented approach as a kind of Application programmers, who answer practical panacea to meet requirements of business modelling. challenges, developed business applications on the However, there is a fundamental logical difference basis of traditional principles and technologies of of how they have implemented this approach with using a relational DBMS. Well-known and respect to modified/used RDBMS. successful business systems like SAP, MS Analysis of the solutions "inside the DBMS" Dynamics, etc. are examples of such solutions. We shows that all they, one way or another, implement will denote this group as solutions "outside DBMS". the two principles (many DBMS implement both of Let's note that the way of solutions "outside DBMS" these two principles simultaneously). in itself causes significant problems which are . An object corresponds to a row of the inherent in modern business systems. database table ("object = string"). For Grigoriev E.. 103 DBMS for Business Systems. DOI: 10.5220/0005554301030108 In Proceedings of the 10th International Conference on Software Paradigm Trends (ICSOFT-PT-2015), pages 103-108 ISBN: 978-989-758-115-1 Copyright c 2015 SCITEPRESS (Science and Technology Publications, Lda.) ICSOFT-PT2015-10thInternationalConferenceonSoftwareParadigmTrends example, in object-relational DBMS (i.e. database". Based on the properties of the classical Oracle since v.8, PostgreSQL) instances of the relational data model (Codd, 1970), it is shown by us object types are stored in a typed table, where that all descriptions of such objects and operations each instance corresponds to a single line. on them can be translated into descriptions of . Object corresponds to a single field in the row relational structures and operations on the last ones of the database table ("object = field"). This (Grigoriev, 2013b). principle has been expressed logically in As a result, it's not necessary to "assemble" such hypothetical "D language"(Date and objects from the rows of different tables outside the Darwen,2000). It has got also many DBMS to work with them. Instead, it's possible to technological implementations, when object translate all commands on these objects in actions on data are stored in BLOB, JSON, etc. field. the tables (system hides these tables from the user). Solutions "outside of DBMS", i.e. the traditional The user, who uses these commands, keeps a full business system, successfully implement other third illusion that he works with complex objects which principle: the business object corresponds to a set of are formed with the principle that is native for rows from different tables of a relational database. business systems. Thus we offer a sophisticated way For example, the business object "an invoice" to manage traditional relational data, which typically corresponds to one row from a table implements well-known object-oriented principles "headers" and few rows from a table "items". This (Booch, 1991). principle is evident and clear for users; it has been being used in successful business systems to build a vast majority of objects for decades. We can assume 3 COMPLEX HETEROGENEOUS that it closely matches the needs of the business and DATA SCHEMA that it should be primarily implemented in the DBMS which are adequate for modern business RxO DBMS maintains all usual abilities for working systems. However, attempts to create such DBMS is with traditional tables created by the user explicitly. still absent. Moreover, it seems that this possibility Because of this, in RxO database both relational is not even considered theoretically (Date and tables and complex unique objects of different Darwen, 2000, 2013). classes can coexist simultaneously (Fig.1); the tables We denote this principle with a logical equation and the classes can be connected by foreign keys. "object = relational database". In this equation we assume that any subset of tuples of relations can be considered as a relation. The object corresponds to the "multiple rows of different tables", i.e. to the set of such relations. In turn, the phrase "a set of relations" is a key element of the formal definition of the relational database. Further, we will consider our approach on how this principle can be implemented in a relational DBMS. The result is a DBMS, which we will call RxO DBMS. Some of the offered ideas were implemented by us in the prototype "RxO system" (Grigoriev,2013a); its input commands we will use Figure 1: RxO database consists of both tables T and for demonstration. object o of classes C. The possibility to create such heterogeneous data 2 OBJECT-ORIENTED schemes corresponds well to realities of traditional business systems, where the business objects are MANAGEMENT SYSTEM FOR combined with tables used, for example, for RELATIONAL DATA accounting journals, logs, etc. It also demonstrates that RxO DBMS is an RxO DBMS implements a new approach to the evolutionary extension of existing relational DBMS. connection object-oriented and relational ways of Thereby full continuity of existing customer managing of data if form of complex objects databases and solutions is ensured. corresponding to the principle of "object = relational 104 DBMSforBusinessSystems ALTER CLASS GOODS 4 CLASSES IMPLEMENT Turnover AS BEGIN Classes of RxO DBMS are an all-sufficient concept RETURN SELECT for both data modelling and data persistence. This is Buyer, SUM(Items.Qty) the fundamental difference from object-relational FROM SHIPMENTS DBMS (e.g. Oracle), where typed tables must be WHERE Items.Art = this evidently used to make instances of user-defined GROUP BY Buyer type (UDT) persistent. END; A set of commands extending the traditional Both stored and calculated attributes can exist in SQL is implemented to describe classes and manage the class simultaneously. user objects in the prototype "RxO system". Let's The method implementation expressions look review these commands. similar to user-defined functions. The class interface is separated from its ALTER CLASS SHIPMENTS implementation. The state of any object is described IMPLEMENT PostIt(inDate DATETIME) AS as a set of values that are native for relational BEGIN ... END; database, namely, scalar values and relation values. The ALTER CLASS ... IMPLEMENT ... Accordingly, the interface of objects is described as command allows us to change the implementations set of both scalar and table-valued attributes which of the class interface elements freely in non-empty represent the state of the object, and methods used to classes without rebuilding the system. Multiple class change this state. Relational integrity constraints inheritance is possible. The class implementation (keys and foreign keys) can be specified in classes, may be
Load more

Recommended publications
  • Further Normalization of the Data Base Relational Model
    FURTHER NORMALIZATION OF THE DATA BASE RELATIONAL MODEL E. F. Codd IBM Research Laboratory San Jose, California ABSTRACT: In an earlier paper, the author proposed a relational model of data as a basis for protecting users of formatted data systems from the potentially disruptive changes in data representation caused by growth in the data base and changes in traffic. A first normal form for the time-varying collection of relations was introduced. In this paper, second and third normal forms are defined with the objective of making the collection of relations easier to understand and control, simpler to operate upon, and more informative to the casual user. The question "Can application programs be kept in a viable state when data base relations are restructured?" is discussed briefly and it is conjectured that third normal form will significantly extend the life expectancy of appli- cation programs. Fu909umxk7) August 31,197l Information technolow (IR, Documentetion, etc.) 1. 1. Introduction 1.1 Objectives of Normalization In an earlier paper [l] the author proposed a relational model of data as a basis for protecting users of formatted data systems from the potentially disruptive changes in data representation caused by growth in the variety of data types in the data base and by statistical changes in the transaction or request traffic. Using this model, both the appli- cation programmer and the interactive user view the data base as a time-varying collection of normalized relations of assorted degrees. Definitions of these terms and of the basic relational operations of projection and natural join are given in the Appendix.
    [Show full text]
  • Using Relational Databases in the Engineering Repository Systems
    USING RELATIONAL DATABASES IN THE ENGINEERING REPOSITORY SYSTEMS Erki Eessaar Department of Informatics, Tallinn University of Technology, Raja 15,12618 Tallinn, Estonia Keywords: Relational data model, Object-relational data model, Repository, Metamodeling. Abstract: Repository system can be built on top of the database management system (DBMS). DBMSs that use relational data model are usually not considered powerful enough for this purpose. In this paper, we analyze these claims and conclude that they are caused by the shortages of SQL standard and inadequate implementations of the relational model in the current DBMSs. Problems that are presented in the paper make usage of the DBMSs in the repository systems more difficult. This paper also explains that relational system that follows the rules of the Third Manifesto is suitable for creating repository system and presents possible design alternatives. 1 INTRODUCTION technologies in one data model is ROSE (Hardwick & Spooner, 1989) that is experimental data "A repository is a shared database of information management system for the interactive engineering about the engineered artifacts." (Bernstein, 1998) applications. Bernstein (2003) envisions that object- These artifacts can be software engineering artifacts relational systems are good platform for the model like models and patterns. Repository system contains management systems. ORIENT (Zhang et al., 2001) a repository manager and a repository (database) and SFB-501 Reuse Repository (Mahnke & Ritter, (Bernstein, 1998). Bernstein (1998) explains that 2002) are examples of the repository systems that repository manager provides services for modeling, use a commercial ORDBMS. ORDBMS in this case retrieving, and managing objects in the repository is a system which uses a database language that and therefore must offer functions of the Database conforms to SQL:1999 or later standard.
    [Show full text]
  • CONNOLLY R CAROLYN E. BEGG a Practical Approach to Design
    •.••:.... ••:••.•; ••••• •:• ; •.•••:•. • ..• .: . • •• ••••:..• CONNOLLY r CAROLYN E. BEGG 1VERS1TYOF PA1SL К m A Practical Approach to Design, Implementation, and Management Third Edition Contents Preface xxxv Part 1 Background Chapter 1 Introduction to Databases 1.1 Introduction 1.2 Traditional File-Based Systems D 1.2.1 File-Based Approach 7 1.2.2 Limitations of the File-Based Approach 12 1.3 Database Approach 14 1.3.1 The Database 14 1.3.2 The Database Management System (DBMS) 16 1.3.3 Components of the DBMS Environment 18 1.3.4 Database Design: The Paradigm Shift 20 1.4 Roles in the Database Environment 21 1.4.1 Data and Database Administrators 21 1.4.2 Database Designers 22 1.4.3 Application Developers 23 1.4.4 End-Users 23 1.5 History of Database Management Systems 23 1.6 Advantages and Disadvantages of DBMSs 25 Chapter Summary 30 Review Questions 31 Exercises 31 Chapter 2 Database Environment 33 2.1 The Three-Level ANSI-SPARC Architecture 34 2.1.1 External Level 35 2.1.2 Conceptual Level 36 2.1.3 Internal Level 36 xii Contents 2.1.4 Schemas, Mappings, and Instances 37 2.1.5 Data Independence 38 2.2 Database Languages 40 2.2.1 The Data Definition Language (DDL) 40 2.2.2 The Data Manipulation Language (DML) 41 2.2.3 Fourth-Generation Languages (4GL) 42 2.3 Data Models and Conceptual Modeling 43 2.3.1 Object-Based Data Models 44 2.3.2 Record-Based Data Models 45 2.3.3 Physical Data Models 47 2.3.4 Conceptual Modeling 47 2.4 Functions of a DBMS 48 2.5 Components of a DBMS 53 2.6 Multi-User DBMS Architectures 56 2.6.1 Teleprocessing
    [Show full text]
  • Applied Mathematics for Database Professionals
    7451FM.qxd 5/17/07 10:41 AM Page i Applied Mathematics for Database Professionals Lex de Haan and Toon Koppelaars 7451FM.qxd 5/17/07 10:41 AM Page ii Applied Mathematics for Database Professionals Copyright © 2007 by Lex de Haan and Toon Koppelaars All rights reserved. No part of this work may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage or retrieval system, without the prior written permission of the copyright owner and the publisher. ISBN-13: 978-1-59059-745-3 ISBN-10: 1-59059-745-1 Printed and bound in the United States of America 9 8 7 6 5 4 3 2 1 Trademarked names may appear in this book. Rather than use a trademark symbol with every occurrence of a trademarked name, we use the names only in an editorial fashion and to the benefit of the trademark owner, with no intention of infringement of the trademark. Lead Editor: Jonathan Gennick Technical Reviewers: Chris Date, Cary Millsap Editorial Board: Steve Anglin, Ewan Buckingham, Gary Cornell, Jonathan Gennick, Jason Gilmore, Jonathan Hassell, Chris Mills, Matthew Moodie, Jeffrey Pepper, Ben Renow-Clarke, Dominic Shakeshaft, Matt Wade, Tom Welsh Project Manager: Tracy Brown Collins Copy Edit Manager: Nicole Flores Copy Editor: Susannah Davidson Pfalzer Assistant Production Director: Kari Brooks-Copony Production Editor: Kelly Winquist Compositor: Dina Quan Proofreader: April Eddy Indexer: Brenda Miller Artist: April Milne Cover Designer: Kurt Krames Manufacturing Director: Tom Debolski Distributed to the book trade worldwide by Springer-Verlag New York, Inc., 233 Spring Street, 6th Floor, New York, NY 10013.
    [Show full text]
  • Impedance Mismatch Is Not an “Objects Vs. Relations” Problem. (DRAFT) Evgeniy Grigoriev [email protected]
    Impedance Mismatch is not an “Objects vs. Relations” Problem. (DRAFT) Evgeniy Grigoriev [email protected] The problem of impedance mismatch between applications written in OO languages and relational DB is not a problem of discrepancy between object-oriented and relational approaches themselves. Its real causes can be found in usual implementation of the ОО approach. Direct comparison of the two approaches cannot be used as a base for the conclusion that they are discrepant or mismatched. Experimental proof of the absence of contradiction between the object-oriented paradigm and the relational data model is also presented in the paper. " -Look, your worship, - said Sancho, - what we see there are not giants but windmills, and what seem to be their arms are the sails…" Miguel de Cervantes, Don Quixote In physics, the term “impedance mismatch” (IM) may be found in fields dedicated to wave processes, e.g., in acoustics or in electrodynamics. It is used to denote an effect that appears when a wave is transferred from one medium to another [IMP]. If the impedances of the two media are different ("mismatching"), the wave energy will be reflected or absorbed, so it is difficult for the wave to cross the border between the media. A similar effect occurs when one attempts to organise the data exchange between programs written with object-oriented (OO) language and relational (R) DBMS, which is referred to as “object-relational impedance mismatch” [Copeland, Ambler]. Existing difficulties are usually explained with the discrepancy in general properties of the object program and relational DB. For example, in [Ambler1], it is defined as, “The difference resulting from the fact that relational theory is based on relationships between tuples (records) that are queried, where as the object paradigm is based on relationships between objects that are traversed“.
    [Show full text]
  • On the Logic of SQL Nulls
    On the Logic of SQL Nulls Enrico Franconi and Sergio Tessaris Free University of Bozen-Bolzano, Italy lastname @inf.unibz.it Abstract The logic of nulls in databases has been subject of invest- igation since their introduction in Codd's Relational Model, which is the foundation of the SQL standard. In the logic based approaches to modelling relational databases proposed so far, nulls are considered as representing unknown values. Such existential semantics fails to capture the behaviour of the SQL standard. We show that, according to Codd's Relational Model, a SQL null value represents a non-existing value; as a consequence no indeterminacy is introduced by SQL null values. In this paper we introduce an extension of first-order logic accounting for predicates with missing arguments. We show that the domain inde- pendent fragment of this logic is equivalent to Codd's relational algebra with SQL nulls. Moreover, we prove a faithful encoding of the logic into standard first-order logic, so that we can employ classical deduction ma- chinery. 1 Relational Databases and SQL Null Values Consider a database instance with null values over the relational schema fR=2g, and a SQL query asking for the tuples in R being equal to themselves: 1 2 1 | 2 SELECT * FROM R ---+--- R : a b WHERE R.1 = R.1 AND R.2 = R.2 ; ) a | b b N (1 row) Figure 1. In SQL, the query above returns the table R if and only if the table R does not have any null value, otherwise it returns just the tuples not containing a null value, i.e., in this case only the first tuple ha; bi.
    [Show full text]
  • Projektovanie Databázových Systémov - Úvod Zoznámenie Sa
    Projektovanie databázových systémov - úvod Zoznámenie sa Prednášky a cvičenia: Jaroslav Lach Belastingdienst Centrum voor ICT, Apeldoorn Service team Fysieke media verwerking Senior software engineer Kontakt: [email protected] 0031 55 528 1272 Skype: Jaroslav Lach Zoznámenie sa II. Cvičenia a konzultácie: Jan Fikejz Organizačné záleţitosti Týţdenný kurz Prednášky a cvičenia Výuka pondelok aţ piatok 8:00 aţ 9:00 12:30 aţ 13:30 9:15 aţ 10:15 13:45 aţ 14:45 10:30 aţ 11:30 15:00 aţ 16:00 Semestrálny projekt Konzultácie Zápočet a skúška Študijná literatúra: povinná Jim Arlow, Ila Neustadt: UML 2 a unifikovaný proces vývoje aplikací. Computer Press 2007 Meilir Page-Jones: Základy objektově orientovaného návrhu v UML. Grada 2001 Motivácia • Nainštalovaním prvej verzie softwarového produktu u zákazníka sa všetko len začína.... • Chyby a problémy (hlavne pri prvých verziách) • Zmeny a rozšírenia • Ako písať software tak, aby tento aspekt bol zvládnuteľný • Aby sa dali analyzovať problémy • S minimálnym rizikom implementovať zmeny a rozšírenia Študijná literatúra: doporučená Kraval: Objektové modelování pomocí UML v praxi, díl 1, PDF e-kniha, leden 2005 Dokumentácia procesu UP (dostupná na www.eclipse.org/epf) http://www.tonymarston.net/php-mysql/database- design.html • H. Darwen & C.J. Date: Databases, types and the relational model (The third Manifesto) • C. J. Date: An Introduction to Database Systems. Addison Wesley; 8th edition 2003 Študijná literatúra: doporučená II. • Matiaško,Karol: Databázové systémy. - 1. vyd. - Ţilina
    [Show full text]
  • Handling SQL Nulls with Two-Valued Logic
    Handling SQL Nulls with Two-Valued Logic Leonid Libkin Liat Peterfreund Univ. Edinburgh / ENS-Paris, PSL / Neo4j ENS-Paris, PSL [email protected] [email protected] ABSTRACT Issues related to null handling stem from the fact that we do The design of SQL is based on a three-valued logic (3VL), rather not naturally think in terms of a three-valued logic; rather we try than the familiar Boolean logic with truth values true and false, to categorize facts as true or false. Once the third truth value – to accommodate the additional truth value unknown for handling in the case of SQL, unknown – enters the picture, our usual logic nulls. It is viewed as indispensable for SQL expressiveness, butisat often proves faulty leading to errors and unexpected behavior. We the same time much criticized for leading to unintuitive behavior illustrate this by two commonly assumed query rewriting rules. of queries and thus being a source of programmer mistakes. The first of the rules is the translation of IN subqueries into We show that, contrary to the widely held view, SQL could have EXISTS queries, described in multiple textbooks. For example, been designed based on the standard Boolean logic, without any (Q_1): SELECT R.A FROM R WHERE R.A NOT IN loss of expressiveness and without giving up nulls. The approach ( SELECT S.A FROM S ) itself follows SQL’s evaluation which only retains tuples for which conditions in the WHERE clause evaluate to true. We show that would be translated into conflating unknown, resulting from nulls, with false leads to an (Q_2): SELECT R.A FROM R WHERE NOT EXISTS equally expressive version of SQL that does not use the third truth ( SELECT S.A FROM S WHERE S.A=R.A ) value.
    [Show full text]
  • Structured Query Language (SQL)
    1 Structured Query Language (SQL) SQL (Structured Query Language) is a database computer language designed for managing data in relational database management systems (RDBMS), and originally based upon Relational Algebra. Its scope includes data query and update, schema creation and modification, and data access control. SQL was one of the first languages for Edgar F. Codd's relational model in his influential 1970 paper, "A Relational Model of Data for Large Shared Data Banks" and became the most widely used language for relational databases. History SQL was developed at IBM by Andrew Richardson, Donald C. Messerly and Raymond F. Boyce in the early 1970s. This version, initially called SEQUEL, was designed to manipulate and retrieve data stored in IBM's original relational database product; System R. IBM patented this version of SQL in 1985. During the 1970s, a group at IBM San Jose Research Laboratory developed the System R relational database management system. Donald D. Chamberlin and Raymond F. Boyce of IBM subsequently created the Structured English Query Language (SEQUEL or SEQL) to manage data stored in System R. The acronym SEQUEL was later changed to SQL because "SEQUEL" was a trademark of the UK- based Hawker Siddeley aircraft company. The first Relational Database Management System (RDBMS) was RDMS, developed at MIT in the early 1970s and Ingres, developed in 1974 at U.C. Berkeley. Ingres implemented a query language known as QUEL, which was later supplanted in the marketplace by SQL. In the late 1970s, Relational Software, Inc. (now Oracle Corporation) saw the potential of the concepts described by Codd, Chamberlin, and Boyce and developed their own SQL-based RDBMS with aspirations of selling it to the U.S.
    [Show full text]
  • Advanced Database Models
    Advanced Database Models Dr.-Ing. Eike Schallehn OvG Universität Magdeburg Fakultät für Informatik Institut für Technische und Betriebliche Informationssysteme 2019 Organization Weekly lecture I http://www.dbse.ovgu.de/dbse/en/Lectures/Lehrveranstaltungen/Advanced+Database+Models.html Weekly exercises (3 alternative slots, currently) I Starting April 15th Exams I Written exams of 120 minutes at the end of lecture period Schallehn (FIN/ITI) Advanced Database Models 2019 2 / 358 History of this Lecture Previous titles I Object-oriented Database Systems I Object-relational Database Systems Latest addition: semi-structured data models Previously held and refined by I Gunter Saake I Can Türker I Ingo Schmitt I Kai-Uwe Sattler Schallehn (FIN/ITI) Advanced Database Models 2019 3 / 358 Overview of the Lecture Data and design models I Recapitulation: the relational model 2 2 I NF and eNF I Object-oriented models I Object-relational models I Models for semi-structured data (XML) For these models we discuss I Theoretical foundations I Query Languages I Application I Standards and systems Schallehn (FIN/ITI) Advanced Database Models 2019 4 / 358 English Literature /1 Stonebraker, M.; Moore, D.: Object-Relational DBMSs: The Next Great Wave, Morgan Kaufmann Publishers, 1999 Date, C. J.; Darwen, H.: Foundation for Object / Relational Databases: The Third Manifesto, Addison-Wesley, 1998 Melton, J.:Advanced SQL: 1999 - Understanding Object-Relational and Other Advanced Features,Morgan Kaufmann, 2002 Schallehn (FIN/ITI) Advanced Database Models 2019 5 /
    [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]
  • QL: Object-Oriented Queries on Relational Data
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Dagstuhl Research Online Publication Server QL: Object-oriented Queries on Relational Data Pavel Avgustinov1, Oege de Moor2, Michael Peyton Jones3, and Max Schäfer4 1 Semmle Ltd [email protected] 2 Semmle Ltd [email protected] 3 Semmle Ltd [email protected] 4 Semmle Ltd [email protected] Abstract This paper describes QL, a language for querying complex, potentially recursive data struc- tures. QL compiles to Datalog and runs on a standard relational database, yet it provides familiar-looking object-oriented features such as classes and methods, reinterpreted in logical terms: classes are logical properties describing sets of values, subclassing is implication, and virtual calls are dispatched dynamically by considering the most specific classes containing the receiver. Furthermore, types in QL are prescriptive and actively influence program evaluation rather than just describing it. In combination, these features enable the development of concise queries based on reusable libraries, which are written in a purely declarative style, yet can be efficiently executed even on very large data sets. In particular, we have used QL to implement static analyses for various programming languages, which scale to millions of lines of code. 1998 ACM Subject Classification D.1.5 Object-oriented Programming, D.1.6 Logic Program- ming, F.3.3 Studies of Program Constructs Keywords and phrases Object orientation, Datalog, query languages, prescriptive typing Digital Object Identifier 10.4230/LIPIcs.ECOOP.2016.2 1 Introduction QL is a declarative, object-oriented logic programming language for querying complex, potentially recursive data structures encoded in a relational data model.
    [Show full text]