Best effort query answering for mediators with union views

SOAR Repository

Show simple item record

dc.contributor.advisor Ramanan, Prakash
dc.contributor.author Papri, Rowshon Jahan
dc.date.accessioned 2012-04-02T19:05:10Z
dc.date.available 2012-04-02T19:05:10Z
dc.date.copyright 2011 en
dc.date.issued 2011-07
dc.identifier.other t11078
dc.identifier.uri http://hdl.handle.net/10057/5032
dc.description Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science. en_US
dc.description.abstract Consider an SQL query that involves joins of several relations, optionally followed by selections and/or projections. It can be represented by a conjunctive datalog query Q without negation or arithmetic subgoals. We consider the problem of answering such a query Q using a mediator M. For each relation R that corresponds to a subgoal in Q, M contains several sources; each source for R provides some of the tuples in R. The capability of each source are described in terms of templates. It might not be possible to get all the tuples in the result, Result(Q), using M, due to restrictions imposed by the templates. We consider best-effort query answering: Find as many tuples in Result(Q) as possible. We present an algorithm to determine if Q can be so answered using M. en_US
dc.format.extent xii, 46 p. en
dc.language.iso en_US en_US
dc.publisher Wichita State University en_US
dc.rights © Copyright 2011 by Rowshon Jahan Papri. All rights reserved en
dc.subject Union of views en_US
dc.subject Information integration en_US
dc.subject Data integration en_US
dc.subject Mediator en_US
dc.subject Capability based query answering en_US
dc.subject.lcsh Electronic dissertations en
dc.title Best effort query answering for mediators with union views en_US
dc.type Thesis en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search SOAR

Advanced Search


My Account