Using Semi-Joins to Solve Relational Queries

DOI10.1145/322234.322238MaRDI QIDQ3902554zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

relational databasesearching

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Cited in

(32)

• 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
• Properties of semijoin sequences
• A characterization of finite fd-acyclicity
• A constrained nonlinear 0-1 program for data allocation
• Database placement in communication networks for minimizing the overall transmission cost
• Optimal distributed execution of join queries
• Incorporating processor costs in optimizing the distributed execution of join queries
• Minimizing the response time of executing a join between fragmented relations in a distributed database system
• Evaluating multiple join queries in a distributed database system
• Magic semi-joins
• An algorithm for handling many relational calculus queries efficiently.
• Executing join queries in an uncertain distributed environment
• Allocating relations in a distributed database system
• The propagation of updates to relational tables in a distributed database system
• Optimising the distributed execution of join queries in polynomial time
• Optimizing multiset relational algebra queries using weak-equivalent rewrite rules
• Partition search for non-binary constraint satisfaction
• On the expressive power of semijoin queries
• Extensible query optimizers in practice
• Box covers and domain orderings for beyond worst-case join processing
• 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
• GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
• Optimization of distributed tree queries
• 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

This page was built for publication: Using Semi-Joins to Solve Relational Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902554)