Efficiently Updating Cost Repository Values for Query Optimization on Web Data Sources in a Mediator/Wrapper Environment

Abstract

Abstract. Optimizing accesses to sources in a mediator/wrapper environment is a critical need. Due to a variety of reasons, relational-based optimization techniques are of no use when having to handle HTTP-based web sources, so new approaches which take into account client/server communication costs must be devised. This paper describes a cost model that stores values from a complete set of web source-focused parameters obtained by the web wrappers, by using a novel updating technique that handles the values measured by the wrappers in previous query executions, and generates a new model instance in each new iteration with an efficient processing cost. This instance allows rapid value updates caused by changes of the server quality or bandwidth, so typical in this context. The results of these techniques are demonstrated both theoretically and by means of an implementation showing how performance improves in real-world web sources when compared to classical approaches.

A Component-Based Approach for Engineering Enterprise Mashups

“…1. To compute query plans having query capabilities into account and to choose the most optimal plan, we leverage on the techniques proposed in [17] and [7], respectively. Query capabilities of the sources are discovered at run-time using their WADL descriptions.…”

“…The data mashup component generates the WHERE clause automatically at run-time when it is accessed by the GET method, adding a condition for each parameter received in the request. Next, the data mashup component computes all possible execution plans and chooses the best one [7].…”