This thesis deals with aspects of using the common, universal relational table editor as a simple information system, which would be fully independent on the underlying database system and partially independent on the underlying's database schema. One part of this thesis deals with potential of using such universal information system to create a framework to allow fast and easy development of small and medium information systems. The practical part of this thesis is the application, which implements the basics of simple relational table editor, which is fully independent on the underlying database provider and schema and servers as the demonstrative table editor.

Graph traversals are a basic but fundamental ingredient for a variety of graph algorithms and graph-oriented queries. To achieve the best possible query performance, they need to be implemented at the core of a database management system that aims at storing, manipulating, and querying graph data. Increasingly, modern business applications demand native graph query and processing capabilities for enterprise-critical operations on data stored in relational database management systems. In this paper we propose an extensible graph traversal framework (GRAPHITE) as a central graph processing component on a common storage engine inside a relational database management system. We study the influence of the graph topology on the execution time of graph traversals and derive two traversal algorithm implementations specialized for different graph topologies and traversal queries. We conduct extensive experiments on GRAPHITE for a large variety of real-world graph data sets and input configurations. Our experiments show that the proposed traversal algorithms differ by up to two orders of magnitude for different input configurations and therefore demonstrate the need for a versatile framework to efficiently process graph traversals on a wide range of different graph topologies and types of queries. Finally, we highlight that the query performance of our traversal implementations is competitive with those of two native graph database management systems.

The writing system used by the ancient Maya civilization has intrigued researchers and aficionados for centuries. Now that it has mostly been deciphered, the emphasis in the field of Mayan epigraphy has shifted to a study of the system of phonological, morphological, and grammatical rules that once governed the language that the hieroglyphs encode. One of the most important resources for linguistic study of this type is a comprehensive, electronic corpus of texts to investigate phraseology, frequency information, and collocations. Because Mayan linguistic epigraphy is in the early stages, a publicly available, editable corpus would be an invaluable resource in arriving at consensual readings. Unfortunately, no such corpus currently exists. The purpose of this project is to present MayanWiki as a relational database of hieroglyphic transcriptions and transliterations with a wiki frontend that includes advanced search functionality that meets the aforementioned criteria. The principle behind the wiki is to accelerate the convergence of readings to the "truth". Once the database is fully populated by users, it will become a valuable tool allowing them to manipulate data in ways that will facilitate scientific discovery of new and interesting linguistic patterns.

Data Warehouses (DW) have to continuously adapt to evolving business requirements, which implies structure modification (schema changes) and data migration requirements in the system design. However, it is challenging for designers to control the performance and cost overhead of different schema change implementations. In this paper, we demonstrate SCIT, a tool for DW designers to test and implement different logical design alternatives in a two-fold manner. As a main functionality, SCIT translates common DW schema modifications into directly executable SQL scripts for relational database systems, facilitating design and testing automation. At the same time, SCIT assesses changes and recommends alternative design decisions to help designers improve logical designs and avoid common dimensional modeling pitfalls and mistakes. This paper serves as a walk-through of the system features, showcasing the interaction with the tool’s user interface in order to easily and effectively modify DW schemata and enable schema change analysis.

No description available.

No description available.

This project investigates the feasibility of migrating from an SQL database utilizing complex stored procedures to a NoSQL database, specifically focusing on the Saab application BAAS. The motivation behind the investigation is that the stored procedures are complex to maintain. The aim is to determine whether such a migration can simplify the database structure while maintaining acceptable performance levels. The study involves developing a proof of concept by translating a frequently used SQL stored procedure into application-sided logic implemented with MongoDB, a document-oriented NoSQL database. Performance tests comparing execution times of SQL stored procedures and the NoSQL alternative showed that while SQL stored procedures are faster due to primarily pre-compilation and optimized indexing, the NoSQL solution achieves acceptable execution times and offers enhanced maintainability and flexibility. This report provides a detailed evaluation of the potential benefits and drawbacks of migrating to NoSQL, emphasizing the importance of optimizing indexing strategies to close the performance gap. The findings suggest that, despite the time investment required for migration, the reduction in complexity and improved maintainability may justify the transition for organizations facing similar challenges.

The aim of this Thesis is implement Aplication Programming Interface (API) with support of XML native documents. First part deal with introduction of XML model and with this markup language related technologies. Alfter that the thesis describe individual XML native databases solutions and focus to issues of persistence XML data stored in relational databases, analyse mapping methods applicable to their relational model. After that the thesis describe design and implementation of the API, which afford a resources for XML documents data holding and manipulating in relational database system. The final section of this thesis is assignment to aplication tests and evaluation of results.

The objective of this work is to design and implement an Object-relational framework for PHP. This framework will be able to map objects to traditional relational database tables. In this work, an appropriate solution of  metadata specification is presented. These metadata describe how an object can be store in a relational database. The framework itself is able to store, load and query any object data in relational database. This object-relational framework has been designed for simple portability among various database systems.

XML is an emerging standard format for data on the Web as well as in business applications. In order to store and access this information in an efficient manner, database technology must be utilized. A relational database system, the most established and mature technology for query processing and storage, creates a strong foundation for such an XML data management system. However, while relational databases are based on SQL queries, the original user queries are written in XQuery, an XML query language. This XML query language has support for order-sensitive queries as XML is an order-sensitive markup language. A major problem has been discovered with loading XML in a relational database. That problem is the lack of native SQL support for and management of order handling. While XQuery has order and positional support, SQL does not have the same support. For example, individuals who were viewing XML information about music albums would have a hard time querying for the first three songs of a track list from a relational backend. Mapping XML documents to relational backends also proves hard as the data models (hierarchical elements versus flat tables) are so different. For these reasons, and other purposes, the Rainbow System is being developed at WPI as a system that bridges XML data and relational data. This thesis in particular deals with the algebra operators that affect order, order sensitive loading and mapping of XML documents, and the pushdown of order handling into SQL-capable query engines. The contributions of the thesis are the order-sensitive rewrite rules, new XML to relational mappings with different order styles, order-sensitive template-driven SQL generation, and a proposed metadata table for order-sensitive information. A system that implements these proposed techniques with XQuery as the XML query language and Oracle as the backend relational storage system has been developed. Experiments were created to measure execution time based on various factors. First, scalability of the system as backend data set size grows is studied. Second, scalability of the system as results returned from the database grows, and finally, query execution times with different loading types are explored. The experimental results are encouraging. Query execution with the relational backend proves to be much faster than native execution within the Rainbow system. These results confirm the practical utility of our proposed order-sensitive XQuery execution solution over relational data.