Database Machines 1986
DOI: 10.1007/978-3-642-82937-6_7
|View full text |Cite
|
Sign up to set email alerts
|

Development of Delta as a First Step to a Knowledge Base Machine

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1987
1987
1989
1989

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…One of the issues involved in coupling a logic programming system and a database system is to resolve the mismatch between the tuple oriented access of the logic programming system and the set oriented retrieval of the database system. From the performance point of view, supporting partial match queries, join and other operations has been one of the major concerns in the back end (Gonzalez-Rubio et al, 1987;Sakai et al, 1986) since these operations are expected to occur more frequently than in conventional database systems. Consider, for example, the query <-p(a,X),q(c,b,c), and suppose that p and q are base relations (facts).…”
Section: A Basic Tasksmentioning
confidence: 99%
See 4 more Smart Citations
“…One of the issues involved in coupling a logic programming system and a database system is to resolve the mismatch between the tuple oriented access of the logic programming system and the set oriented retrieval of the database system. From the performance point of view, supporting partial match queries, join and other operations has been one of the major concerns in the back end (Gonzalez-Rubio et al, 1987;Sakai et al, 1986) since these operations are expected to occur more frequently than in conventional database systems. Consider, for example, the query <-p(a,X),q(c,b,c), and suppose that p and q are base relations (facts).…”
Section: A Basic Tasksmentioning
confidence: 99%
“…Recursively defined rules require a more complicated operation called the least fixed point (LFP) operation (Aho and Ullman, 1979;Sakai et al, 1986). When processing a query involves recursively defined subgoals, the query cannot be translated into an explicit sequence of relational operations as in the above example, since the termination point cannot be recognized in advance.…”
Section: A Basic Tasksmentioning
confidence: 99%
See 3 more Smart Citations