LATIN 2004: Theoretical Informatics

DOI10.1007/B95852MaRDI QIDQ5901621zbMATH OpenOpenAlexFDO

Authors Sany Laber, Yoshiharu Kohayakawa, Renato Carmo

Publication date 7 May 2009

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

Full work available at URL https://doi.org/10.1007/b95852

Mathematics Subject Classification ID

Database theory (68P15) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Querying priced information in databases, the conjunctive case
• Randomized approximation algorithms for query optimization problems on two processors
• Algorithms – ESA 2005
• Efficient Approximations of Conjunctive Queries
• Query strategies for priced information (extended abstract)

Cited in

(6)

• Querying priced information in databases, the conjunctive case
• Randomized approximation algorithms for query optimization problems on two processors
• Algorithms for distributional and adversarial pipelined filter ordering problems
• Algorithms and Computation
• Query strategies for priced information
• A randomized competitive algorithm for evaluating priced AND/OR trees

This page was built for publication: LATIN 2004: Theoretical Informatics

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