Deductive database: Difference between revisions
Content deleted Content added
m linking |
No edit summary |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Line 1: | Line 1: | ||
{{Short description|Database system}} |
|||
A '''deductive database''' is a [[database system]] that can make [[Deductive reasoning|deductions]] (i.e. conclude additional facts) based on [[wiktionary:rule|rules]] and [[fact]]s stored in |
A '''deductive database''' is a [[database system]] that can make [[Deductive reasoning|deductions]] (i.e. conclude additional facts) based on [[wiktionary:rule|rules]] and [[fact]]s stored in its database. [[Datalog]] is the language typically used to specify facts, rules and queries in deductive databases. Deductive databases have grown out of the desire to combine [[logic programming]] with [[relational database]]s to construct systems that support a powerful formalism and are still fast and able to deal with very large datasets. Deductive databases are more expressive than relational databases but less [[expressive power (computer science)|expressive]] than logic programming systems such as [[Prolog]]. |
||
In recent years, deductive databases |
In recent years, deductive databases have found new application in [[data integration]], [[information extraction]], networking, [[program analysis]], security, and [[cloud computing]].<ref>[http://www.cs.ucdavis.edu/~green/papers/sigmod906t-huang.pdf Datalog and Emerging applications]</ref> |
||
Deductive databases reuse many concepts from logic programming; rules and facts specified in |
Deductive databases reuse many concepts from logic programming; rules and facts specified in Datalog look very similar to those written in Prolog, but there are some important differences: |
||
* 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. |
* 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 (logic programming)|cut]] |
* Special predicates: In Prolog, programmers can directly influence the procedural evaluation of the program with special predicates such as the [[Cut (logic programming)|cut]]. This has no correspondence in deductive databases. |
||
* Function symbols: Logic |
* Function symbols: Logic programming languages allow [[Functional predicate|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. |
* [[Tuple]]-oriented processing: Deductive databases use set-oriented processing while logic programming languages concentrate on one tuple at a time. |
||
==References== |
==References== |
||
{{ |
{{Reflist}} |
||
{{ |
{{More citations needed|date=January 2009}} |
||
== Further reading == |
== Further reading == |
||
| Line 19: | Line 20: | ||
{{Database models}} |
{{Database models}} |
||
{{Authority control}} |
|||
[[Category:Database management systems]] |
[[Category:Database management systems]] |
||
{{database-stub}} |
{{database-stub}} |
||
Latest revision as of 12:47, 10 October 2023
A deductive database is a database system that can make deductions (i.e. conclude additional facts) based on rules and facts stored in its database. Datalog is the language typically used to specify facts, rules and queries in deductive databases. Deductive databases have grown out of the desire to combine logic programming with relational databases to construct systems that support a powerful formalism and are still fast and able to deal with very large datasets. Deductive databases are more expressive than relational databases but less expressive than logic programming systems such as Prolog. In recent years, deductive databases have found new application in data integration, information extraction, networking, program analysis, security, and cloud computing.[1]
Deductive databases reuse many concepts from logic programming; rules and facts specified in Datalog look very similar to those written in Prolog, but there are some important differences:
- 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.
References
[edit] | This article needs additional citations for verification. (January 2009) |
Further reading
[edit]- Author: Herve Gallaire, Jack Minker, Jean-Marie Nicolas: Logic and Databases: A Deductive Approach. Publisher: ACM. doi:10.1145/356924.356929
- Author: Stefano Ceri, Georg Gottlob, Letizia Tanca: Logic Programming and Databases. Publisher: Springer-Verlag. ISBN 978-0-387-51728-5
- Author: Ramez Elmasri and Shamkant Navathe: Fundamentals of Database Systems (3rd edition). Publisher: Addison-Wesley Longman. ISBN 0-201-54263-3
 | This database-related article is a stub. You can help Wikipedia by expanding it. |