Abstract
Current database research is concerned with the design of some algorithms to optimize the queries, during query processing. Query trading is one of these algorithms, which is best fit for distributed networks of autonomous database systems. In such systems each node is completely autonomous and offers services to its peers through external communication. Besides, they exhibit characteristics, such as a predominance of temporary and dynamic relations that present problems for conventional query optimizers. In particular, the proposed query trading algorithm can only support node autonomy and need less knowledge about such nodes for execution, but is unable to handle temporary and dynamic relations. In this paper, we apply some changes to Query Trading algorithm. In this case it can accommodate these characteristics. In addition to the modifications to algorithm, we insert an extra phase "re-optimization" to the execution of the query to adapt query plans to runtime changes in the database.
| Original language | English |
|---|---|
| Title of host publication | MIPRO 2008 - 31st International Convention Proceedings: Computers in Technical Systems and Intelligent Systems |
| Pages | 17-22 |
| Number of pages | 6 |
| Volume | 3 |
| Publication status | Published - 2008 |
| Externally published | Yes |
| Event | 31st International Convention Proceedings: Computers in Technical Systems and Intelligent Systems - Opatija, Croatia Duration: 26 May 2008 → 30 May 2008 |
Conference
| Conference | 31st International Convention Proceedings: Computers in Technical Systems and Intelligent Systems |
|---|---|
| Country | Croatia |
| City | Opatija |
| Period | 26/05/08 → 30/05/08 |
Keywords
- Adaptive Optimization Techniques
- Autonomous Database Systems
- Query Optimization
- Query Plan
- Query Trading Algorithm