deductive database
Recently Published Documents


TOTAL DOCUMENTS

165
(FIVE YEARS 2)

H-INDEX

15
(FIVE YEARS 0)

Author(s):  
D. Sahithi ◽  
Dr. J. Keziya Rani

In distributed database management systems, fragmenting base connections increases concurrency and hence system throughput for query processing. User queries use hybrid fragmentation methods focused on vector bindings, and deductive database implementations lack query-access-rule dependence. As a result, for hierarchical deductive information implementations, a hybrid fragmentation solution is used. The method considers the horizontal partition of base relations based on the bindings placed on user requests, then produces vertical fragments of the horizontally partitioned relations, and finally clusters rules based on attribute affinity and query and rule access frequency. The suggested fragmentation approach makes distributed deductive database structures easier to develop.


2018 ◽  
Vol 26 (5) ◽  
pp. 2634-2648 ◽  
Author(s):  
Pascual Julian-Iranzo ◽  
Fernando Saenz-Perez

2018 ◽  
Vol 18 (5-6) ◽  
pp. 806-845 ◽  
Author(s):  
TYSON CONDIE ◽  
ARIYAM DAS ◽  
MATTEO INTERLANDI ◽  
ALEXANDER SHKAPSKY ◽  
MOHAN YANG ◽  
...  

AbstractBigDatalog is an extension of Datalog that achieves performance and scalability on both Apache Spark and multicore systems to the point that its graph analytics outperform those written in GraphX. Looking back, we see how this realizes the ambitious goal pursued by deductive database researchers beginning 40 years ago: this is the goal of combining the rigor and power of logic in expressing queries and reasoning with the performance and scalability by which relational databases managed BigData. This goal led to Datalog which is based on Horn Clauses like Prolog but employs implementation techniques, such as semi-naïve fixpoint and magic sets, that extend the bottom-up computation model of relational systems, and thus obtain the performance and scalability that relational systems had achieved, as far back as the 80s, using data-parallelization on shared-nothing architectures. But this goal proved difficult to achieve because of major issues at (i) the language level and (ii) at the system level. The paper describes how (i) was addressed by simple rules under which the fixpoint semantics extends to programs using count, sum and extrema in recursion, and (ii) was tamed by parallel compilation techniques that achieve scalability on multicore systems and Apache Spark. This paper is under consideration for acceptance in Theory and Practice of Logic Programming.


Author(s):  
Loris Bozzato ◽  
Thomas Eiter ◽  
Luciano Serafini

The Contextualized Knowledge Repository (CKR) framework was conceived as a logic-based approach for representing context dependent knowledge, which is a well-known area of study in AI. The framework has a two-layer structure with a global context that contains context-independent knowledge and meta-information about the contexts, and a set of local contexts with specific knowledge bases. In many practical cases, it is desirable that inherited global knowledge can be "overridden" at the local level. In order to address this need, we present an extension of CKR with global defeasible axioms: these axioms locally apply to (tuples of) individuals unless an exception for overriding exists; such an exception, however, requires a justification that is provable from the knowledge base. We formalize this intuition and study its semantic and computational properties. Furthermore, we present a translation of extended CKRs to datalog programs under the answer set (i.e., stable) semantics and we present an implementation prototype. Our work adds to the body of results on using deductive database technology in these areas, and provides an expressive formalism for exception handling by overriding.


2018 ◽  
Vol 7 (1) ◽  
pp. 49
Author(s):  
Radu BUCEA-MANEA-TONIS

The globalization is associated with an increased data to be processed from E-commerce transactions. The specialists are looking for different solutions, such as BigData, Hadoop, Datawarehoues, but it seems that the future is the predicative logic implemented through deductive database technology. It has to be done the swift from imperative languages, to not declaratively languages used for the application development. The deductive databases are very useful in the student teaching programs, too. Thus, the article makes a consistent literature review in the field and shows practical examples of using predicative logic in deductive systems, in order to integrate different kind of data types.    


2018 ◽  
Vol 210 ◽  
pp. 04053
Author(s):  
Mikhail M. Kucherov ◽  
Nina A. Bogulskaya

Designing security, from the hardware level, is essential to ensure the integrity of the intelligent cyber-physical infrastructure that is the Industrial Internet of Things (IIoT). If intelligent cyber-physical infrastructure fails to do the right things because it is insecure and vulnerable, then there will be negative social consequences [1]. Security is, in a sense, the access control to IIoT systems, which increasingly relies on the ability to compose different policies. Therefore, the advantage in any framework for compiling policies is that it is intuitive, formal, expressive, application-independent, as well as expandable to create domain-specific instances. Recently, such a scheme was proposed based on Belnap logic FOUR2 [2]. Four values of the Belnap bilattice have been interpreted as grant, deny, conflict, or unspecified with respect to access-control policy. Belnap’s four-valued logic has found a variety of applications in various fields, such as deductive database theory, distributed logic programming, and other areas. However, it turns out that the truth order in FOUR2 is a truth-and-falsity order at the same time [3]. The smallest lattice, where the orders of truth and falsity are independent of each other, which is especially important for security policy, is that of Shramko-Wansing’s SIXTEEN3. This generalization is well-motivated and leads from the bilattice FOUR2 with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN3 with an information ordering together with a truth ordering and a (distinct) falsity ordering.Based onSIXTEEN3 and new Boolean predicates to control access [4], we define an expressive access-control policy language, having composition statements based on the statements of Schramko-Wansing’s logic. Natural orderings on politics are obtained by independent lifting the orders of truth and falsity of trilattice, which results in a query language in which conflict freedom analysis can be developed. The reduction of formal verification of queries to that on predicates over access requests enables to carry out policy analysis. We evaluate our approach through examples of control access model policy.


2014 ◽  
Vol 6 (6) ◽  
pp. 500-503
Author(s):  
Keerachart Suksut ◽  
Pasapitch Chujai ◽  
Nittaya Kerdprasop ◽  
Kittisak Kerdprasop

Sign in / Sign up

Export Citation Format

Share Document