Distributed databases principles and systems
Distributed databases principles and systems
Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Optimization of distributed tree queries
Journal of Computer and System Sciences
ACM Computing Surveys (CSUR)
Optimization of join operations in horizontally partitioned database systems
ACM Transactions on Database Systems (TODS)
A state transition model for distributed query processing
ACM Transactions on Database Systems (TODS)
Artificial intelligence (2nd ed.)
Artificial intelligence (2nd ed.)
Principles of artificial intelligence
Principles of artificial intelligence
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Query optimization in star computer networks
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
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
Optimal semijoin schedules for query processing in local distributed database systems
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Query Processing in Database Systems
Query Processing in Database Systems
Optimizing Star Queries in a Distributed Database System
VLDB '84 Proceedings of the 10th 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
The optimization of query processing on distributed database systems
The optimization of query processing on distributed database systems
Distributed query processing with load balancing in local area networks
Distributed query processing with load balancing in local area networks
Join processing in relational databases
ACM Computing Surveys (CSUR)
Using join operations as reducers in distributed query processing
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Distributed Query Optimization
IEEE Transactions on Knowledge and Data Engineering
Interleaving a Join Sequence with Semijoins in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
Evaluating Recursive Queries in Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Combining Joint and Semi-Join Operations for Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Keyword search in databases: the power of RDBMS
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Information Sciences: an International Journal
Tree balance and node allocation
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
| Hi-index | 0.00 |
The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently: on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost mode considered, and ability to handle tree queries with arbitrary target lists.