uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Evaluation of join strategies for distributed mediation
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
2001 In: Lecture Notes in Computer Science, Vol. 2151, 308-322 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2001. Vol. 2151, 308-322 p.
URN: urn:nbn:se:uu:diva-90968OAI: oai:DiVA.org:uu-90968DiVA: diva2:163512
Available from: 2003-10-17 Created: 2003-10-17Bibliographically approved
In thesis
1. Query Processing for Peer Mediator Databases
Open this publication in new window or tab >>Query Processing for Peer Mediator Databases
2003 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The ability to physically interconnect many distributed, autonomous and heterogeneous software systems on a large scale presents new opportunities for sharing and reuse of existing, and for the creataion of new information and new computational services. However, finding and combining information in many such systems is a challenge even for the most advanced computer users. To address this challenge, mediator systems logically integrate many sources to hide their heterogeneity and distribution and give the users the illusion of a single coherent system.

Many new areas, such as scientific collaboration, require cooperation between many autonomous groups willing to share their knowledge. These areas require that the data integration process can be distributed among many autonomous parties, so that large integration solutions can be constructed from smaller ones. For this we propose a decentralized mediation architecture, peer mediator systems (PMS), based on the peer-to-peer (P2P) paradigm. In a PMS, reuse of human effort is achieved through logical composability of the mediators in terms of other mediators and sources by defining mediator views in terms of views in other mediators and sources.

Our thesis is that logical composability in a P2P mediation architecture is an important requirement and that composable mediators can be implemented efficiently through query processing techniques.

In order to compute answers of queries in a PMS, logical mediator compositions must be translated to query execution plans, where mediators and sources cooperate to compute query answers. The focus of this dissertation is on query processing methods to realize composability in a PMS architecture in an efficient way that scales over the number of mediators.

Our contributions consist of an investigation of the interfaces and capabilities for peer mediators, and the design, implementation and experimental study of several query processing techniques that realize composability in an efficient and scalable way.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2003. 190 p.
Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1104-232X ; 901
data integration, mediators, query processing
National Category
Computer Science
urn:nbn:se:uu:diva-3687 (URN)91-554-5770-3 (ISBN)
Public defence
2003-11-11, Siegbahnsalen, Ångström, Uppsala, 13:00
Available from: 2003-10-17 Created: 2003-10-17 Last updated: 2011-02-17Bibliographically approved

Open Access in DiVA

No full text

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 58 hits
ReferencesLink to record
Permanent link

Direct link