Tim@CIS.UPENN.EDU (Tim Finin) (10/05/86)
3:00pm, Tuesday, October 7, 1986
23 Moore School, University of Pennsylvania
EFFICIENT DEDUCTIVE DATABASES
WILL THEY EVER BE CONSTRUCTED?
Tomasz Imielinski
Rutgers University
The area of deductive databases is a rapidly growing field concerned with
enhancing traditional relational databases with automated deduction
capabilities. Because of the large amounts of data involved here the
complexity issues become critical. We present a number of results related to
the complexity of query processing in the deductive databases, both with
complete and incomplete information.
In an attempt to answer the question of whether efficient deductive databases
will ever be constructed we demonstrate an idea of the "deductive database of
the future". In such a system the concept of an answer to a query is tailored
to the various limitations of computational resources.