A decomposition algorithm for distributed hash join query processing

Database systems are increasing in importance as stage repositories for applications like CAD and AI. These applications demand efficient support for queries that are more complex than the common business queries that are supported well by most systems. More queries are also of an ad-hoc nature, limiting the utility of precompilation approaches. The need for fast response to make AI and CAD applications feasible also has further motivated research into techniques for exploiting resources in a distributed system for improved performance. This paper explores query decomposition techniques for complex query processing in distributed database systems and exposes the deficiencies associated with current algorithms.<
>