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 1 of 1 for “"Worst-case Optimal Join"”.

  1. A comprehensive and efficient framework for subgraph matching

    … matching framework, I divide the problem into cases of small patterns and large patterns because pattern sizes determine the research direction. In the small pattern case, I design a multilevel sharing solution to improve subgraph matching computation and achieve the goal through systematic …

    uiuc Repository record for A comprehensive and efficient framework for subgraph matching (opens in a new tab)