A SAT approach to query optimization in mediator systems

DOI10.1007/s10472-005-0429-1zbMath1099.68103OpenAlexW4254447701MaRDI QIDQ1777403

Stéphane Bressan, Steven Prestwich

Publication date: 13 May 2005

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-0429-1

zbMATH Keywords

symmetrysearchquery optimizationmediator systems

Mathematics Subject Classification ID

Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A SAT approach to query optimization in mediator systems ⋮ Boolean models and planning methods for parallel abstract programs

Uses Software

• UnitWalk
• PBS
• Chaff
• BerkMin
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Fast planning through planning graph analysis
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• A SAT approach to query optimization in mediator systems
• Solving satisfiability problems using elliptic approximations -- effective branching rules
• Negative effects of modeling techniques on search performance
• BerkMin: A fast and robust SAT-solver
• A Heuristic Method for the Set Covering Problem

This page was built for publication: A SAT approach to query optimization in mediator systems