A state transition model for distributed query processing
DOI10.1145/6314.6460zbMATH Open0635.68120OpenAlexW1993291251MaRDI QIDQ3775007FDOQ3775007
Authors: Stéphane Lafortune, Eugene Wong
Publication date: 1986
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/6314.6460
Recommendations
- Optimizing Chain Queries in a Distributed Database System
- Allocating relations in a distributed database system
- scientific article; zbMATH DE number 3930378
- Stochastic query optimization in distributed databases using semijoins
- Stochastic optimization for join of three relations in distributed databases. II: Generalization and more applications
dynamic programmingquery processingquery optimizationdistributed database systemtree queriessemijoinstate transition model
Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimizing Chain Queries in a Distributed Database System
- Title not available (Why is that?)
- An iterative method for distributed database optimization
- Title not available (Why is that?)
- Composite semijoins in distributed query processing
- Distributed query processing and optimization techniques for a hierarchically structured computer network
- On the reusability of query optimization algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A state transition model for distributed query processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775007)