Return to search

A logic-based approach for computing service executions plans in peer-to-peer networks

Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Digital Libraries. For a given task, the system has to determine suitable services and their processing order (execution plan). As peers can join or leave the network spontaneously, static execution plans are not sufficient. This paper proposes a logic-based approach for dynamically computing execution plans: Services are described in the DAML-S language. These descriptions are mapped onto Datalog. Finally, logical rules are applied on the service description facts for determining matching services and finding an optimum execution plan.

Identiferoai:union.ndltd.org:DUETT/oai:DUETT:duett-06222004-122500
Date22 June 2004
CreatorsNottelmann, Henrik ; Fuhr, Norbert
Contributorsnone
PublisherGerhard-Mercator-Universitaet Duisburg
Source SetsDissertations and other Documents of the Gerhard-Mercator-University Duisburg
LanguageGerman
Detected LanguageEnglish
Typetext
Formatapplication/octet-stream, application/pdf
Sourcehttp://www.ub.uni-duisburg.de/ETD-db/theses/available/duett-06222004-122500/
Rightsunrestricted, I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. Hiermit erteile ich der Universitaet Duisburg das nicht-ausschliessliche Recht unter den unten angegebenen Bedingungen, meine Dissertation, Staatsexamens- oder Diplomarbeit, meinen Forschungs- oder Projektbericht zu veroeffentlichen und zu archivieren. Ich behalte das Urheberrecht und das Recht das Dokument zu veroeffentlichen und in anderen Arbeiten weiterzuverwenden.

Page generated in 0.0015 seconds