Using Semi-Joins to Solve Relational Queries
From MaRDI portal
Publication:3902554
DOI10.1145/322234.322238zbMath0454.68126OpenAlexW2153485419MaRDI QIDQ3902554
Philip A. Bernstein, Dah-Ming Chiu
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322234.322238
Searching and sorting (68P10) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)
Related Items (30)
An algorithm for handling many relational calculus queries efficiently. ⋮ Optimal distributed execution of join queries ⋮ Incorporating processor costs in optimizing the distributed execution of join queries ⋮ Partition search for non-binary constraint satisfaction ⋮ Executing join queries in an uncertain distributed environment ⋮ Allocating relations in a distributed database system ⋮ Minimizing the response time of executing a join between fragmented relations in a distributed database system ⋮ On the expressive power of semijoin queries ⋮ The propagation of updates to relational tables in a distributed database system ⋮ On the complexity of division and set joins in the relational algebra ⋮ A distributed join algorithm ⋮ A knowledge-based system for performance optimization of a relational database system ⋮ Optimising the distributed execution of join queries in polynomial time ⋮ Evaluating multiple join queries in a distributed database system ⋮ Properties of semijoin sequences ⋮ A characterization of finite fd-acyclicity ⋮ Composite semijoins in distributed query processing ⋮ On the reusability of query optimization algorithms ⋮ Strategies for distributed query optimization ⋮ Domain-specific semijoin: A new operation for distributed query processing ⋮ Magic semi-joins ⋮ A constrained nonlinear 0-1 program for data allocation ⋮ NP-complete problems simplified on tree schemas ⋮ Interval graphs and related topics ⋮ Asserting the optimality of serial SJRPs in processing simple queries in chain networks ⋮ The tree projection theorem and relational query processing ⋮ GYO reductions, canonical connections, tree and cyclic schemas, and tree projections ⋮ Optimization of distributed tree queries ⋮ Optimizing multiset relational algebra queries using weak-equivalent rewrite rules ⋮ Database placement in communication networks for minimizing the overall transmission cost
This page was built for publication: Using Semi-Joins to Solve Relational Queries
