Show simple item record

dc.contributor.advisorRamanan, Prakash
dc.contributor.authorPapri, Rowshon Jahan
dc.descriptionThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.en_US
dc.description.abstractConsider 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.extentxii, 46 p.en
dc.publisherWichita State Universityen_US
dc.rights© Copyright 2011 by Rowshon Jahan Papri. All rights reserveden
dc.subjectUnion of viewsen_US
dc.subjectInformation integrationen_US
dc.subjectData integrationen_US
dc.subjectCapability based query answeringen_US
dc.subject.lcshElectronic dissertationsen
dc.titleBest effort query answering for mediators with union viewsen_US

Files in this item


This item appears in the following Collection(s)

  • CE Theses and Dissertations
    Doctoral and Master's theses authored by the College of Engineering graduate students
  • EECS Theses and Dissertations
    Collection of Master's theses and Ph.D. dissertations completed at the Dept. of Electrical Engineering and Computer Science
  • Master's Theses
    This collection includes Master's theses completed at the Wichita State University Graduate School (Fall 2005 --)

Show simple item record