DEDUCTIVE DATABASES:

-
  • In a deductive database system we typically specify rules through a declarative language-A language in which we specify what to achieve rather than how to achieve
  • A model used for deductive databases is closely related to the relational data model.
  • A deductive database uses two main types of specifications namely facts and rules
    • Facts are specified in a manner similar to the way relations are specified except that it is not necessary to include attribute names
    • Rules are similar to relational views.They specify virtual relations that are not actually stored but that can be formed from the facts.
  • A Deductive database is a database system that can make deductions (i.e., conclude additional facts) based on rules and facts stored in the (deductive) database.
  • An inference engine within the system can deducenew facts from the database by interpreting theses rules
  • The deductive database works on the principle of logic and has  used prolog as a starting point
  • Deductive databases reuse a large number of concepts from logic programming; rules and facts specified in the deductive database language. However important differences between deductive databases and logic programming:
    • Order sensitivity and procedurality: In Prolog, program execution depends on the order of rules in the program and on the order of parts of rules; these properties are used by programmers to build efficient programs. In database languages (like SQL or Datalog), however, program execution is independent of the order of rules and facts.
    • Special predicates: In Prolog, programmers can directly influence the procedural evaluation of the program with special predicates such as the cut, this has no correspondence in deductive databases.
    • Function symbols: Logic Programming languages allow function symbols to build up complex symbols. This is not allowed in deductive databases.
    • Tuple-oriented processing: Deductive databases use set-oriented processing while logic programming languages concentrate on one tuple at a time.

Comments

Post a Comment

Popular posts from this blog

Pentium microprocessors

-
Image
A 32-bit microprocessor introduced by Intel in 1993. It contains 3.3 million transistors. Since 1993, Intel has developed the Pentium III and more recently the Pentium 4 microprocessors.   Pentium III Pentium III Mainboard Layout Intel builds on the technology it developed with the Pentium II microprocessors.  The Pentium III processor comes with a Synchronized Dynamic Random Access Memory (SDRAM), allowing for an extremely fast transfer of data between the microprocessor and the memory. 70 new instructions, called Streaming SIMD Extensions, enhance multimedia and 3D performance.  Launched February 1999 - Available in speed levels of 450, 500, 550, and 600MHz. 32KB of Level 1 Cache (operating at CPU's full core speed). 512KB of Level 2 Cache (operating at ½ of CPU's core speed). 100 MHz bus speed. The branch prediction/recovery pipeline was doubled to include 10-stages from the P-II.   Pentium IV The next generation of microprocessors from Intel. Pe
Read more

Design and Management of Computer Networks Running Notes

-
Architecture and Design Process Hierarchy and Inter-connectivity Network Supportability ------------------------------------------------------------------------------------------- Service Description pdf Service characteristics pdf Service Levels pdf System Components and network services pdf Service Requests and Requirements pdf Service Offerings pdf Service Matrices pdf Performance Characteristics pdf for running notes Download here ------------------------------------------------------------------------------------------- Types of user requirements pdf Timeliness Interactivity Reliability Presentation Quality Adaptability Security Affordability Functionality Supportability Future growth Requirement Analysis pdf The need for Requirement Analysis User Requirements pdf for running notes Download here -------------------------------------------------------------------------------------------  Applic
Read more

ONE DIMENSIONAL RANDOM VARIABLES: Handwritten notes

-
Properties of probability Distribution Function Expectation Value For the following problem by using Find the distribution function of x? What is the smallest value of x? for which probability P(X<=x)>0.5 for more click here ---------------------------------------------------------------------------------------------------------------- Continues Random Variable           We call the distribution function as probability density function f(x). Properties of probability density function.  click here ---------------------------------------------------------------------------------------------------------------- Moment Generating Function (MGF) Properties Additional property in MGF  for notes click here ---------------------------------------------------------------------------------------------------------------- Bernoulli Trial       For a single trail with only two possible results.  Example: Tossing a coin. p=1/2, q=1/2 p + q = 1 p = q
Read more