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 88 for “"Relational databases."”.

  1. Graph analytics on relational databases

    … recent years. Conventionally, data is stored in relational databases that have been refined over decades, resulting in highly optimized data processing engines. However, the awkwardness of expressing iterative queries in SQL makes the relational query-processing model inadequate for graph …

    mit Repository record for Graph analytics on relational databases (opens in a new tab)

  2. DataSpread: scaling spreadsheets using relational databases

    … DataSpread, a system that holistically unifies databases and spreadsheets with a goal to work with massive spreadsheets: DataSpread retains all of the advantages of spreadsheets, including ease of use, ad-hoc analysis and visualization capabilities, and a schema-free nature, while also adding …

    uiuc Repository record for DataSpread: scaling spreadsheets using relational databases (opens in a new tab)

  3. Towards trusted and efficient temporal relational databases

    … develop a blockchain based database based on a relational database management system (RDBMS). The database guarantees authenticity of the stored records using immutable and verifiable signatures. The database supports query evaluation over the entire timeline of the transaction log. To support …

    uoit Repository record for Towards trusted and efficient temporal relational databases (opens in a new tab)

  4. Towards Storing 3D Model Graphs in Relational Databases

    … been developed, the storage of graph data in a relational database management system, and therefore the seamless integration into existing information systems remains an open challenge. Motivated by the use case to integrate Building Information Modeling (BIM) data into the MonArch system, we …

    passau-thes Repository record for Towards Storing 3D Model Graphs in Relational Databases (opens in a new tab)

  5. Differentially Private Synthetic Data Generation for Relational Databases

    … existing DP mechanisms to generate synthetic relational databases. The algorithm iteratively refines the relationship between individual synthetic tables to minimize their approximation errors in terms of low-order marginal distributions while maintaining referential integrity; consequently …

    mit Repository record for Differentially Private Synthetic Data Generation for Relational Databases (opens in a new tab)

  6. Easing access to relational databases : investigating access to relational databases in the context of both novice and would-be expert users

    Relational databases are commonplace in a wide variety of applications and are used by a broad range of users with varying levels of technical understanding. Extracting information from relational databases can be difficult; novice users should be able to do so without any understanding of the …

    lancaster Repository record for Easing access to relational databases : investigating access to relational databases in the context of both novice and would-be expert users (opens in a new tab)

  7. Keyword search in graphs, relational databases and social networks

    … information from structured data (e.g., relational databases and XML documents). It offers an alternative way to query languages (e.g., SQL) to explore databases, which is effective for lay users who may not be familiar with the database schema or the query language. This dissertation …

    york Repository record for Keyword search in graphs, relational databases and social networks (opens in a new tab)

  8. The Synthetic Data Vault : generative modeling for relational databases

    … (SDV), a system that builds generative models of relational databases. We are able to sample from the model and create synthetic data, hence the name SDV. When implementing the SDV, we developed an algorithm that computes statistics at the intersection of related database tables. We then use a …

    mit Repository record for The Synthetic Data Vault : generative modeling for relational databases (opens in a new tab)

  9. Towards a concurrent implementation of keyword search over relational databases.

    Vast amounts of data are stored in relational databases. Traditionally, querying this data required a deep understanding of the underlying schema in addition to knowledge of a query language such as structured query language (SQL). We present a framework for the automatic, lossless transformation …

    uoit Repository record for Towards a concurrent implementation of keyword search over relational databases. (opens in a new tab)

  10. Mapping relational databases to semantic web using domain-specific knowledge

    … inferencing about the information ("knowledge"). Relational models are limited to the interpretation of purely relational data and do not provide sufficiently rich means for interpreting the knowledge associated with the use of the data. Relational languages lack the expressiveness to represent …

    london-metro Repository record for Mapping relational databases to semantic web using domain-specific knowledge (opens in a new tab)

  11. Prime Number-Based Hierarchical Data Labeling Scheme for Relational Databases

    … a specific kind of hierarchy. Object oriented databases may also be used to model hierarchical data. Relational database systems, on the other hand, add an additional benefit of mature mathematical theory, reliable implementations, superior functionality and scalability. Relational databases

    ku Repository record for Prime Number-Based Hierarchical Data Labeling Scheme for Relational Databases (opens in a new tab)

  12. Effective semantic-based keyword search over relational databases for knowledge discovery

    … engines. The current amount of text data in relational databases is massive and is growing fast. This increases the importance and need for non-technical users to be able to search for such information using simple keyword search just as how they would search for text documents on the web. …

    wayne-thes Repository record for Effective semantic-based keyword search over relational databases for knowledge discovery (opens in a new tab)

  13. An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases

    Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership …

    brock Repository record for An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases (opens in a new tab)

  14. BlendDB : blending table layouts to support efficient browsing of relational databases

    The physical implementation of most relational databases follows their logical description, where each relation is stored in its own file or collection of files on disk. Such an implementation is good for queries that filter or aggregate large portions of a single table, and provides reasonable …

    mit Repository record for BlendDB : blending table layouts to support efficient browsing of relational databases (opens in a new tab)

  15. The cost modeling of automotive body-in-white assembly using relational databases

    Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Materials Science and Engineering, 1997.

    mit Repository record for The cost modeling of automotive body-in-white assembly using relational databases (opens in a new tab)

  16. On the use of NAND flash memory in high-performance relational databases

    High-density NAND flash storage has become relatively inexpensive due to the popularity of various consumer electronics. Recently, several manufacturers have released IDE-compatible NAND flash-based drives in sizes up to 64 GB at reasonable (sub-$1000) prices. Because flash is significantly more …

    mit Repository record for On the use of NAND flash memory in high-performance relational databases (opens in a new tab)

  17. Dynamic Switching of GOP Configurations in High Efficiency Video Coding (HEVC) using Relational Databases for Multi-objective Optimization

    … modes. Additionally, this thesis also presents a relational database formulation for supporting multiple devices that are characterized by different screen resolutions and computational resources. This approach is applicable to internet-based video streaming to different devices where the videos …

    unm Repository record for Dynamic Switching of GOP Configurations in High Efficiency Video Coding (HEVC) using Relational Databases for Multi-objective Optimization (opens in a new tab)

  18. Objektinių ir reliacinių duomenų bazių taikymas objektiškai orientuoto programavimo kontekste /

    This MA paper aims at object and relational databases application comparison in the context of object oriented programming. Joint usage of databases and object oriented programming raises two problems relevant today. First problem is impedance mismatch of relational databases and object oriented …

    vilnius Repository record for Objektinių ir reliacinių duomenų bazių taikymas objektiškai orientuoto programavimo kontekste / (opens in a new tab)

Page 1 of 5