Top-Down Query Processing in First-Order Deductive Databases under the DWFS

2004 ◽  
Vol 32 (2) ◽  
pp. 167-184
Author(s):  
C. A. Johnson
Keyword(s):  
Query Processing ◽  
Deductive Databases ◽  
Top Down ◽  
First Order

Top-Down XML Keyword Query Processing

2016 ◽  
Vol 28 (5) ◽  
pp. 1340-1353 ◽  
Author(s):  
Junfeng Zhou ◽  
Wei Wang ◽  
Ziyang Chen ◽  
Jeffrey Xu Yu ◽  
Xian Tang ◽  
...  
Keyword(s):  
Query Processing ◽  
Top Down ◽  
Keyword Query ◽  
Xml Keyword Query

QUERY EVALUATION IN PARTITIONED DISJUNCTIVE DEDUCTIVE DATABASES

1994 ◽  
Vol 03 (04) ◽  
pp. 385-413 ◽  
Author(s):  
ADNAN YAHYA ◽  
JACK MINKER
Keyword(s):  
Query Processing ◽  
Evaluation Process ◽  
Deductive Databases ◽  
Deductive Database ◽  
Query Evaluation ◽  
Disjunctive Deductive Databases ◽  
Special Cases ◽  
The Individual

Query evaluation in disjunctive deductive databases is in general computationally hard. The class of databases for which the process is tractable is severely limited. The complexity of the process depends on the structure of the database as well as on the type of query being evaluated. In this paper we study the issue of simplified query processing in disjunctive deductive databases. We address the possibility of evaluating general queries by independently processing their atomic components and describe the class of databases for which this approach is possible. We also discuss the issue of dividing a disjunctive deductive database into a set of disjoint components then answering queries and computing database completions by combining the results obtained against the individual components. Some practical special cases are considered. The methods developed in this paper can be utilized to introduce parallelism into the query evaluation process.

Fast query processing in deductive databases

IEEE Software ◽  
1993 ◽  
Vol 10 (6) ◽  
pp. 66-74
Author(s):  
D.L. Lee ◽  
Y.Y. Leung
Keyword(s):  
Query Processing ◽  
Deductive Databases

scholarly journals Top-down induction of first-order logical decision trees

1998 ◽  
Vol 101 (1-2) ◽  
pp. 285-297 ◽  
Author(s):  
Hendrik Blockeel ◽  
Luc De Raedt
Keyword(s):  
Decision Trees ◽  
Top Down ◽  
First Order

scholarly journals Proving Semantic Properties as First-Order Satisfiability (Extended Abstract)

2020 ◽  
Author(s):  
Salvador Lucas
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Answer Set Programming ◽  
Deductive Databases ◽  
Query Answering ◽  
Logical Theory ◽  
Data Bases ◽  
First Order ◽  
Computational Systems ◽  
Semantic Properties

The semantics of computational systems (e.g., relational and knowledge data bases, query-answering systems, programming languages, etc.) can often be expressed as (the specification of) a logical theory Th. Queries, goals, and claims about the behavior or features of the system can be expressed as formulas φ which should be checked with respect to the intended model of Th, which is often huge or even incomputable. In this paper we show how to prove such semantic properties φ of Th by just finding a model A of Th∪{φ}∪Zφ, where Zφ is an appropriate (possibly empty) theory depending on φ only. Applications to relational and deductive databases, rewriting-based systems, logic programming, and answer set programming are discussed.

Sign in / Sign up

Export Citation Format

Share Document