Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1142/S021821579400020X | Int. J. Cooperative Inf. Syst. |
Keywords | Field | DocType |
partitioned disjunctive deductive databases,query evaluation | Query optimization,Data mining,Query language,Deductive database,Computer science,Sargable,View,Theoretical computer science,Query by Example,Spatial query,Database theory,Database | Journal |
Volume | Issue | ISSN |
3 | 4 | 0218-2157 |
Citations | PageRank | References |
3 | 0.47 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adnan Yahya | 1 | 68 | 4.77 |
| jack minker | 2 | 1889 | 771.22 |