翻訳と辞書
Words near each other
・ Datafork TrueType
・ Dataganj
・ Datagram
・ Datagram Congestion Control Protocol
・ Datagram Delivery Protocol
・ Datagram socket
・ Datagram Transport Layer Security
・ DataHand
・ Dataindustrier AB
・ Datakit
・ Datakortet
・ Datalantic
・ Datalight
・ DataLink University College
・ DATAllegro
Datalog
・ Datalogics
・ Datalogix
・ Datalore
・ DataLounge
・ Datam Polystar
・ DataMapper
・ DataMarket
・ Datamatics Global Services
・ Datamation
・ Datamax UV-1
・ Datameer
・ DataMelt
・ Datames
・ DataMirror


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Datalog : ウィキペディア英語版
Datalog
Datalog is a truly declarative logic programming language that syntactically is a subset of Prolog. It is often used as a query language for deductive databases. In recent years, Datalog has found new application in data integration, information extraction, networking, program analysis, security, and cloud computing.〔.〕
Its origins date back to the beginning of logic programming, but it became prominent as a separate area around 1977 when Hervé Gallaire and Jack Minker organized a workshop on logic and databases.〔.〕 David Maier is credited with coining the term Datalog.〔.〕
== Features, limitations and extensions ==

Unlike in Prolog, statements of a Datalog program can be stated in any order. Furthermore, Datalog queries on finite sets are guaranteed to terminate, so Datalog does not have Prolog's cut operator. This makes Datalog a truly declarative language.
In contrast to Prolog, Datalog
#disallows complex terms as arguments of predicates, e.g., p (1, 2) is admissible but not p (f (1), 2),
#imposes certain stratification restrictions on the use of negation and recursion,
#requires that every variable that appears in the head of a clause also appears in a nonarithmetic positive (i.e. not negated) literal in the body of the clause,
#requires that every variable appearing in a negative literal in the body of a clause also appears in some positive literal in the body of the clause〔(Datalog )〕
Query evaluation with Datalog is based on first order logic, and is thus sound and complete. However, Datalog is not Turing complete, and is thus used as a domain-specific language that can take advantage of efficient algorithms developed for query resolution. Indeed, various methods have been proposed to efficiently perform queries, e.g., the Magic Sets algorithm, tabled logic programming or SLG resolution.
Some widely used database systems include ideas and algorithms developed for Datalog. For example, the SQL:1999 standard includes recursive queries, and the Magic Sets algorithm (initially developed for the faster evaluation of Datalog queries) is implemented in IBM's DB2. Moreover, Datalog engines are behind specialised database systems such as Intellidimension's database for the semantic web.
Several extensions have been made to Datalog, e.g., to support aggregate functions, to allow object-oriented programming, or to allow disjunctions as heads of clauses. These extensions have significant impacts on the definition of Datalog's semantics and on the implementation of a corresponding Datalog interpreter.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Datalog」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.