Query processing in a distributed system requires the transmissions of data between computers in a network. For a given query, there exist several strategies that a distributed DBMS may choose to execute in order to generate results. All these strategies produce the same result but incur different query execution costs. The problem of finding an optimal query execution strategy in distributed database systems has been shown to be NP-hard [WC96]. Due to this, heuristic algorithms are necessary in solving the query processing problem but no matter what heuristics are used, the efficiency of executing a query depends heavily on the type of reducer used. Employing the AHY Algorithm [AHY83] to decompose general queries into schedules of simple q...
The 2-way semijoin is proposed as an important extended version of the semijoin, which adds a backwa...
A semijoin is a relational operator which reduces a relation by selecting a set of tuples that match...
The utilizing of semi-join is often a common starting point for join algorithms in distributed datab...
The efficiency of query processing strategies is critical for system performance in any distributed ...
In Distributed Database Systems, the principal objective is to find an execution strategy which mini...
[[abstract]]Traditional semijoin and semijoin with multiple hash functions are two important methods...
This paper addresses the processing of a query in distributed database systems using a sequence of s...
The cost-effective reduction of relations by semijoins is the basis of the heuristic approach to dis...
This research is concerned with a model and a method of minimizing the inter-site data traffic incur...
The technology of distributed databases (DDB) is based on two other technologies which have develope...
[[abstract]]The problem of optimal query processing in distributed database systems was shown to be ...
The problem of optimal query processing in distributed database systems was shown to be NP-hard. How...
The problem of optimal query processing in distributed database systems was shown to be NP-hard. Thi...
Different from a centralized database system, distributed query processing involves data transmissio...
[[abstract]]The authors identify some optimality properties of a special type of tree queries, namel...
The 2-way semijoin is proposed as an important extended version of the semijoin, which adds a backwa...
A semijoin is a relational operator which reduces a relation by selecting a set of tuples that match...
The utilizing of semi-join is often a common starting point for join algorithms in distributed datab...
The efficiency of query processing strategies is critical for system performance in any distributed ...
In Distributed Database Systems, the principal objective is to find an execution strategy which mini...
[[abstract]]Traditional semijoin and semijoin with multiple hash functions are two important methods...
This paper addresses the processing of a query in distributed database systems using a sequence of s...
The cost-effective reduction of relations by semijoins is the basis of the heuristic approach to dis...
This research is concerned with a model and a method of minimizing the inter-site data traffic incur...
The technology of distributed databases (DDB) is based on two other technologies which have develope...
[[abstract]]The problem of optimal query processing in distributed database systems was shown to be ...
The problem of optimal query processing in distributed database systems was shown to be NP-hard. How...
The problem of optimal query processing in distributed database systems was shown to be NP-hard. Thi...
Different from a centralized database system, distributed query processing involves data transmissio...
[[abstract]]The authors identify some optimality properties of a special type of tree queries, namel...
The 2-way semijoin is proposed as an important extended version of the semijoin, which adds a backwa...
A semijoin is a relational operator which reduces a relation by selecting a set of tuples that match...
The utilizing of semi-join is often a common starting point for join algorithms in distributed datab...