603 Hits in 4.6 sec

On fast large-scale program analysis in Datalog

Bernhard Scholz, Herbert Jordan, Pavle Subotić, Till Westmann
2016 Proceedings of the 25th International Conference on Compiler Construction - CC 2016  
To achieve high-performance, we employ stagedcompilation techniques and specialize the underlying relational data structures for a given Datalog specification.  ...  The synthesis technique requires the re-interpretation of the semi-naïve evaluation as a scaffolding for translation using partial evaluation.  ...  To protect concurrent inserts for B-trees, several strategies are available. The simplest one is to protect concurrent insertion operations by locking the entire tree, thus sequentializing updates.  ... 
doi:10.1145/2892208.2892226 dblp:conf/cc/ScholzJSW16 fatcat:gr3nqkh7a5ennbgxrrpyncb74i

Scaling-up reasoning and advanced analytics on BigData

2018 Theory and Practice of Logic Programming  
This paper is under consideration for acceptance in Theory and Practice of Logic Programming.  ...  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  ...  Acknowledgements We would like to thank the reviewers for the comments and suggested improvements.  ... 
doi:10.1017/s1471068418000418 fatcat:xvfcjy4fi5ctvpesstdhqrhsvq

Optimizing Parallel Recursive Datalog Evaluation on Multicore Machines

Jiacheng Wu, Jin Wang, Carlo Zaniolo
2022 Proceedings of the 2022 International Conference on Management of Data  
Our key contribution is a novel system architecture that supports a wide scope of Datalog applications with a light-weight coordination scheme during parallel evaluation.  ...  In this paper, we present DCDatalog, an in-memory Datalog engine specifically designed for modern shared-memory multicore architectures.  ...  Souffle [27, 38] is a Datalog engine designed with concurrent B-Tree indexes. It does not support aggregates in recursion and thus cannot express many advanced analytical queries.  ... 
doi:10.1145/3514221.3517853 fatcat:lgv7q6jdojabjbcerxjneawhla

Page 4527 of Mathematical Reviews Vol. , Issue 91H [page]

1991 Mathematical Reviews  
Coburn [Neil Coburn], A theory of specialization constraints for complex objects (pp. 229-244); P. De Bra and J.  ...  for differ- ent programming languages (pp. 373-387); B.  ... 


Yurong Jiang, Hang Qiu, Matthew McCartney, William G. J. Halfond, Fan Bai, Donald Grimm, Ramesh Govindan
2014 Proceedings of the 12th ACM Conference on Embedded Network Sensor Systems - SenSys '14  
Experimental results on a prototype show that CARLOG can reduce latency by nearly two orders of magnitude relative to an unoptimized Datalog engine.  ...  , alerting a driver, turning on fog lights, screening calls).  ...  We thank David Kempe for discussions on PAC cost optimization.  ... 
doi:10.1145/2668332.2668350 dblp:conf/sensys/JiangQMHBGG14 fatcat:lwipbkazvbgqxnt6l44wilvdf4

Parallel Logic Programming: A Sequel [article]

Agostino Dovier, Andrea Formisano, Gopal Gupta, Manuel V. Hermenegildo, Enrico Pontelli, Ricardo Rocha
2022 arXiv   pre-print
The goal of the survey is to serve not only as a reference for researchers and developers of logic programming systems, but also as engaging reading for anyone interested in logic and as a useful source  ...  Since its inception, logic programming has been recognized as a programming paradigm with great potential for automated exploitation of parallelism.  ...  Moustafa et al. (2016) propose Datalography, a bottom-up evaluation engine for Datalog tailored to graph analytics.  ... 
arXiv:2111.11218v2 fatcat:hek4fidju5fblprut2squ6o3rm

Compiled Plans for In-Memory Path-Counting Queries [chapter]

Brandon Myers, Jeremy Hyrkas, Daniel Halperin, Bill Howe
2015 Lecture Notes in Computer Science  
In this paper, we present preliminary results for this approach on path-counting queries, which includes triangle counting as a special case.  ...  We then produce analogous parallel programs for Grappa, a runtime system for distributed memory architectures.  ...  This simplicity, combined with Grappa's good scalability, makes our code generation an easy and efficient method for relational queries on real-world graphs in a distributed setting.  ... 
doi:10.1007/978-3-319-13960-9_3 fatcat:irr2plv7rrgyba6pehlaqyuqhe

Traversing Knowledge Graphs with Good Old (and New) Joins

Paolo Atzeni, Luigi Bellomarini, Davide Benedetto, Emanuel Sallinger
2020 European Conference on Artificial Intelligence  
While specialized algorithms exist for st-connectivity [11] , here we do not aim at providing new heuristics for the problem, but at showing how Datalog evaluation strategies materialize into different  ...  We built a balanced tree with a branching factor of 4 and height 11. In this tree structure, in contrast to the previous scenarios, the density grows with the tree level.  ... 
dblp:conf/ecai/AtzeniBBS20 fatcat:rqyinx73ujbhvhchjskdmw56i4

Page 5248 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
Therefore we analyse the ability of skip trees to manage data bases in comparison with B-trees.”  ...  Summary: “A binding-time analysis is the first pass of an offline partial evaluator. It determines which parts of a program may be executed at specialization time.  ... 

Constraint Query Languages

P.C. Kanellakis, G.M. Kuper, P.Z. Revesz
1995 Journal of computer and system sciences (Print)  
The key intuition is that the generalization of a ground fact, or tuple, is a conjunction of constraints over a small number of variables.  ...  For the analysis, we use quanti er elimination techniques from logic and the concept of data complexity from database theory.  ...  Acknowledgements: We would like to thank Jean-Louis Lassez for his constant encouragement.  ... 
doi:10.1006/jcss.1995.1051 fatcat:zta4y65ouvdbvk4kp5l4fwz4uq

Design and Implementation of the LogicBlox System

Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, Geoffrey Washburn
2015 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15  
facilities; a novel concurrency control scheme; and built-in support for prescriptive and predictive analytics.  ...  These include: LogiQL, a unified and declarative language based on Datalog; the use of purely functional data structures; novel join processing strategies; advanced incremental maintenance and live programming  ...  Again, a unary LFTJ is performed to enumerate bindings for b that satisfy both R(a, b) and S(b, _) (for the current value of a).  ... 
doi:10.1145/2723372.2742796 dblp:conf/sigmod/ArefCGKOPVW15 fatcat:rsqnraye3ncz7chrc6ofqwy7ii

Load-Balancing Parallel Relational Algebra [chapter]

Sidharth Kumar, Thomas Gilray
2020 Lecture Notes in Computer Science  
Relational algebra (RA) comprises a basis of important operations, sufficient to power state-of-the-art reasoning engines for Datalog and related logic-programming languages.  ...  For temporal balancing, we implement a technique that permits the residual workload from a busy iteration to roll over to a new iteration.  ...  We are thankful to the Argonne Leadership Computing Facility's Director's Discretionary (DD) program for providing us with compute hours to run our experiments on the Theta Supercomputer.  ... 
doi:10.1007/978-3-030-50743-5_15 fatcat:aepzqejt3re27ayxvbu3vo65ea

Page 5692 of Mathematical Reviews Vol. , Issue 93j [page]

1993 Mathematical Reviews  
branches in a top-down evaluation tree.  ...  In contrast to Prolog’s strict left to right order of evaluation, termination proofs for concurrent languages are complicated by a more sophisticated mechanism of subgoal selection.  ... 

Applying Prolog to develop distributed systems

2010 Theory and Practice of Logic Programming  
Our experimental evaluation using a distributed hash-table data structure, a protocol for achieving Byzantine fault tolerance, and a distributed software model checker—all implemented in DAHL—indicates  ...  While Datalog-based languages have been actively explored for programming distributed systems, Prolog received relatively little attention in this application area so far.  ...  The resulting programming languages have a bottom-up evaluation semantics where the evaluation of (Datalog) clauses causes the execution of corresponding networking actions.  ... 
doi:10.1017/s1471068410000360 fatcat:zlpi4rqvtjbonlr3nxljlqczva

Efficient access mechanisms for tabled logic programs

I.V Ramakrishnan, Prasad Rao, Konstantinos Sagonas, Terrance Swift, David S Warren
1999 The Journal of Logic Programming  
Tries, a variant of discrimination nets, provide complete discrimination for terlns, and permit a lookup and possible insertion to be performed in a single pass through a term.  ...  This article describes the design, implementation, and experimental evaluation of data structures and algorithms for high-performance table access. Our approach uses tries as the basis for tables.  ...  Ramakrishnan for his help in the preparation and proofreading of this article, and the anonymous reviewers for their many helpful comments.  ... 
doi:10.1016/s0743-1066(98)10013-4 fatcat:7hozzm43rravldeniezyhe4sru
« Previous Showing results 1 — 15 out of 603 results