Best effort query answering for mediators with union views
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 relat...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Wichita State University
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10057/5032 |