Describe deductive databases and relational databases, Database Management System

Assignment Help:

Problem :

(b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and data manipulation.

(i) Explain the relationships and the differences between a deductive databases and relational databases.
(ii) In the context of deductive databases, explain the following concepts:

♦ Intentional database.
♦ Extensional database.
♦ Recursive query.

Related Discussions:- Describe deductive databases and relational databases

Describe parameteric end users, Describe Parameteric end users? Paramet...

Describe Parameteric end users? Parametric end users might be given update access, but are commonly not permitted to change the structure of data.

Oracle fusion middleware, Oracle Fusion Middleware: Key Skills: Consul...

Oracle Fusion Middleware: Key Skills: Consulting,Architect, Oracle Fusion Middleware,ECM, UCM, Stellent,Identity Management, SOA Suites, BPEL, ESB,OAM,OIM,J2ee, Java, Livelink

Decomposition.., explain concept of decomposition?

explain concept of decomposition?

Illustrate about the advanced object design, Illustrate about the advanced ...

Illustrate about the advanced object design Advanced object design is a complex task. The objects discovered through analysis serve as a skeleton of design. The operations reco

Define the canonical cover, Define the Canonical cover Ans: A canonical...

Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen

Draw an e-r diagram and convert it to a relational schema, In an organizati...

In an organization several projects are undertaken. Each project can employ one or more employees. Each employee can work on one or more projects. Each project is undertaken on the

Prove that a relation which is 4nf must be bcnf, Prove that a relation whic...

Prove that a relation which is 4NF must be BCNF. Ans Let R be in 4NF. Suppose it is not in BCNF. Hence, there exists an FD X→Y in R such that x is not a super key. Although

Compare the two log based recovery schemes, Compare the two log-based recov...

Compare the two log-based recovery schemes in terms of ease of implementation and overhead cost. Ans: There are two types of log based recovery techniques: deferred update

Define page, Define page. The database is partitioned into some number ...

Define page. The database is partitioned into some number of fixed-length blocks, which are referred to as pages.

Distributed database, distributed quey processing

distributed quey processing

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages