Query Answering in LAV with Constraints Under Exact View Assumption

Общая информация

 Аннотация

    The problem of query answering under exact views is considered. Our approach is based on Data Exchange settings: we describe an algorithm to create an incomplete table (in "c-tables" formalism by Imielnski) which describes all legal global databases. It is demonstrated that under EVA algebraic properties of a set of legal tables are signifantly different from algebraic properties of universal solution under SVA (what correlates with computational complexity and monotonicity results for query answering). By reduction of a query answering problem to constraint satisfaction problem (defined as a homomorphism problem) a few cases of tractable query answering are found.

 Ключевые слова

    query answering, exact views, closed world, universal solution, data exchange, NP-hard, constraint satifaction problem
 

Home page
Наш адрес:
119991 ГСП-1 Москва В-71, Ленинский просп., 14
Телефон: 938-0309 (Справ. бюро)
Факс: (495)954-3320 (Лен.пр.,14), (495)938-1844 (Лен.пр.,32а)
Назад