Design and Implementation of the LogicBlox System
The DOI matches its Crossref record; 35 of the 37 references it cites were found in a registry or an index.
Abstract
The LogicBlox system aims to reduce the complexity of software development for modern applications which enhance and automate decision-making and enable their users to evolve their capabilities via a ``self-service'' model. Our perspective in this area is informed by over twenty years of experience building dozens of mission-critical enterprise applications that are in use by hundreds of large enterprises across industries such as retail, telecommunications, banking, and government. We designed and built LogicBlox to be the system we wished we had when developing those applications.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Linear integer programming has also been used in the context of information systems for redesigning the enterprise software stack centered around a unified declarative programming model in order to support mathematical optimization (Aref et al., 2015).”
From Prescriptive analytics: Literature review and research challenges (2020) · cites this paper as Aref et al., 2015
Citations
Cites
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186 · cited 1×
“Row-level locking [6] is a bottleneck when α 1: since most transactions have items in common, they quickly encounter lock conflicts and are put to sleep.”
BackgroundSCIP: solving constraint integer programs
Achterberg, T. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-008-0001-1 · Cited by 1,167 · cited 1×
“We briefly discuss some extensions to LogiQL that we are currently developing to make statistical and probabilistic model building more natural by using the native modeling constructs of the language.”
MethodMaintaining views incrementally
Gupta, A., Mumick, I. S., & Subrahmanian, V. S. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170066 · Cited by 654
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625 · cited 2×
“The treaps are purely functional [35], i.”
BackgroundImmerman, N. (1999) · Springer eBooks · doi:10.1007/978-1-4612-0539-5 · Cited by 538 · cited 1×
“5Indeed, it follows from the Immerman-Vardi theorem [25] that every PTIME-computable view definition is expressible.”
MethodSAP HANA database: data management for modern business applications
Färber, F., Cha, S. K., Primsch, J., Bornhövd, C., Sigg, S., & Lehner, W. (2012) · ACM SIGMOD Record · doi:10.1145/2094114.2094126 · Cited by 396 · cited 2×
“Difficulties in providing high-quality materialized view implementations have motivated some systems, such as HANA [16], to dispense with them altogether, and instead require that analytical queries always be computed on the fly.”
Background"One size fits all": an idea whose time has come and gone
Stonebraker, M., & Cetintemel, U. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.1 · Cited by 393
Worst-case optimal join algorithms: [extended abstract]
Ngo, H. Q., Porat, E., Ré, C., & Rudra, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213565 · Cited by 324
Markov Logic: An Interface Layer for Artificial Intelligence
Domingos, P., & Lowd, D. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00206ed1v01y200907aim007 · Cited by 314 · cited 2×
“For example, in the case of MLNs, the likelihood of a possible world is proportional to the product of the factors, where a factor is defined for each satisfying grounding a rule (in the possible extension) and constitutes (a function of) the weight of that rule.”
BackgroundSeidel, R., & Aragon, C. R. (1996) · Algorithmica · doi:10.1007/bf01940876 · Cited by 281 · cited 1×
“These are randomized binary search trees that offer efficient search, insertion, and deletion [37].”
Tuffy: scaling up statistical inference in Markov logic networks using an RDBMS
Niu, F., Ré, C., Doan, A., & Shavlik, J. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/1978665.1978669 · Cited by 251 · cited 1×
“, eliminates the quantifiers in) the problem instance in a manner similar to [33] via automatic synthesis of another LogiQL program that translates the constraints over variable predicates into a representation that can be consumed by the solver.”
MethodConsistency Analysis in Bloom: a CALM and Collected Approach
Alvaro, P., Conway, N., Hellerstein, J. M., & Marczak, W. R. (2011) · Conference on Innovative Data Systems Research · Cited by 243
Adaptive set intersections, unions, and differences
Demaine, E. D., López-Ortíz, A., & Munro, J. I. (2000) · doi:10.5555/338219.338634 · Cited by 161
Probabilistic Similarity LogicPreprint
Broecheler, M., Mihalkova, L. S., & Getoor, L. C. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.3469 · Cited by 148 · cited 1×
“Markov Logic Networks (MLN) [15] and Probabilistic Soft Logic (PSL) [9] are two examples of languages that combine logical and statistical modeling.”
BackgroundA Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
Hwang, F. K., & Lin, S. (1972) · SIAM Journal on Computing · doi:10.1137/0201004 · Cited by 142
Datalog and emerging applications: an interactive tutorial
Huang, S., Green, T. J., & Loo, B. T. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989456 · Cited by 130 · cited 1×
“The resurgence of Datalog in academic circles has been well documented [34, 1, 23].”
BackgroundSelf-citationDatalog and Recursive Query Processing
Green, T. J., Huang, S., Loo, B. T., & Zhou, W. (2013) · Foundations and Trends in Databases · doi:10.1561/1900000017 · Cited by 102 · cited 8×
“In a recent paper [5], we considered the LogiQL fragment of conjunctive derivation rules (i.e., traditional Datalog) and arbitrary integrity constraints.”
MethodInfluentialSelf-citationSQL’s Three-Valued Logic and Certain Answers
Libkin, L. (2016) · ACM Transactions on Database Systems · doi:10.1145/2877206 · Cited by 83 · cited 1×
“The treatment of null values in databases, and the threevalued logic that it carries with it, has long been a source of conceptual problems and awkwardness [27].”
BackgroundMeliou, A., & Suciu, D. M. (2012) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2213836.2213875 · Cited by 79 · cited 1×
“Examples of research in this area include [12, 18, 38, 30].”
BackgroundFast set operations using treaps
Blelloch, G. E., & Reid-Miller, M. (1998) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/277651.277660 · Cited by 76 · cited 1×
“Set intersection, union, and difference are also efficient [7].”
BackgroundThe principles and practice of probabilistic programming
Goodman, N. D. (2013) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2429069.2429117 · Cited by 73 · cited 1×
“Formalisms for specifying general statistical models, such as probabilistic-programming languages [17], typically consist of two components: a specification of a stochastic process (the prior), and a specification of observations that restrict the probability space to a conditional subspace (the posterior).”
BackgroundNP-SPEC: an executable specification language for solving all problems in NP
Cadoli, M., Ianni, G., Palopoli, L., Schaerf, A., & Vasile, D. (2000) · Computer Languages · doi:10.1016/s0096-0551(01)00010-8 · Cited by 66
Join Processing for Graph Patterns: An Old Dog with New Tricks
Nguyen, D. T., Aref, M., Bravenboer, M., Kollias, G., Ngo, H. Q., Ré, C., & Rudra, A. (2015) · doi:10.1145/2764947.2764948 · Cited by 60 · cited 1×
“See [32] for full details and more experiments.”
BackgroundSelf-citationLeapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm
Veldhuizen, T. L. (2014) · Cited by 40
Self-citationYedalog: Exploring Knowledge at Scale
Chin, B., Ζ, D. V. D., Ercegovac, V., Hawkins, P., Miller, M. S., Och, F. J., Olston, C., & Pereira, F. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.snapl.2015.63 · Cited by 39 · cited 1×
“Other recent industrial systems based on Data-log include Google’s Yedalog [13], Datomic 1 , and the nascent EVE project 2 , funded by Andreessen Horowitz.”
MethodSQL's Three-Valued Logic and Certain Answers
Libkin, L. O. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icdt.2015.94 · Cited by 20
LogiQL: A Query Language for Smart Databases
Halpin, T. A., & Rugaber, S. (2014) · CERN Document Server (European Organization for Nuclear Research) · Cited by 20
atalog: A logic language for expressing search and optimization problems
Greco, S., Molinaro, C., Trubitsyna, I., & Zumpano, E. (2010) · Theory and Practice of Logic Programming · doi:10.1017/s1471068409990251 · Cited by 19 · cited 1×
“Examples of research in this area include [12, 18, 38, 30].”
BackgroundDeclarative Statistical Modeling with Datalog
Barany, V., ten Cate, B., Kimelfeld, B., Olteanu, D., & Vagena, Z. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icdt.2023.11 · Cited by 15
Self-citationMapping ORM to Datalog: An Overview
Halpin, T. A., Curland, M., Stirewalt, K., Viswanath, N., McGill, M., & Beck, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16961-8_72 · Cited by 13
Incremental Maintenance for Leapfrog TriejoinPreprint
Veldhuizen, T. L. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.5313 · Cited by 11 · cited 1×
“The maintenance algorithm is designed to be optimal in the sense that the cost of maintenance under changes to the input predicates is proportional to the trace-edit distance of the corresponding runs of the LFTJ algorithm [41].”
MethodSelf-citationTransaction Repair: Full Serializability Without LocksPreprint
Veldhuizen, T. L. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.5645 · Cited by 8 · cited 3×
“Transaction repair allows us to achieve nearlinear parallel speedup in the number of cores, even for high values of α such as α = 10 [43].”
BackgroundMethodInfluentialSelf-citationSheard, T. E. (2012) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2364527.2364542 · Cited by 4 · cited 1×
“Examples of research in this area include [12, 18, 38, 30].”
Background
Research works printed but not linked: 10
- 10.5555/551350 · doi:10.5555/551350
- Brian Burg , Adrian Kuhn , and Chris Parnin. First Int. Workshop on Live Programming (LIVE). In ICSE , pages 1529 -- 1530 , 2013 . Brian Burg, Adrian Kuhn, and Chris Parnin. First Int. Workshop on Live Programming (LIVE). In ICSE, pages 1529--1530, 2013.
- 10.5555/1855041 · doi:10.5555/1855041
- 10.5555/2765617 · doi:10.5555/2765617
- 10.5555/1948509.1948613 · doi:10.5555/1948509.1948613
- Bertram Lud\"ascher. Integration of Active and Deductive Database Rules , volume 45 of DISDBIS . Infix Verlag , St . August in, Germany, 1998 . Bertram Lud\"ascher. Integration of Active and Deductive Database Rules, volume 45 of DISDBIS. Infix Verlag, St. Augustin, Germany, 1998.
- 10.5555/42207 · doi:10.5555/42207
- Tim Furche Andrew Sellers Oege de Moor , Georg Gottlob , editor. Datalog Reloaded: Proceedings of the First International Datalog 2.0 Workshop. Springer , 2011 . Tim Furche Andrew Sellers Oege de Moor, Georg Gottlob, editor. Datalog Reloaded: Proceedings of the First International Datalog 2.0 Workshop. Springer, 2011.
- 10.5555/580840 · doi:10.5555/580840
- Gurobi Optimization . Gurobi optimizer reference manual , 2015 . Gurobi Optimization. Gurobi optimizer reference manual, 2015.
Cited by
Prescriptive analytics: Literature review and research challenges
Lepenioti, K., Bousdekis, A., Apostolou, D., & Mentzas, G. (2020) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2019.04.003 · Cited by 501
“Linear integer programming has also been used in the context of information systems for redesigning the enterprise software stack centered around a unified declarative programming model in order to support mathematical optimization (Aref et al., 2015).”
Worst-case optimal join algorithms: [extended abstract]
Ngo, H. Q., Porat, E., Ré, C., & Rudra, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213565 · Cited by 324
“LFTJ is the work-horse join algorithm for the LogicBlox ’s datalog engine, and was already implemented since about 2009.”
BackgroundInfluentialFAQ: Questions Asked Frequently
Abo Khamis, M., Ngo, H. Q., & Rudra, A. (2016) · Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems · doi:10.1145/2902251.2902280 · Cited by 172
“Far beyond graph patterns, we have implemented InsideOut within the LogicBlox database system [6] with great performance results.”
MethodEmptyHeaded: A Relational Engine for Graph Processing
Aberger, C. R., Lamb, A. A., Tu, S., Nötzli, A., Olukotun, K., & Ré, C. (2017) · ACM Transactions on Database Systems · doi:10.1145/3129246 · Cited by 250
“Log-icBlox [7] uses multiway join algorithms and has demonstrated that they can support a rich set of applications.”
Background
Metadata
- Authors
- Aref, M., ten Cate, B., Green, T. J., Kimelfeld, B., Olteanu, D., Pasalic, E., Veldhuizen, T. L., & Washburn, G.
- Affiliations
- LogicBlox, Atlanta, GA, USA
- Venue
- Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2015-05-27
- Pages
- 1371-1382
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2008865455
- Cited by
- 233
- References
- 37
- Citations by year
- 2026: 12 · 2025: 11 · 2024: 13 · 2023: 16 · 2022: 15 · 2021: 22 · 2020: 24 · 2019: 30 · 2018: 29 · 2017: 27 · 2016: 24 · 2015: 9
- FWCI
- 16.72
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGMOD International Conference on Management of Data (SIGMOD) (publishedVersion)
- Funders
- Engineering and Physical Sciences Research Council (EP/L012138/1)
- Topics
- Physical Sciences › Computer Science › Software › Advanced Software Engineering Methodologies
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
- Keywords
- automated decision-making, enterprise software, software complexity reduction, mission-critical applications
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.