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 5 of 5 for “"Merge-join"”.
-
XQuery Query Processing in Relational Systems
… are proposed and implemented. The preferable <em>merge-join</em> approach is also proposed to avoid the inefficient <em>nested-loop</em> evaluation for FLWR expressions. <em>Merge-join</em> patterns and query rewriting rules are designed to identify XQuery fragments that can utilize the efficient …
-
Efficient Oblivious Database Joins
… 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 Oblivious RAM (ORAM). We present an oblivious algorithm for equi-joins which (up to a logarithmic factor) matches the optimal …
-
Relational Joins on GPUs for In-Memory Database Query Processing
Relational join processing is one of the core functionalities in database management systems. Implementing join algorithms on parallel platforms, especially modern GPUs, has gain a lot of momentum in the past decade. This dissertation addresses the following issues on GPU join algorithms. First, we …
-
Distributed processing of navigational query languages for RDF
… and more interconnected. This facilitates the emergence of semantic knowledge bases such as DBpedia, YAGO, Microsoft’s Satori, and Google’s Knowledge Vault. However, querying such semantic knowledge bases, which have often a high degree of diversity in the structure and vocabulary, poses new …
-
Distributed processing of navigational query languages for RDF
… and more interconnected. This facilitates the emergence of semantic knowledge bases such as DBpedia, YAGO, Microsoft’s Satori, and Google’s Knowledge Vault. However, querying such semantic knowledge bases, which have often a high degree of diversity in the structure and vocabulary, poses new …