Search Constraints

Start Over
Filtering by: Creator Leonard, Jeffrey M. Remove constraint Creator: Leonard, Jeffrey M. Advisor Termehchy, Arash Remove constraint Advisor: Termehchy, Arash Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • 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:
    main memory or buffer. To assess the cost of nested loop join we assume that there are a total of M

  • 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
    Full Text:
    versa, i.e., m to n joins. S-scan may leverage a similar method of learning and exploiting its learned

  • 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
    Full Text:
    IMDb data (h=hours, m=minutes, s=seconds). . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87