Affiliation:
1. Hebrew Univ., Jerusalem, Israel
Abstract
A simple characterization of independent database schemes is proved. An algorithm is given for translating a tableau
T
, posed as a query on a representative instance, to a union of tableaux that is equivalent to
T
, but can be applied directly to database relations. The algorithm may take exponential time (in the size of
T
and the database scheme), and it is applicable only to independent database schemes. If
T
is a just a projection of a representative instance, then the algorithm has a simpler form (which is still exponential in the worst case) and is polynomial in some cases.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献