A nested set approach for building recursive XML tree structures from relational databases

This paper compares two approaches to meeting the data handling requirements of Intermedia, a hypermedia system developed at the Institute for Research in Information and Scholarship at Brown University. Intermedia, though written using an object-oriented programming language, relies on a traditional relational database management system for data storage and retrieval. We examine the ramifications of replacing the relational database with an object-oriented database. We begin by describing the important characteristics each database system. We then describe Intermedia and give an overview of its architecture and its data handling requirements. We explain why and how we used a relational database management system and the problems that we encountered with this system. We then present the design of an object-oriented database schema for Intermedia and compare the relational and object-oriented database management system approaches.

Relational database management systems (RDBMSs) have been a common option to manage structured data over the past decades. In recent years, with the prevalence of big data applications, vast unstructured and semi-structured data are generated, deeply challenging the relational model used in RDBMSs. For this reason, a wide spectrum of NoSQL databases are developed for managing unstructured, semi-structured or structured data. For example, graph database management systems (GDBMSs) are commonly used as an important category of NoSQL databases, to manage sophisticated graph data as well as relational data. Nonetheless, as claimed in existing literatures, both RDBMSs and GDBMSs are capable of managing graph data and relational data, the boundaries of them still remain unclear. In this paper, we propose a unified benchmark for RDBMSs and GDBMSs, to evaluate them under the same metrics, and report which category is better in different application scenarios. We conduct extensive experiments over the unified benchmark, and report our findings: (1) RDBMSs are significantly faster for aggregations and order by operations, (2) GDBMSs are shown to be superior for projection, multi-table join and deep recursive operations, (3) GDBMSs and RDBMSs are comparable for two-table join and shallow recursive operations.

Hierarchical part-of relationships/aggregation structures and related queries are essential parts of information systems. However, relational database query languages do not explicitly support hierarchical relationships and queries. A hierarchical query may require a great number of join operations, which increases the effort in query formulation. Therefore, we propose path expressions in formulating hierarchical views over relational data because path expressions are a conventional and compact way to represent hierarchical relationships. We embed path expressions within SQL queries and compile them to standard SQL. This ensures that the path expressions can straightforwardly be implemented on the top of standard relational database systems. The compilation of a path expression is given by an attribute grammar, a conventional formalism to define the semantics of a language.

Relational Database Management Systems (RDBMS) have been very successful at managing structured data with well-defined schemas. Despite this, relational systems are generally not the first choice for management of data where schemas are not pre-defined or must be flexible in the face of variations and changes. Instead, No-SQL database systems supporting JSON are often selected to provide persistence to such applications. JSON is a light-weight and flexible semi-structured data format supporting constructs common in most programming languages. In this paper, we analyze the way in which requirements differ between management of relational data and management of JSON data. We present three architectural principles that facilitate a schema-less development style within an RDBMS so that RDBMS users can store, query, and index JSON data without requiring schemas. We show how these three principles can be applied to industry-leading RDBMS platforms, such as the Oracle RDBMS Server, with relatively little effort. Consequently, an RDBMS can unify the management of both relational data and JSON data in one platform and use SQL with an embedded JSON path language as a single declarative language to query both relational data and JSON data. This SQL/JSON approach offers significant benefits to application developers as they can use one product to manage both relational data and semi-structured flexible schema data.

This paper is devoted to new aspects of Natural Language Interface to Relational Database (NLIDB) integration into third-party corporate environments related to control data access. Because there is no schema information in the input NL query and the different relational database management system (RDBMS) requires different meta-data types and rules to control data access, developers meet a problem addressed to automatic data access control in the case of NL interface implementation to relational databases. In the paper, we suggest a comprehensive approach which takes into account permissions throughout the pipeline of transforming NL query into SQL query with an intermediate SPARQL representation. Our integration solutions based on well-known Ontology Based Data Access (OBDA) approach, which gives us the opportunity to adapt the proposed solutions to the specifics of access control facilities of various RDBMS. Suggested approach has been implemented within intelligent service, named Reply.

In IT industry research communities and data scientists have observed that Big Data has challenged the legacy of solutions. ‘Big Data’ term used for any collection of data or data sets which is so large and complex and difficult to process and manage using traditional data processing applications and existing Relational Data Base Management Systems (RDBMSs). In Big Data; the most important challenges include analysis, capture, curation, search, sharing, storage, transfer, visualization and privacy. As the data increases in various dimensions with various features like structured, semi structured and unstructured with high velocity, high volume and high variety; the RDBMSs face another fold of challenges to be studied and analyzed. Due to the aforesaid limitations of RDBMSs, data scientists and information managers forced to rethink about alternative solutions for handling such data with 3Vs.Initially research study focused on to develop an intelligent base for decision makers so that alternative solutions for long term suitable solutions and handle the data and information with 3Vs can be designed. In this research attempts has been made to analyze the feature based capabilities of RDBMSs and then performance experimentation, observation and analysis has been done with Big Data handling tools and technologies. The features considered for scientific observation and analysis were resource consumption, execution time, on demand scalability, maximum data size, structure of the data, data visualization, and ease of deployment, cost and security. Finally the research provides a decision support metrics for decision makers in selecting the appropriate tool or technology based on the nature of data to be handled in the target organizations.

3D protein structure similarity searching is one of the most popular processes performed in the structural bioinformatics. The process is usually performed through dedicated websites or desktop software tools, which makes a secondary processing of the search results difficult. One of the alternatives is to store macromolecular data in relational databases and perform the similarity searching on the server-side of the client-server architecture. Unfortunately, relational database management systems (DBMSs) are not designed for efficient storage and processing of biological data, such as 3D protein structures. In this paper, we present the P3D-SQL extension to the Oracle PL/SQL language that allows invoking protein similarity searching in SQL queries and perform the process efficiently against a database of 3D protein structures. Availability: P3D-SQL is available from P3D-SQL project home page at: http://zti.polsl.pl/w3/dmrozek/science/p3dsql.htm

The main problem has been managing databases because they are continuously expanding quickly and getting more complicated in terms of volume, variety, and velocity. Currently, Relational Database Management Systems (RDMS), also known as SQL, or traditional search engines are primarily used to manage and utilize data collection. Due to their highly semantic properties and applications, relational databases have emerged as powerful and superior during the previous two decades. The handling of a high volume of data and the variability in data type and structure has become a laborious task since Big Data entered the IT industry. Relational databases are inadequate to handle such big data due to their rigid data limitations, structure, relations, and other factors. As a result, data aggregation is rendered impossible. NoSQL databases offer a practical and understandable foundation for combining massive amounts of data, structures, and interactions. Data modeling and migration are now needed in order to define the issue. There isn't yet a tool for switching from relational to no-SQL databases. For this migration, relational (SQL) database queries must be converted to NoSQL database queries. Since relational databases (RDBMS) have found it difficult to keep up with modernization, NoSQL has emerged as the most practical database. This essay aims to highlight and assess the applications of NoSQL, the notion of NoSQL data modeling, and the NoSQL database migration procedure. NoSQL, NoSQL Roadmap, Data Modeling, ETL Approach for Data Migration, Data Loading, and Data Extraction.

Based on the characteristics of hierarchical data, a multilevel model was used to analysis possible influencing factors of urinary cadmium levels in one county population, and to discuss the advantages of multilevel model for processing hierarchical data in practical problems. In May 2013, 1 460 participants aged 20 and above in 12 administrative villages in one county in central China were recruited by cluster sampling. Urinary cadmium level and its possible influencing factors were investigated, and cadmium level in farmland soil of survey area was also tested. A total of 1 410 participants completed the survey and met the inclusion criterion. 318 farmland samples in survey area were detected. According to the data, individuals were set as the level one unit, and the village was set as level two unit. the data were analyzed by MIXED procedure for hierarchical data of SAS 9.3 software. In the case of not considering the hierarchy of data, the general linear model was fitted by SAS 9.3 software, and the fitting results of the two models were compared. A total of 1 410 participants were included finally, the age was (55.2 ± 11.1) years. 645 (45.74%) were males and 765 (54.26%) were females. The amount of household per capita consumption of rice was (100.9 ± 40.3) kg/y. All 18.65% (262/1 410) of the participants had mining and mineral separation work experience. The urinary cadmium level was (9.39 ± 2.16) µg/g Cr. Most of the soil cadmium levels in villages were greater than tolerance value. The fitting results of general linear model suggested that whether doing mining and mineral separation work does not have significant difference (χ(2) = 1.05, P = 0.305). There was significant difference in the village soil cadmium levels, age, the amount of household per capita consumption of rice, and gender (χ(2) = 401.39, 34.9, 4.16 and 86.15, respectively, P < 0.01, <0.01, 0.041, <0.01, respectively). The fitting result of empty model showed the ICC was 0.435 5, the urinary cadmium had clustering at village level. The results of multilevel model showed that the explanatory variables of the village soil cadmium levels, age, the amount of household per capita consumption of rice and gender had significant difference (Wald χ(2) values 2.55, 6.34, 2.37 and 10.32, respectively, P = 0.029, <0.01, = 0.018 and <0.01), while whether doing mining and mineral separation work had no significant difference (χ(2) = 0.78, P = 0.438). To the fitting optimization index using for the comparison of models, the results of multilevel model were less than that of general linear model. The regression coefficient of level-2 explanatory variable (the village soil cadmium levels) was 0.84, which could explain the 35.26% of the total variance. Multilevel model could analyze hierarchical data more reasonably than general linear model. Urinary cadmium levels is highly influenced by the village soil cadmium levels.

The aim of this research is to build an open schema model for digital sources repository in the relational database. It required us to develop a few advanced techniques. One of them was to keep and maintain a hierarchical data structure pushed into the repository. The second was to create constraints on any hierarchical level that allow enforcing data integrity and consistency. The created solution is mainly based on a JSON as a native column type, which was designed for holding open schema documents. In this paper, we present the model for any repository that uses hierarchical dynamic data. Additionally, we include a structure for normalizing input and description for data to keep all the model assumptions. We compared our solution with well-known open schema model -- Entity-Attribute-Value -- in the scope of saving data and querying about relationship and content from structure. Results have shown that we achieved improvement in both performance and disk space usage, although we extended our model with a few new features that the previous model does not include. The techniques developed in this research can be applied in every domain where hierarchical dynamic data is required, as demonstrated by the digital book repository that we have presented.

Structured Query Language (SQL) is commonly used in Relational Database Management Systems (RDBMS) and is currently one of the most popular data definition and manipulation languages. Its core functionality is implemented, with only some minor variations, throughout all RDBMS products. It is an effective tool in the process of managing and querying data in relational databases. This paper describes a method to effectively automate the conversion of a data query from a Natural Language Query (NLQ) to Structured Query Language (SQL) with Online Analytical Processing (OLAP) cube data warehouse objects. To obtain or manipulate the data from relational databases, the user must be familiar with SQL and must also write an appropriate and valid SQL statement. However, users who are not familiar with SQL are unable to obtain relevant data through relational databases. To address this, we propose a Natural Language Processing (NLP) model to convert an NLQ into an SQL query. This allows novice users to obtain the required data without having to know any complicated SQL details. The model is also capable of handling complex queries using the OLAP cube technique, which allows data to be pre-calculated and stored in a multi-dimensional and ready-to-use format. A multi-dimensional cube (hypercube) is used to connect with the NLP interface, thereby eliminating long-running data queries and enabling self-service business intelligence. The study demonstrated how the use of hypercube technology helps to increase the system response speed and the ability to process very complex query sentences. The system achieved impressive performance in terms of NLP and the accuracy of generating different query sentences. Using OLAP hypercube technology, the study achieved distinguished results compared to previous studies in terms of the speed of the response of the model to NLQ analysis, the generation of complex SQL statements, and the dynamic display of the results. As a plan for future work, it is recommended to use infinite-dimension (n-D) cubes instead of 4-D cubes to enable ingesting as much data as possible in a single object and to facilitate the execution of query statements that may be too complex in query interfaces running in a data warehouse. The study demonstrated how the use of hypercube technology helps to increase system response speed and process very complex query sentences.

Call me Ishmael. We are about to learn about the White Whale: the Relational Database Management System (RDBMS). RDBMS is the most common type of data storage in business today, because it is a proven and well-supported technology. In this chapter, I will discuss what a relational database is and how you can use one. I will try to touch on most aspects of the relational database, but a relational database is too large of a whale to cover in one chapter.

In the last two decades, unstructured information has become a major challenge in information management. Such challenge is caused by the massive and increasing amount of information resulting from the conversion of almost all daily tasks into digital format. Tools and applications are necessary in organizing unstructured information, which can be found in structured data, such as in relational database management systems (RDBMS). RDBMS has robust and powerful structures for managing, organizing, and retrieving data. However, structured data still contains unstructured information. In this paper, the methods used for managing unstructured data in RDBMS are investigated. In addition, an incremental and dynamic repository for managing unstructured data in relational databases are introduced. The proposed technique organizes unstructured information through linkages among textual data based on semantics. Furthermore, it provides users with a good picture of the unstructured information. The proposed technique can rapidly and easily obtain useful data, and thus, it can be applied in numerous domains, particularly those who deal with textual data, such as news articles.KeywordsRelational databasesUnstructured dataDocument clusteringQuery efficiencyTextual data

Both object-oriented and relational database management systems are referred to as DBMS. The web-scale is expanding at an incredible rate, and with it comes an increase in mobile applications, technologies, and social media platforms. The rapid growth of these technologies produces a variety of structured and unstructured data in various forms, each of which has various consequences for data security. Using RDBMS and OODBMS, this study's methodology outlines the development, installation, and management process of multiple and complicated data sets. This study gives a documented study comparing different kinds of data stored in databases by employing two types of database techniques: relational database method and object-oriented database technique. We use a different fingerprint database for the web and mobile devices. This database is also managed using different technologies, such as MySQL, and it accommodates data generated using distinct methods. In addition, this study explores the benefits and advantages of the various databases and determines the ideal database management system for organizations. According to the survey's findings, RDBMS stores data and the relationships between them in tables, but OODBMS stores data in objects, in a manner analogous to Object-Oriented Programming (OOP). According to the study's findings, the primary distinction between relational database management systems (RDBMS) and object-oriented database management systems (OODBMS) is that RDBMS is a Database Management System based on the relational model. In contrast, OODBMS is a Database Management System that facilitates creating and modeling data as objects.

Multilevel modeling (MLM) should be used when a researcher has collected hierarchical data. For example, when a researcher investigates an outcome variable (e.g., depression) with several clients drawn from different clinicians, the data set has a hierarchical structure. Herein, we describe the use of MLM in counseling research. The goals include the following: (a) to specify research contexts where MLM may be applied, (b) to describe how to conduct data analyses using MLM, and (c) to highlight key statistical and design issues encountered when analyzing hierarchical data. We also highlight how MLM can be used (a) to provide valid statistical inference in the presence of hierarchical data structure, (b) to separate the within-group effects from between-group effects for predictor variables, and (c) to study the interactions among predictor variables drawn from different levels (e.g., variables drawn from both clients and their clinicians).