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 2 of 2 for “"database joins"”.

  1. Efficient Oblivious Database Joins

    … This problem is particularly relevant to cloud databases that wish to allow queries over the client’s encrypted data. One of the major obstacles to such a goal is the join operator, which is non-trivial to implement obliviously without resorting to generic but inefficient solutions like …

    waterloo Repository record for Efficient Oblivious Database Joins (opens in a new tab)

  2. Implementation of Tetris as a Model Counter

    … originally designed for handling natural database joins, as an exact model counter for the #SAT problem, where we want to count the number of satisfying solutions to a SAT formula. Tetris uses a simple geometric framework, yet manages to achieve the fractional hypertree-width bound. While …

    buffalo Repository record for Implementation of Tetris as a Model Counter (opens in a new tab)