DOCSLIB.ORG

Extending Data Processing Capabilities of Relational Database Management Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Extending Data Processing Capabilities of Relational Database Management Systems Extending Data Processing Capabilities of Relational Database Management Systems. Igor Wojnicki Cezary Z. Janikow University of Missouri { St. Louis University of Missouri { St. Louis Department of Mathematics Department of Mathematics and Computer Science and Computer Science 8001 Natural Bridge Road 8001 Natural Bridge Road St. Louis, MO 63121{4499 St. Louis, MO 63121{4499 phone: (314) 516-6353 phone: (314) 516-6352 fax: (314) 516-5400 fax: (314) 516-5400 e-mail: [email protected] e-mail: [email protected] Abstract Relational Database Management Sys- 1 The Relational Model tems proven to be robust and efficient for storing and retrieving data. However, they have limita- The relational model represents a database as tions. Sophisticated data processing (a rule-based a collection of relations [1, 2, 3]. Each relation processing with inferences) is possible but hard to is characterized by its name and attributes. A implement. To overcome these problems, several set of attribute values for a certain relation is methods have been developed. Data can be processed called a tuple. A value of the attribute is de- by a client application (a client-side processing) termined by the attribute domain (data type). or by a RDBMS server (a server-side processing). A domain is a set of atomic (indivisible) val- These methods overcome the main limitations, but ues. A relation schema is defined as a relation such solutions are not flexible, hard to modify or al- name (R) and a list of attributes(Ai): ter. This paper presents a novel approach, a case of R(A ;A ;:::;A ) server-side processing with the use of a declarative 1 2 n language. A program, written in Prolog, is decom- The domain is defined for each attribute posed into relations, and stored in the database. It dom(Ai). A relation state (or just relation) can be easily managed, modified or altered. It has of the relation schema R(A1;A2;:::;An), de- access to database relations, and it also has an abil- noted by r(R), is a set of tuples t1; : : : ; tm, ity to create relations on demand, so-called dynamic where each tuple is an ordered list of n values views or Jelly Views. Jelly Views serve as tempo- t =< v1; : : : ; vn >, and each value vi is an ele- rary relations holding data obtained as the result of ment of dom(Ai) or null (does not exist). The the program. The communication interface between values in tuple t are referred to as t[Ai], so by the client and the database is preserved, it is still the attribute's name. Relations represent facts SQL. about entities or facts about relationships be- tween relations. A relational database schema is a set of relation schemas: S = R1;:::;Ro 2 RDBMS Boundaries Keywords: RDBMS, Prolog, deductive Each Relational Database Management Sys- database, inference tem uses two languages: Data Definition Lan- guage for defining a relational database schema The Acceptable Solutions problem is another and Data Manipulation Language for storing application where RDBMS can not be applied and retrieving data. directly. It can be also called a Reverse Ag- SQL has evolved as a high level, robust and gregation. Let's use the same Traveling Sales- compact DDL and DML query language. The man Problem. The question would be: find all power of SQL lies in its declarative nature. paths shorter then some value. Each path is a A query can be expressed in a logical form list of cities. As a result, the replay would be a with little care for procedural processing. It set of paths. Each path would be shorter than gives meaningful and highly abstractive way the given in the query value. for querying. But here is a limitation. SQL There are several applications where these offers an abstract interface allowing to build so- problems appear: phisticated queries, but more complicated data phone billing: this usually involves so- processing is out of reach. In particular, the • phisticated rule-based processing, cost of following disadvantages can be identified: connections is calculated basing on differ- lack of more sophisticated, i.e. rule-based ent variables: day time, number of active • data processing, phone numbers of the customer, calling plan, length of the call etc.; rules are sub- a query can not be recursive, ject to change, • searching for acceptable solutions is lim- flight planes, trip planning (the Traveling • ited. • Salesman Problem in general), Rule-based processing requires rules, usu- budget planning, alternative flight/trip • ally the a form of decision trees. Decisions routes. are based on information acquired from a These problems can be tackled using either database. At each node of such a tree, the client-side processing, or server-side processing database is queried and the replay is compared with functions. with appropriate values (or set of values) in the Client-side processing is based on serializa- node. Depending on the comparison, the next tion of queries and taking actions accordingly node of the tree is taken and the process contin- to partial replies. The process is as follows: the ues. Rule-based processing is a core part of the client sends a query, the RDBMS replies, de- most Expert and DDB (Deductive Database) pending on the reply the client sends another systems [4, 5, 2]. query. The logic is usually hard-coded into the Recursive queries, in general, regard search- client. There are a few drawbacks of such a ing for data which is stored in some tree-like or solution: graph-like way. The Traveling Salesman Prob- lem can be an example. A relation holds infor- the inference process involves many mation about distances between neighboring • queries, cities, there is no data redundancy. A relaxed queries are not optimized by the RDBMS question is: find the shortest path between two • given cities. If the question was asked with (series of simple queries and travel known number of cities on the path, it would through a decission tree instead of few be issued as an ordinary query. However, usu- more complex queries), ally the number of cities is not known in ad- with the decision tree hard-coded into the vance. SQL3 (known also as SQL99) standard • client, it is hard to modify the logic, allows recursive queries. However, this feature is very rarely implemented (it is implemented only dedicated client software is able to in DB2 [6]). • conduct the inference process, and thus the principle of a database as a universal where, < a1; : : : ; an > is a tuple (ordered list of source of information fails. values). There is an analogy between a relation and a clause. (in terms of the Relational Model Such a solution is implemented in expert sys- see Sec. 1) Both of them describe facts using tems, with an external RDBMS data source. tuples. In the case of the Relational Model, a Server-side processing seems to be more ro- value in the tuple can be referenced using ap- bust, but there is a need for support from propriate attribute name or its position, while RDBMS in the form of additional languages, for the Logic Programming only position can usually procedural ones. Using such a lan- be used. Concluding, any Relational Model tu- guage, a function can be written. A user query ple can be represented as a simple clause, so can use such a function as a data-source. Com- compatibility between the relational databases paring to client-side processing, the number of and logic programs has been stated. queries is reduced, a function is stored and pro- Furthermore logic programs can be con- cessed by the RDBMS so it is optimized, and structed with so-called complex clauses. Such the database remains an universal source of in- a clause doesn't express facts explicitly, but formation. Still, there are a few drawbacks: defines relationships among them (intensional knowledge), with a conclusion. the function's language is RDBMS spe- • cific, can be used only for dedicated RDBMS, con(C1;:::;Cn) c1(Ci :::;Cj) 1 ::: 4 ::: r cm(Ck;:::;Cl): logic, i.e. decission tree, is hard-coded 4 • within the function code, inflexible, hard to modify, Here, con is the concluding clause with arity the input and output for the function have n; are logical operators joining predicates • 4 to be known when the function is defined. cq (preconditions). Predicates such as cq are matched against their clauses. If such a match is found, appropriate facts are set and the con- 3 Relational Model vs Logic cluding tuple is passed as a new fact. As a result, a non-deterministic conclusion can be In general, knowledge processing involves two drawn; a single complex clause can generate kinds of data: extensional and intensional. multiple conclusions, and new facts. Function- Extensional knowledge is just bare facts, ality of complex clauses is not supported by the while intensional defines relationships among Relational Model. facts. Logic can be used to express extensional Logic Programs provide a uniform language and intensional knowledge as well [7]. To for- for representation of databases and even more, malize syntax for writing logical sentences, the enabling additional expressive power in the alphabet has to be stated. Data (or knowl- form of intensional knowledge. edge) is stored as predicates. A predicate p is defined as a symbol denoting appropriate rela- tion among n number of arguments: 4 Logic Programs in RDBMS p=n The main proposed improvement to RDMBS is adding capabilities to store and process inten- where n is called its arity. A fact compound sional knowledge, along with the extensional of n values, concerning predicate p is named a one. The inference engine will be coupled simple clause: with the data source, and available to a client through standard SQL queries [8].
Load more

Recommended publications
  • Not ACID, Not BASE, but SALT a Transaction Processing Perspective on Blockchains
    Not ACID, not BASE, but SALT A Transaction Processing Perspective on Blockchains Stefan Tai, Jacob Eberhardt and Markus Klems Information Systems Engineering, Technische Universitat¨ Berlin fst, je, [email protected] Keywords: SALT, blockchain, decentralized, ACID, BASE, transaction processing Abstract: Traditional ACID transactions, typically supported by relational database management systems, emphasize database consistency. BASE provides a model that trades some consistency for availability, and is typically favored by cloud systems and NoSQL data stores. With the increasing popularity of blockchain technology, another alternative to both ACID and BASE is introduced: SALT. In this keynote paper, we present SALT as a model to explain blockchains and their use in application architecture. We take both, a transaction and a transaction processing systems perspective on the SALT model. From a transactions perspective, SALT is about Sequential, Agreed-on, Ledgered, and Tamper-resistant transaction processing. From a systems perspec- tive, SALT is about decentralized transaction processing systems being Symmetric, Admin-free, Ledgered and Time-consensual. We discuss the importance of these dual perspectives, both, when comparing SALT with ACID and BASE, and when engineering blockchain-based applications. We expect the next-generation of decentralized transactional applications to leverage combinations of all three transaction models. 1 INTRODUCTION against. Using the admittedly contrived acronym of SALT, we characterize blockchain-based transactions There is a common belief that blockchains have the – from a transactions perspective – as Sequential, potential to fundamentally disrupt entire industries. Agreed, Ledgered, and Tamper-resistant, and – from Whether we are talking about financial services, the a systems perspective – as Symmetric, Admin-free, sharing economy, the Internet of Things, or future en- Ledgered, and Time-consensual.
    [Show full text]
  • CHAPTER 3 - Relational Database Modeling
    DATABASE SYSTEMS Introduction to Databases and Data Warehouses, Edition 2.0 CHAPTER 3 - Relational Database Modeling Copyright (c) 2020 Nenad Jukic and Prospect Press MAPPING ER DIAGRAMS INTO RELATIONAL SCHEMAS ▪ Once a conceptual ER diagram is constructed, a logical ER diagram is created, and then it is subsequently mapped into a relational schema (collection of relations) Conceptual Model Logical Model Schema Jukić, Vrbsky, Nestorov, Sharma – Database Systems Copyright (c) 2020 Nenad Jukic and Prospect Press Chapter 3 – Slide 2 INTRODUCTION ▪ Relational database model - logical database model that represents a database as a collection of related tables ▪ Relational schema - visual depiction of the relational database model – also called a logical model ▪ Most contemporary commercial DBMS software packages, are relational DBMS (RDBMS) software packages Jukić, Vrbsky, Nestorov, Sharma – Database Systems Copyright (c) 2020 Nenad Jukic and Prospect Press Chapter 3 – Slide 3 INTRODUCTION Terminology Jukić, Vrbsky, Nestorov, Sharma – Database Systems Copyright (c) 2020 Nenad Jukic and Prospect Press Chapter 3 – Slide 4 INTRODUCTION ▪ Relation - table in a relational database • A table containing rows and columns • The main construct in the relational database model • Every relation is a table, not every table is a relation Jukić, Vrbsky, Nestorov, Sharma – Database Systems Copyright (c) 2020 Nenad Jukic and Prospect Press Chapter 3 – Slide 5 INTRODUCTION ▪ Relation - table in a relational database • In order for a table to be a relation the following conditions must hold: o Within one table, each column must have a unique name. o Within one table, each row must be unique. o All values in each column must be from the same (predefined) domain.
    [Show full text]
  • Relational Query Languages
    Relational Query Languages Universidad de Concepcion,´ 2014 (Slides adapted from Loreto Bravo, who adapted from Werner Nutt who adapted them from Thomas Eiter and Leonid Libkin) Bases de Datos II 1 Databases A database is • a collection of structured data • along with a set of access and control mechanisms We deal with them every day: • back end of Web sites • telephone billing • bank account information • e-commerce • airline reservation systems, store inventories, library catalogs, . Relational Query Languages Bases de Datos II 2 Data Models: Ingredients • Formalisms to represent information (schemas and their instances), e.g., – relations containing tuples of values – trees with labeled nodes, where leaves contain values – collections of triples (subject, predicate, object) • Languages to query represented information, e.g., – relational algebra, first-order logic, Datalog, Datalog: – tree patterns – graph pattern expressions – SQL, XPath, SPARQL Bases de Datos II 3 • Languages to describe changes of data (updates) Relational Query Languages Questions About Data Models and Queries Given a schema S (of a fixed data model) • is a given structure (FOL interpretation, tree, triple collection) an instance of the schema S? • does S have an instance at all? Given queries Q, Q0 (over the same schema) • what are the answers of Q over a fixed instance I? • given a potential answer a, is a an answer to Q over I? • is there an instance I where Q has an answer? • do Q and Q0 return the same answers over all instances? Relational Query Languages Bases de Datos II 4 Questions About Query Languages Given query languages L, L0 • how difficult is it for queries in L – to evaluate such queries? – to check satisfiability? – to check equivalence? • for every query Q in L, is there a query Q0 in L0 that is equivalent to Q? Bases de Datos II 5 Research Questions About Databases Relational Query Languages • Incompleteness, uncertainty – How can we represent incomplete and uncertain information? – How can we query it? .
    [Show full text]
  • The Relational Data Model and Relational Database Constraints
    chapter 33 The Relational Data Model and Relational Database Constraints his chapter opens Part 2 of the book, which covers Trelational databases. The relational data model was first introduced by Ted Codd of IBM Research in 1970 in a classic paper (Codd 1970), and it attracted immediate attention due to its simplicity and mathematical foundation. The model uses the concept of a mathematical relation—which looks somewhat like a table of values—as its basic building block, and has its theoretical basis in set theory and first-order predicate logic. In this chapter we discuss the basic characteristics of the model and its constraints. The first commercial implementations of the relational model became available in the early 1980s, such as the SQL/DS system on the MVS operating system by IBM and the Oracle DBMS. Since then, the model has been implemented in a large num- ber of commercial systems. Current popular relational DBMSs (RDBMSs) include DB2 and Informix Dynamic Server (from IBM), Oracle and Rdb (from Oracle), Sybase DBMS (from Sybase) and SQLServer and Access (from Microsoft). In addi- tion, several open source systems, such as MySQL and PostgreSQL, are available. Because of the importance of the relational model, all of Part 2 is devoted to this model and some of the languages associated with it. In Chapters 4 and 5, we describe the SQL query language, which is the standard for commercial relational DBMSs. Chapter 6 covers the operations of the relational algebra and introduces the relational calculus—these are two formal languages associated with the relational model.
    [Show full text]
  • SQL Vs Nosql: a Performance Comparison
    SQL vs NoSQL: A Performance Comparison Ruihan Wang Zongyan Yang University of Rochester University of Rochester [email protected] [email protected] Abstract 2. ACID Properties and CAP Theorem We always hear some statements like ‘SQL is outdated’, 2.1. ACID Properties ‘This is the world of NoSQL’, ‘SQL is still used a lot by We need to refer the ACID properties[12]: most of companies.’ Which one is accurate? Has NoSQL completely replace SQL? Or is NoSQL just a hype? SQL Atomicity (Structured Query Language) is a standard query language A transaction is an atomic unit of processing; it should for relational database management system. The most popu- either be performed in its entirety or not performed at lar types of RDBMS(Relational Database Management Sys- all. tems) like Oracle, MySQL, SQL Server, uses SQL as their Consistency preservation standard database query language.[3] NoSQL means Not A transaction should be consistency preserving, meaning Only SQL, which is a collection of non-relational data stor- that if it is completely executed from beginning to end age systems. The important character of NoSQL is that it re- without interference from other transactions, it should laxes one or more of the ACID properties for a better perfor- take the database from one consistent state to another. mance in desired fields. Some of the NOSQL databases most Isolation companies using are Cassandra, CouchDB, Hadoop Hbase, A transaction should appear as though it is being exe- MongoDB. In this paper, we’ll outline the general differences cuted in iso- lation from other transactions, even though between the SQL and NoSQL, discuss if Relational Database many transactions are execut- ing concurrently.
    [Show full text]
  • Relational Schema Database Design
    Relational Schema Database Design Venezuelan Danny catenates variedly. Fleeciest Giraldo cane ingeniously. Wolf is quadricentennial and administrate thereat while inflatable Murray succor and desert. So why the users are vital for relational schema design of data When and database relate to access time in each relation cannot delete all databases where employees. Parallel create index and concatenated indexes are also supported. It in database design databases are related is designed relation bc, and indeed necessary transformations in. The column represents the set of values for a specific attribute. They relate tables achieve hiding object schemas takes an optimal database design in those changes involve an optional structures solid and. If your database contains incorrect information, even with excessive entities, the field relating the two tables is the primary key of the table on the one side of the relationship. By schema design databases. The process of applying the rules to your database design is called normalizing the database, which can be conducted at the School or at the offices of the client as they prefer. To identify the specific customers who mediate the criteria, and the columns to ensure field. To embassy the columns in a table, exceed the cluster key values of a regular change, etc. What is Cloud Washing? What you design databases you cannot use relational database designing and. Database Design Washington. External tables access data in external sources as if it were in a table in the database. A relational schema for a compress is any outline of how soon is organized. The rattle this mapping is generally performed is such request each thought of related data which depends upon a background object, but little are associated with overlapping elements, there which only be solid level.
    [Show full text]
  • Relational Algebra and SQL Relational Query Languages
    Relational Algebra and SQL Chapter 5 1 Relational Query Languages • Languages for describing queries on a relational database • Structured Query Language (SQL) – Predominant application-level query language – Declarative • Relational Algebra – Intermediate language used within DBMS – Procedural 2 1 What is an Algebra? · A language based on operators and a domain of values · Operators map values taken from the domain into other domain values · Hence, an expression involving operators and arguments produces a value in the domain · When the domain is a set of all relations (and the operators are as described later), we get the relational algebra · We refer to the expression as a query and the value produced as the query result 3 Relational Algebra · Domain: set of relations · Basic operators: select, project, union, set difference, Cartesian product · Derived operators: set intersection, division, join · Procedural: Relational expression specifies query by describing an algorithm (the sequence in which operators are applied) for determining the result of an expression 4 2 The Role of Relational Algebra in a DBMS 5 Select Operator • Produce table containing subset of rows of argument table satisfying condition σ condition (relation) • Example: σ Person Hobby=‘stamps’(Person) Id Name Address Hobby Id Name Address Hobby 1123 John 123 Main stamps 1123 John 123 Main stamps 1123 John 123 Main coins 9876 Bart 5 Pine St stamps 5556 Mary 7 Lake Dr hiking 9876 Bart 5 Pine St stamps 6 3 Selection Condition • Operators: <, ≤, ≥, >, =, ≠ • Simple selection
    [Show full text]
  • Plantuml Language Reference Guide
    Drawing UML with PlantUML Language Reference Guide (Version 5737) PlantUML is an Open Source project that allows to quickly write: • Sequence diagram, • Usecase diagram, • Class diagram, • Activity diagram, • Component diagram, • State diagram, • Object diagram. Diagrams are defined using a simple and intuitive language. 1 SEQUENCE DIAGRAM 1 Sequence Diagram 1.1 Basic examples Every UML description must start by @startuml and must finish by @enduml. The sequence ”->” is used to draw a message between two participants. Participants do not have to be explicitly declared. To have a dotted arrow, you use ”-->”. It is also possible to use ”<-” and ”<--”. That does not change the drawing, but may improve readability. Example: @startuml Alice -> Bob: Authentication Request Bob --> Alice: Authentication Response Alice -> Bob: Another authentication Request Alice <-- Bob: another authentication Response @enduml To use asynchronous message, you can use ”->>” or ”<<-”. @startuml Alice -> Bob: synchronous call Alice ->> Bob: asynchronous call @enduml PlantUML : Language Reference Guide, December 11, 2010 (Version 5737) 1 of 96 1.2 Declaring participant 1 SEQUENCE DIAGRAM 1.2 Declaring participant It is possible to change participant order using the participant keyword. It is also possible to use the actor keyword to use a stickman instead of a box for the participant. You can rename a participant using the as keyword. You can also change the background color of actor or participant, using html code or color name. Everything that starts with simple quote ' is a comment. @startuml actor Bob #red ' The only difference between actor and participant is the drawing participant Alice participant "I have a really\nlong name" as L #99FF99 Alice->Bob: Authentication Request Bob->Alice: Authentication Response Bob->L: Log transaction @enduml PlantUML : Language Reference Guide, December 11, 2010 (Version 5737) 2 of 96 1.3 Use non-letters in participants 1 SEQUENCE DIAGRAM 1.3 Use non-letters in participants You can use quotes to define participants.
    [Show full text]
  • A Developer's Guide to Data Modeling for SQL Server
    Praise for A Developer’s Guide to Data Modeling for SQL Server “Eric and Joshua do an excellent job explaining the importance of data modeling and how to do it correctly. Rather than relying only on academic concepts, they use real-world ex- amples to illustrate the important concepts that many database and application develop- ers tend to ignore. The writing style is conversational and accessible to both database design novices and seasoned pros alike. Readers who are responsible for designing, imple- menting, and managing databases will benefit greatly from Joshua’s and Eric’s expertise.” —Anil Desai, Consultant, Anil Desai, Inc. “Almost every IT project involves data storage of some kind, and for most that means a relational database management system (RDBMS). This book is written for a database- centric audience (database modelers, architects, designers, developers, etc.). The authors do a great job of showing us how to take a project from its initial stages of requirements gathering all the way through to implementation. Along the way we learn how to handle some of the real-world design issues that typically surface as we go through the process. “The bottom line here is simple. This is the book you want to have just finished read- ing when your boss says ‘We have a new project I would like your help with.’” —Ronald Landers, Technical Consultant, IT Professionals, Inc. “The Data Model is the foundation of the application. I’m pleased to see additional books being written to address this critical phase. This book presents a balanced and pragmatic view with the right priorities to get your SQL server project off to a great start and a long life.” —Paul Nielsen, SQL Server MVP, SQLServerBible.com “This is a truly excellent introduction to the database design methodology that will work for both novices and advanced designers.
    [Show full text]
  • Relational Database Fundamentals
    05_04652x ch01.qxp 7/10/06 1:45 PM Page 7 Chapter 1 Relational Database Fundamentals In This Chapter ᮣ Organizing information ᮣ Defining database ᮣ Defining DBMS ᮣ Comparing database models ᮣ Defining relational database ᮣ Considering the challenges of database design QL (pronounced ess-que-ell, not see’qwl) is an industry-standard language Sspecifically designed to enable people to create databases, add new data to databases, maintain the data, and retrieve selected parts of the data. Various kinds of databases exist, each adhering to a different conceptual model. SQL was originally developed to operate on data in databases that follow the relational model. Recently, the international SQL standard has incorporated part of the object model, resulting in hybrid structures called object-relational databases. In this chapter, I discuss data storage, devote a section to how the relational model compares with other major models, and provide a look at the important features of relational databases. Before I talk about SQL, however, I need to nail down what I mean by the term database. Its meaning has changed as computers have changed the way people record and maintain information. COPYRIGHTED MATERIAL Keeping Track of Things Today, people use computers to perform many tasks formerly done with other tools. Computers have replaced typewriters for creating and modifying documents. They’ve surpassed electromechanical calculators as the best way to do math. They’ve also replaced millions of pieces of paper, file folders, and file cabinets as the principal storage medium for important information. Compared to those old tools, of course, computers do much more, much faster — and with greater accuracy.
    [Show full text]
  • Fast Foreign-Key Detection in Microsoft SQL
    Fast Foreign-Key Detection in Microsoft SQL Server PowerPivot for Excel Zhimin Chen Vivek Narasayya Surajit Chaudhuri Microsoft Research Microsoft Research Microsoft Research [email protected] [email protected] [email protected] ABSTRACT stored in a relational database, which they can import into Excel. Microsoft SQL Server PowerPivot for Excel, or PowerPivot for Other sources of data are text files, web data feeds or in general any short, is an in-memory business intelligence (BI) engine that tabular data range imported into Excel. enables Excel users to interactively create pivot tables over large data sets imported from sources such as relational databases, text files and web data feeds. Unlike traditional pivot tables in Excel that are defined on a single table, PowerPivot allows analysis over multiple tables connected via foreign-key joins. In many cases however, these foreign-key relationships are not known a priori, and information workers are often not be sophisticated enough to define these relationships. Therefore, the ability to automatically discover foreign-key relationships in PowerPivot is valuable, if not essential. The key challenge is to perform this detection interactively and with high precision even when data sets scale to hundreds of millions of rows and the schema contains tens of tables and hundreds of columns. In this paper, we describe techniques for fast foreign-key detection in PowerPivot and experimentally evaluate its accuracy, performance and scale on both synthetic benchmarks and real-world data sets. These techniques have been incorporated into PowerPivot for Excel. Figure 1. Example of pivot table in Excel. It enables multi- dimensional analysis over a single table.
    [Show full text]
  • Accessing a Relational Database Through an Object-Oriented Database Interface (Extended Abstract)
    Accessing a Relational Database through an Object-Oriented Database Interface (extended abstract) J. A. Orenstein D. N. Kamber Object Design, Inc. Credit Suisse [email protected] [email protected] Object-oriented database systems (ODBs) are Typically, their goal is not to migrate data from designedfor use in applicationscharacterized by complex relational databases into object-oriented databases. data models, clean integration with the host ODBs and RDBs are likely to have different programming language, and a need for extremely fast performance characteristics for some time, and it is creation, traversal, and update of networks of objects. therefore unlikely that one kind of systemcan displace Theseapplications are typically written in C or C++, and the other. Instead,the goal is to provide accessto legacy the problem of how to store the networks of objects, and databasesthrough object-orientedinterfaces. update them atomically has been difficult in practice. For this reason, we designed and developed, in Relational databasesystems (RDBs) tend to be a poor fit conjunction,with the Santa Teresa Labs of IBM, the for these applications because they are designed for ObjectStoreGateway, a systemwhich providesaccess to applications with different performance requirements. relationaldatabasesthrough the ObjectStoreapplication ODBs are designedto meet theserequirements and have programming interface (API). ObjectStore queries, proven more successful in pioviding”persistence for collectionand cursor operationsare translatedinto SQL. applicationssuch as ECAD and MCAD.’ The tuple streamsresulting from execution of the SQL Interest in ODBs has-spread be$ond the CAD query are turned into objects;these objects may be either communities, to areas such as finance and transient, or persistent, stored in an ObjectStore telecommunications.
    [Show full text]