Evaluating Queries in Deductive Databases by Generating
نویسنده
چکیده
A strong advantage of bottom up generating techniques is their ability to guarantee finiteness of all inferences in a deductive database system involving recursive axioms. But a "brute force" generating answers to a query would be very inefficient producing many facts useless for the query evaluation. An economy generating method is presented based on discovering explicit facts relevant to the query, and applying preselected axioms as generating rules. The method is proved to be complete in the sense that it generates all the existing answers to the query in a finite time.
منابع مشابه
Multiple Query Processing in Deductive Databases using Query Graphs
Research activity on query evaluation and optimization has been centered around processing one query at a time. Query processing systems. in general. attempt to minimize the cost of processing a set of queries by minimizing the processing cost of each query separately. A separate plan is generated and executed for each query. The cost of processing (that is the CPU cost + Input/Oulput cost) a s...
متن کاملGeneralized Query Answering in Disjunctive Deductive Databases: Procedural and Non-Monotonic Aspects
Generalized queries are deened as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of Disjunctive Deductive Databases (DDDBs). Our...
متن کاملA Formal Approach for Horizontal Fragmentation of Disjunctive Deductive Databases
Disjunctive deductive databases (DDDBs) can capture indeenite information, i.e., imprecise or partial knowledge, and are more general than deenite deductive databases. Formal approaches for horizontally fragmenting a DDDB, however, are lacking. Fragmenting a DDDB facilitates the splitting of queries of the database into subqueries to enhance query processing since the answers to each subquery a...
متن کاملDeductive Databases with Incomplete Information
We consider query processing in deductive databases with incomplete information in the form of null values. We motivate the problem of extracting the maximal information from a (deductive) database in response to queries, and formalize this in the form of conditional answers. We give a sound and complete top-down proof procedure for generating conditional answers. We also extend the well-known ...
متن کاملCounting solutions to the View Maintenance Problem
We present an incremental evaluation algorithm for materialized views in relational and deductive database systems. The algorithm computes, in an incremental fashion, the changes to the materialized view in response to changes (insertions, deletions, and updates) to the base relations. The view may be deened in SQL or in Datalog, and may use UNION , negation, aggregation (e.g. SUM, MIN), linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985