798 Hits in 3.0 sec

A probabilistic view of Datalog parallelization

Sérgio Lifschitz, Victor Vianu
1998 Theoretical Computer Science  
To illustrate, we consider a very simple parallelization strategy that applies to all Datalog programs. We prove that this has very good expected performance under equal distribution of inputs.  ...  We explore an approach to developing Datalog parallelization strategies that aims at good expected rather than worst-case performance.  ...  the expected behavior of parallelization strategies.  ... 
doi:10.1016/s0304-3975(97)00091-1 fatcat:ib2qtagn4zfcdcorpx7z2okwb4

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  
In this paper, we present DCDatalog, an in-memory Datalog engine specifically designed for modern shared-memory multicore architectures.  ...  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.  ...  We propose a novel dynamic coordination strategy to overcome the limitations of existing approaches for parallel Datalog evaluation.  ... 
doi:10.1145/3514221.3517853 fatcat:lgv7q6jdojabjbcerxjneawhla

Scaling-up in-memory datalog processing

Zhiwei Fan, Jianqiao Zhu, Zuyu Zhang, Aws Albarghouthi, Paraschos Koutris, Jignesh M. Patel
2019 Proceedings of the VLDB Endowment  
Second, we design and implement our own general-purpose Datalog engine, called RecStep, on top of a parallel single-node relational system.  ...  Using RecStep as a baseline, we demonstrate that it generally outperforms state-of-the-art parallel Datalog engines on complex and large-scale Datalog evaluation, by a 4-6X margin.  ...  We also thank CloudLab (, NSF grant CNS-1419199) for providing part of the computational infrastructure that was used for this work.  ... 
doi:10.14778/3311880.3311886 fatcat:qrk6aczue5ffjlprbs62ydawsa


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.  ...  of query execution.  ...  We thank David Kempe for discussions on PAC cost optimization.  ... 
doi:10.1145/2668332.2668350 dblp:conf/sensys/JiangQMHBGG14 fatcat:lwipbkazvbgqxnt6l44wilvdf4

Scaling-Up In-Memory Datalog Processing: Observations and Techniques [article]

Zhiwei Fan, Jianqiao Zhu, Zuyu Zhang, Aws Albarghouthi, Paraschos Koutris, Jignesh Patel
2018 arXiv   pre-print
We show that RecStep generally outperforms the state-of-the-art parallel Datalog engines on complex and large-scale Datalog program evaluation, by a 4-6X margin.  ...  As a result, we designed and implemented a general-purpose Datalog engine, called RecStep, on top of a parallel single-node relational system.  ...  Nonlinear recursive rules are commonly observed in Datalog programs for program analysis, and the results help us understand the behavior of our system and other systems when evaluating Datalog programs  ... 
arXiv:1812.03975v1 fatcat:4hlwmlcbofaejdxlkgfnkcuaym

Declarative Networking

Tom J. Ameloot
2014 SIGMOD record  
We discuss recent theoretical results on declarative networking, in particular regarding the topics of coordination, correctness, and declarative semantics.  ...  The mentioned decidability results [13, 10] provide an indication that automatically deciding correctness of a distributed system might not be a useful strategy in practice.  ...  Although the stable model semantics might be less intuitive for the programmer, it provides avenues for new theoretical and practical research.  ... 
doi:10.1145/2694413.2694415 fatcat:r72f5oqytfb7xnbaml4rzgrr7u

The declarative imperative

Joseph M. Hellerstein
2010 SIGMOD record  
This juxtaposition raises the possibility that the theory of declarative database query languages can provide a foundation for the next generation of parallel and distributed programming languages.  ...  The rise of multicore processors and cloud computing is putting enormous pressure on the software community to find solutions to the difficulty of parallel and distributed programming.  ...  But I suspect the conjecture holds for most practical cases of interest in distributed and parallel computing.  ... 
doi:10.1145/1860702.1860704 fatcat:p7w5mmjqqjh5pmu2gbmtm24kau

So You Want to Analyze Scheme Programs With Datalog? [article]

Davis Ross Silverman, Yihao Sun, Kristopher Micinski, Thomas Gilray
2021 arXiv   pre-print
In this paper, we present an implementation of control-flow analysis for a significant subset of Scheme (including set!, call/cc, and primitive operations) using the Souffl\'e Datalog engine.  ...  State-of-the-art implementations (such as DOOP on Souffl\'e) structure the analysis using Horn-SAT (Datalog) to enable compilation of the analysis to efficient implementations such as high-performance  ...  To measure scalability and complexity in practice, we construct a family of terms that exhibit worst-case (polynomial) behavior.  ... 
arXiv:2107.12909v1 fatcat:qktoyfushjfadpyzlcgrkrgb7e

FormuLog: Datalog for static analysis involving logical formulae [article]

Aaron Bembenek, Stephen Chong
2018 arXiv   pre-print
Datalog has become a popular language for writing static analyses. Because Datalog is very limited, some implementations of Datalog for static analysis have extended it with new language features.  ...  We have used FormuLog to implement declarative versions of symbolic execution and abstract model checking, analyses previously out of the scope of Datalog-based languages.  ...  For example, the meaning of a pure function does not depend on whether a call-by-value or call-by-name reduction strategy is used.  ... 
arXiv:1809.06274v1 fatcat:ec6pkpglzbe53ns75364iyv6nq

Effective Datalog-like representation of procedural programs

David Bednárek
2012 Conference on Theory and Practice of Information Technologies  
Such a language may then be used as a common representation for both relational and procedural part of an application.  ...  In this paper, we show that procedural programs may be effectively represented in a Datalog-like language with functions and aggregates.  ...  Our approach was motivated by the lessons learned from the implementation of a parallel SPARQL engine [4] for the Semantic Web.  ... 
dblp:conf/itat/Bednarek12 fatcat:o3pogk2dhre4li4yh4px5pwhpu

Seamless deductive inference via macros

Arash Sahebolamri, Thomas Gilray, Kristopher Micinski
2022 Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction  
We present an approach to integrating state-of-art bottom-up logic programming within the Rust ecosystem, demonstrating it with Ascent, an extension of Datalog that performs well against comparable systems  ...  of magnitude compared to Flix.  ...  Updating the compiler to generate parallel code is another avenue of improvement for Ascent.  ... 
doi:10.1145/3497776.3517779 fatcat:fkotic4oszeqhan2imae6c6h3e

Logical Aspects of Massively Parallel and Distributed Systems

Frank Neven
2016 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16  
While distributed and parallel data management systems have been around for quite some time, it is the rise of cloud computing and the advent of Big Data that presents the community with new challenges  ...  Database research has witnessed a renewed interest for data processing in distributed and parallel settings.  ...  I thank Tom Ameloot, Gaetano Geck, Bas Ketsman, Thomas Schwentick, Dan Suciu, and Tony Tan for helpful comments on a previous version of this paper.  ... 
doi:10.1145/2902251.2902307 dblp:conf/pods/Neven16 fatcat:n2ikormeufe7bmy3g5gkbrfcsi

Page 4345 of Mathematical Reviews Vol. , Issue 2000f [page]

2000 Mathematical Reviews  
Janeiro); Vianu, Victor (1-UCSD-CS; La Jolla, CA) A probabilistic view of Datalog parallelization.  ...  We study the behavior of successful searches, assuming searches for all elements of the table are equally likely.  ... 

The Vadalog system

Luigi Bellomarini, Emanuel Sallinger, Georg Gottlob
2018 Proceedings of the VLDB Endowment  
As the main contribution of this paper, we illustrate the first implementation of Warded Datalog+/-, a high-performance Datalog+/-system utilizing an aggressive termination control strategy.  ...  The Vadalog System: Datalog-based Reasoning for Knowledge Graphs. PVLDB, 11(9): 975-987, 2018.  ...  The Vadalog system as presented here is IP of the University of Oxford.  ... 
doi:10.14778/3213880.3213888 fatcat:cbkkhqm2mfhihht76fo6bq5mne

Datalog Unchained

Victor Vianu
2021 Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
This is the companion paper of a talk in the Gems of PODS series, that reviews the development, starting at PODS 1988, of a family of Datalog-like languages with procedural, forward chaining semantics,  ...  Datalog variants with forward chaining semantics have been adopted in a variety of settings, including active databases, production systems, distributed data exchange, and data-driven reactive systems.  ...  Special thanks to Serge Abiteboul for revisiting our joint work and providing many useful suggestions for the presentation.  ... 
doi:10.1145/3452021.3458815 fatcat:b6mnoptf2jgdtl27xrt54z7r5u
« Previous Showing results 1 — 15 out of 798 results