Distributed databases principles and systems
Distributed databases principles and systems
Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Information Systems
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
A methodology for interpreting tree queries into optimal semi-join expressions
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Adaptive Techniques for Distributed Query Optimization
Proceedings of the Second International Conference on Data Engineering
Optimizing Star Queries in a Distributed Database System
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
R* Optimizer Validation and Performance Evaluation for Distributed Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Heuristic Approach to Distributed Query Processing
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Benchmarking Database Systems A Systematic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
The optimization of query processing on distributed database systems
The optimization of query processing on distributed database systems
On query-processing in distributed database systems
On query-processing in distributed database systems
An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
On optimal processor allocation to support pipelined hash joins
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On parallel execution of multiple pipelined hash joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
PERF join: an alternative to two-way semijoin and bloomjoin
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Adaptive Algorithms for Join Processing in Distributed Database Systems
Distributed and Parallel Databases
Parallel Execution of Hash Joins in Parallel Databases
IEEE Transactions on Parallel and Distributed Systems
Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins
IEEE Transactions on Computers
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
IEEE Transactions on Knowledge and Data Engineering
On applying hash filters to improving the execution of multi-join queries
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed multi-join query processing in data grids
Information Sciences: an International Journal
Distributed stream join query processing with semijoins
Distributed and Parallel Databases
Sharing work in keyword search over databases
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Join algorithm using multiple replicas in data grid
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Multiple join processing in data grid
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
| Hi-index | 0.00 |
The semijoin has been used as an effective operator in reducing data transmission and processing over a network that allows forward size reduction of relations and intermediate results generated during the processing of a distributed query. The authors propose a relational operator, two-way semijoin, which enhanced the semijoin with backward size reduction capability for more cost-effective query processing. A pipeline N-way join algorithm for joining the reduced relations residing on N sites is introduced. The main advantage of this algorithm is that it eliminates the need for transferring and storing intermediate results among the sites. A set of experiments showing that the proposed algorithm outperforms all known conventional join algorithms that generate intermediate results is included.