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 6 of 6 for “"Duplicate Elimination"”.

  1. Modeling and Querying Uncertainty in Data Cleaning

    Data quality problems such as duplicate records, missing values, and violation of integrity constrains frequently appear in real world applications. Such problems cost enterprises billions of dollars annually, and might have unpredictable consequences in mission-critical tasks. The process of data …

    waterloo Repository record for Modeling and Querying Uncertainty in Data Cleaning (opens in a new tab)

  2. Modelling and formal verification of spes query equivalence tool using isabelle/hol /

    … in query optimization, automated grading and duplicate elimination in data pipelines. Several solvers for this problem exist, however not every solver has been formally verified. A bug in such a solver could lead to silent data corruption, making formal verification a worthwhile investment. …

    vilnius Repository record for Modelling and formal verification of spes query equivalence tool using isabelle/hol / (opens in a new tab)

  3. An object-oriented data and query model

    … primary key constraint presence is used to avoid duplicate elimination of a result set. We show the importance of tight coupling in each translation step from an EERM to an algebraic expression. Also we identify invariant constructs, e.g. primary key through a select operand, which do not change …

    whiterose Download PDF for An object-oriented data and query model (opens in a new tab)

  4. Cache-Oblivious Searching and Sorting in Multisets

    … Finding the most frequent element (the mode), duplicate elimination and finally multi-sorting. We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context under which the cache size and block size are unknown. We start by …

    waterloo Repository record for Cache-Oblivious Searching and Sorting in Multisets (opens in a new tab)

  5. LEAST FIXED POINT COMPUTING IN RELATIONAL DATABASE

    … manipulation, cost of inference, and cost of duplicate elimination. Four sample logic programs are chosen to be evaluated using B+-tree and B++-tree, respectively. Experiment data is collected. Based on the cost model, it is revealed that inference(join) cost is the dominating contributor to …

    nus Repository record for LEAST FIXED POINT COMPUTING IN RELATIONAL DATABASE (opens in a new tab) Download file for LEAST FIXED POINT COMPUTING IN RELATIONAL DATABASE (opens in a new tab)

  6. An Integrated Approach to Improve Data Quality

    … applications. Issues in data quality such as duplicate records, inaccurate data, violations of integrity constraints, and outdated data are common in databases. Thus, data in databases are often unclean. Such issues in data quality might cost billions of dollars annually and might have severe …

    mcmaster Repository record for An Integrated Approach to Improve Data Quality (opens in a new tab)