Randomized approximation algorithms for query optimization problems on two processors

DOI10.1007/3-540-45749-6_57MaRDI QIDQ4411398zbMATH OpenFDO

Authors Ojas Parekh, R. Ravi, Eduardo S. Laber

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610649.htm

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• LATIN 2004: Theoretical Informatics
• Querying priced information in databases, the conjunctive case
• Stochastic query optimization in distributed databases using semijoins
• Stochastic optimization for join of three relations in distributed databases. II: Generalization and more applications
• Stochastic optimization for join of three relations in distributed databases. I: The theory and one application

Cited in

(6)

• Querying priced information in databases, the conjunctive case
• Algorithms for distributional and adversarial pipelined filter ordering problems
• Algorithms for the database layout problem
• The 1-Versus-2 Queries Problem Revisited
• LATIN 2004: Theoretical Informatics
• A randomized competitive algorithm for evaluating priced AND/OR trees

This page was built for publication: Randomized approximation algorithms for query optimization problems on two processors

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