Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 740 for “"relational database"”.
-
Complex graph algorithms using relational database
… neglecting the well established and widely used relational database management systems (RDBMS's). In this dissertation, we study three fundamental graph problems in RDBMS. The first problem we tackle is computing shortest paths (SP) from a source to a target in large network graphs. We explore …
-
Mutation Analysis of Relational Database Schemas
… key artefact used to describe the structure of a relational database, specifying how data will be stored and the integrity constraints used to ensure it is valid. It is therefore surprising that to date little work has addressed the problem of schema testing, which aims to identify mistakes in the …
-
Query Optimization for Relational Database Systems
This report develops a new algorithm for computing the Cartesian product and join of large relations which attempts to take maximum advantage of available main-memory buffer space.
-
Visual assessment and relational database management
… have been included in the assessment and a relational database management program has been used in the storage of all collected data. As a result of this process, it was found that a new method, which borrows from past processes, addresses the needs of the land planner, and utilizes an …
-
Relational database applications' optimization and performance study
… efficient query processing techniques for large relational database applications since, when such applications have to process more than a million records, performance becomes a key issue. Some techniques rely upon massive hardware architectures and new database software to improve efficiency of …
-
LEAST FIXED POINT COMPUTING IN RELATIONAL DATABASE
… of least fixed point(LFP) operator in relational database context. The special case of transitive closure(TC) computing is studied intensively. TC algorithms can be classified into two types: set-oriented and tuple-oriented algorithms. Performance of TC computing were studied …
-
Self–optimization in relational database management systems /
Most query planners are implemented as a set of specialized algorithms combined by hand written heuristics. Creating such planner requires an enormous amount of time and expertise, not to mention that due to a rather small exploration of search space planners can return suboptimal results. In this …
-
Interval-Dependent Attributes in Relational Database Systems
… joins, on data with time intervals using relational database systems can be attributed to the lack of primitives for the alignment of intervals. Even more challenges arise, when the data includes attribute values that are interval-dependent, such as project budgets or cumulative costs, and …
-
Validation of queries to a relational database
… intentions. A method of assisting users of a relational data base to formulate query language expressions which are valid representations of the abstract query which the user wishes to put is developed. The central focus of the thesis is a method of communicating the critical aspects of the …
-
Mitigating Insider Threat in Relational Database Systems
… investigates insider threat in cloud relational database systems (cloud RDMS). It discusses the vulnerabilities in the cloud computing structure that may enable insiders to launch attacks. To prevent such threats, the dissertation suggests three models and addresses the advantages and …
-
Memory system for a relational database processor
<p>An associative memory for a relational database management system, with content addressing capability, is studied and analyzed. The system utilizes one level of indexing and the database is clustered. The logic-per-track approach is used for parallel processing of the data in a cylinder. The …
-
Automated Software Testing of Relational Database Schemas
Relational databases are critical for many software systems, holding the most valuable data for organisations. Data engineers build relational databases using schemas to specify the structure of the data within a database and defining integrity constraints. These constraints protect the data's …
-
Evaluation of relational database implementation of triple-stores
… queries to equivalent SQL queries operating on a relational representation of RDF triples, and the physical optimization of that representation using the IBM DB2 relational database management system. Performance was evaluated using the Berlin SPARQL Benchmark. The results show that the …
Page 1 of 37