Set Valued Attributes

2005 ◽  
pp. 632-637 ◽  
Author(s):  
Karthikeyan Ramasamy ◽  
Prasad M. Deshpande
Keyword(s):  
Relational Database ◽  
Data Model ◽  
Relational Databases ◽  
Database Systems ◽  
Sql Server ◽  
Relational Model ◽  
Database Model ◽  
Competitive Edge ◽  
The Past ◽  
Relational Database Systems

About three decades ago, when Codd (1970) invented the relational database model, it took the database world by storm. The enterprises that adapted it early won a large competitive edge. The past two decades have witnessed tremendous growth of relational database systems, and today the relational model is by far the dominant data model and is the foundation for leading DBMS products, including IBM DB2, Informix, Oracle, Sybase, and Microsoft SQL server. Relational databases have become a multibillion-dollar industry.

An Evaluation of Dynamic Electronic Catalog Models in Relational Database Systems

2011 ◽  
pp. 73-90 ◽  
Author(s):  
Kiryoong Kim ◽  
Dongkyu Kim ◽  
Jeuk Kim ◽  
Sang-uk Park ◽  
Ighoon Lee ◽  
...  
Keyword(s):  
Electronic Commerce ◽  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Relational Schemas ◽  
Electronic Catalogs ◽  
Electronic Catalog ◽  
Software Product ◽  
New Models ◽  
Relational Database Systems

Electronic catalogs are electronic representations about products and services in the electronic commerce environment and require diverse and flexible schemas. Although relational database systems seem to be an obvious choice for their storage, traditional designs of relational schemas do not support electronic catalogs in the most effective ways. Therefore, new models for managing diverse and flexible schemas in relational databases are required for such systems. Proposed in this paper are several models for electronic catalogs using relational tables, and an experimental evaluation of their efficiency. The results of this study can be put to practical use and are, in fact, being applied in the design of a commercial software product.

scholarly journals Analysis of the possibilities of optimizing SQL queries

2021 ◽  
Vol 19 ◽  
pp. 151-158
Author(s):  
Piotr Rymarski ◽  
Grzegorz Kozieł
Keyword(s):  
Relational Database ◽  
Web Applications ◽  
Query Language ◽  
Database Systems ◽  
Sql Server ◽  
Management Systems ◽  
Relational Database Systems ◽  
The Impact ◽  
Relational Database Management ◽  
Test Scenarios

Most of today's web applications run on relational database systems. Communication with them is possible through statements written in Structured Query Language (SQL). This paper presents the most popular relational database management systems and describes common ways to optimize SQL queries. Using the research environment based on fragment of the imdb.com database, implementing OracleDb, MySQL, Microsoft SQL Server and PostgreSQL engines, a number of test scenarios were performed. The aim was to check the performance changes of SQL queries resulting from syntax modication while maintaining the result, the impact of database organization, indexing and advanced mechanisms aimed at increasing the eciency of operations performed, delivered in the systems used. The tests were carried out using a proprietary application written in Java using the Hibernate framework.

scholarly journals Performance analysis of relational databases Oracle and MS SQL based on desktop application

2018 ◽  
Vol 8 ◽  
pp. 263-269
Author(s):  
Grzegorz Dziewit ◽  
Jakub Korczyński ◽  
Maria Skublewska-Paszkowska
Keyword(s):  
Binary Data ◽  
Relational Databases ◽  
Database Systems ◽  
Database System ◽  
Sql Server ◽  
External Application ◽  
Oracle Database ◽  
Sql Server Database ◽  
Relational Database Systems ◽  
Mean Time

Comparison of efficiency is not a trivial phenomenon because of disparities between different database systems. This paper presents a methodology of comparing relational database systems in respect of mean time of execution individual DML queries containing subqueries and conjunction of tables. The presented methodology can be additionally accommodated to studies of efficiency in a range of database system itself (study of queries executed directly in database engine). The described methodology allows to receive statement telling which database system is better in comparison to another in dependency of functionalities fulfilled by external application. In the article the analysis of mean time of execution individual DML queries was performed.Two research hypotheses have been put forward: "Microsoft SQL Server database system needs less time to execute INSERT and UPDATE queries than Oracle database" and "Oracle database system needs less time to execute DML queries with binary data than SQL Server"

Graph Encoding and Recursion Computation

2005 ◽  
pp. 1309-1316
Author(s):  
Yangjun Chen
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Cad Cam ◽  
Relational Systems ◽  
Relational Database Systems ◽  
Novel Applications ◽  
General Opinion ◽  
Office Systems ◽  
Document Databases

It is a general opinion that relational database systems are inadequate for manipulating composite objects that arise in novel applications such as Web and document databases (Abiteboul, Cluet, Christophides, Milo, Moerkotte & Simon, 1997; Chen & Aberer, 1998, 1999; Mendelzon, Mihaila & Milo, 1997; Zhang, Naughton, Dewitt, Luo & Lohman, 2001), CAD/ CAM, CASE, office systems and software management. Especially, when recursive relationships are involved, it is cumbersome to handle them in relational databases, which sets current relational systems far behind the navigational ones (Kuno & Rundensteiner, 1998; Lee & Lee, 1998). To overcome this problem, a lot of interesting graph encoding methods have been developed to mitigate the difficulty to some extent. In this article, we give a brief description of some important methods, including analysis and comparison of their space and time complexities.

Re-grouping information in a domain-theoretic data model

1998 ◽  
Vol 8 (1) ◽  
pp. 67-92
Author(s):  
HERMANN PUHLMANN
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Relational Databases ◽  
Relational Model ◽  
Theoretic Approach ◽  
Database Model ◽  
Nested Data ◽  
Building Type ◽  
Type Constructor ◽  
First Time

In recent years, the problem of incorporating a set-building type-constructor into a domain theoretic data model has been addressed by different authors. In Jung and Puhlmann (1995) and Puhlmann (1995) we have shown why the so-called snack powerdomain is particularly suitable for modelling a set constructor. We obtain a generalized database model that covers the nested relational model.While, with the snack powerconstruction, the data structure of domain theoretic databases seems clear, suitable operations for the data model are still to be defined.In this paper we start this task by defining the operations nest and unnest for the passage between different nesting-levels of the snack powerconstruction. These functions are shown to form an embedding-projection pair, a property that the corresponding functions of nested relational databases do not have. This demonstrates the usefulness of the domain-theoretic approach for modelling databases: for the first time we have operators for re-grouping nested data that respect the idea of an information ordering.The use of the snack powerdomain leads to fairly complex formulas. To help the reader, illustrations and pictorial interpretations of formulas are given throughout the paper.

scholarly journals Towards a Technique for Extracting Relational Actors from Monolithic Applications

2019 ◽  
Author(s):  
Rodrigo Laigner ◽  
Sérgio Lifschitz ◽  
Marcos Kalinowski ◽  
Marcus Poggi ◽  
Marcos Antonio Vaz Salles
Keyword(s):  
Open Source ◽  
Relational Database ◽  
Data Model ◽  
Database Systems ◽  
Actor Model ◽  
Reactor Modeling ◽  
Relational Data Model ◽  
Relational Database Systems ◽  
And Behavior ◽  
Novel Model

Relational actors, or reactors for short, integrate the actor model with the relational data model, providing an abstraction for enabling actor-relational database systems. However, as a novel model of computation for databases, there is no extensive work on reasoning about reactor modeling. To close this gap, this paper aims to propose as well as evaluate a technique to extract reactors from a monolithic system. For evaluation, we selected a REST-based open-source OLTP system in which a decomposition to microservices was conducted and applied our technique on its predecessor monolithic version. Our technique led to the same set of decisions, regarding table and behavior selection, taken by experts when decomposing the same system into microservices. The proposed technique can be seen as a first step towards supporting practitioners in decomposing OLTP systems into reactors.

Towards the Maturity of Object-Relational Database Technology: Promises and Reality

2015 ◽  
Vol 6 (4) ◽  
pp. 1-19 ◽  
Author(s):  
Negin Keivani ◽  
Abdelsalam M. Maatuk ◽  
Shadi Aljawarneh ◽  
Muhammad Akhtar Ali
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Database System ◽  
Relational Database System ◽  
Key Factor ◽  
Object Relational ◽  
Database Technology ◽  
Relational Database Systems ◽  
Additional Object

Object-relational technology provides a significant increase in scalability and flexibility over the traditional relational databases. The additional object-relational features are particularly satisfying for advanced database applications that relational database systems have experienced difficulties. The key factor to the success of object-relational database systems is their performance. This paper aims to review the promises of Object-Relational database systems, examine the reality, and how their promises may be fulfilled through unification with the relational technology. To investigate the performance implications of using object-relational relative to relational technology, the query-oriented BUCKY benchmark has been previously applied to an early object-relational database system, i.e., Illustra 97. This paper presents the results obtained from implementing and running the BUCKY benchmark on Oracle 10g. The results acquired from the work described in this paper are compared with the results obtained in BUCKY benchmark. This study throws light on the functionality of object-relational databases, where object-relational technology has made improvements but some limitations are identified as well. In general, the performance of relational supersedes that of object-relational database system.

Closing the Gap Between XML and Relational Database Technologies

2010 ◽  
pp. 1-27
Author(s):  
Mary Ann Malloy ◽  
Irena Mlynkova
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Data Representation ◽  
Xml Data ◽  
Advantages And Disadvantages ◽  
Closing The Gap ◽  
Relational Database Systems ◽  
Xml Technologies

As XML technologies have become a standard for data representation, it is inevitable to propose and implement efficient techniques for managing XML data. A natural alternative is to exploit tools and functions offered by relational database systems. Unfortunately, this approach has many detractors, especially due to inefficiency caused by structural differences between XML data and relations. But, on the other hand, relational databases represent a mature, verified and reliable technology for managing any kind of data including XML documents. In this chapter, the authors provide an overview and classification of existing approaches to XML data management in relational databases. They view the problem from both state-of-the-practice and state-of-the-art perspectives. The authors describe the current best known solutions, their advantages and disadvantages. Finally, they discuss some open issues and their possible solutions.

Sign in / Sign up

Export Citation Format

Share Document