Search Constraints

Start Over
Filtering by: Creator Cann, David P. Remove constraint Creator: Cann, David P. Contributor Ghadakchi, Vahid Remove constraint Contributor: Ghadakchi, Vahid Degree Level Master's Remove constraint Degree Level: Master's

Search Results

  • Improving the Effectiveness of Answering Keyword Queries Using Effective Subsets

    Creator:
    Khodadadi, Abtin
    Abstract:
    Most database users do not know formal query languages, such as SQL, and prefer to express their information needs using usable query languages, such as keyword queries. Keyword queries, however, are inherently ambiguous and challenging for the database systems to understand and answer effectively. We propose a novel approach to...
    Resource Type:
    Capstone Project
    Full Text:
    retrieve the top k relevant tuples. We set the k = 20 for p@20 and MRR and k = 100 for recall. Some search

  • 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

  • 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:
    be computed using Equation. (2.2) µ ± tp σ√ |A| (2.2) where tp is the t statistic such that for p