Search Constraints

Start Over
Filtering by: Creator Silverthorne, G. Wesley Remove constraint Creator: Silverthorne, G. Wesley Advisor Termehchy, Arash Remove constraint Advisor: Termehchy, Arash License All rights reserved Remove constraint License: All rights reserved

Search Results

  • Principles of Variational Databases

    Creator:
    Ataei, Parisa S.
    Abstract:
    Data variations are prevalent in real-world applications. For example, software vendors have to handle numerous variations in the business requirements, conventions, and environmental settings of a software product. In database-backed software, the database of each version may have a different schema and content. As another example, data scientists often need...
    Resource Type:
    Masters Thesis

  • Learning to Estimate Multi-Relation Aggregation Functions

    Creator:
    Jadhav, Rashmi Suresh
    Abstract:
    Multi-relation aggregation queries process the join operator before computing the aggregation function. This join is arguably the most costly operation since traditional join algorithms spend majority of their time trying to join the parts of the relations that do not generate any output tuples. This causes slow response times with...
    Resource Type:
    Masters Thesis
    Full Text:
    loop join (z = 3) (g) Response Time z = 3 Figure 5.4: Q15 Response time of bandit join compared to

  • Relational Learning over Dirty Data Using Data Constraints

    Creator:
    Lee, Ga Young
    Abstract:
    Real-world datasets are dirty and contain many errors. Examples of these issues are violations of integrity constraints, duplicates, and inconsistencies in representing data values and entities. Applying machine learning on dirty databases may lead to inaccurate results. Users have to spend a lot of time and effort repairing data errors...
    Resource Type:
    Masters Thesis

  • Collaborative Online Learning For Join Processing

    Creator:
    Xie, Mian
    Abstract:
    Relational binary operators, such as join, are arguably the most costly and frequently used operations in relational data systems. In many join algorithms, the majority of the process time is spent on scanning and attempting to join the parts of the relations that do not satisfy the join condition and...
    Resource Type:
    Capstone Project

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation

  • Usable and Scalable Querying of Scientific Datasets

    Creator:
    McCamish, Benjamin J.
    Abstract:
    Scientists and engineers have to analyze and query multiple large databases. Analysis over databases created by phasor measurement units can provide insight into the health of the grid, thereby improving control over operations. Realizing this data-driven control, however, requires validating, processing and storing massive amounts of PMU data efficiently, which...
    Resource Type:
    Dissertation

  • Redesigning the Structure and Access Paths of Databases for Effective and Efficient Query Processing

    Creator:
    Ghadakchi, Vahid
    Abstract:
    Many database users are not familiar with formal query languages, the concept of schema, or the exact content of their database. Thus, it is challenging for these users to formulate their information needs over semi-structured and structured databases. To address this problem, researchers have proposed usable query interfaces over which...
    Resource Type:
    Dissertation