PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development
Not on the map. Why?
Abstract (arXiv)
This paper describes PlinyCompute, a system for development of high-performance, data-intensive, distributed computing tools and libraries. In the large, PlinyCompute presents the programmer with a very high-level, declarative interface, relying on automatic, relational-database style optimization to figure out how to stage distributed computations. However, in the small, PlinyCompute presents the capable systems programmer with a persistent object data model and API (the "PC object model") and associated memory management system that has been designed from the ground-up for high performance, distributed, data-intensive computing. This contrasts with most other Big Data systems, which are constructed on top of the Java Virtual Machine (JVM), and hence must at least partially cede performance-critical concerns such as memory management (including layout and de/allocation) and virtual method/function dispatch to the JVM. This hybrid approach---declarative in the large, trusting the programmer's ability to utilize PC object model efficiently in the small---results in a system that is ideal for the development of reusable, data-intensive tools and libraries. Through extensive benchmarking, we show that implementing complex objects manipulation and non-trivial, library-style computations on top of PlinyCompute can result in a speedup of 2x to more than 50x or more compared to equivalent implementations on Spark.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 1; 2026: 1.
5 papers.
- 2023A Comparison of Decision Forest Inference Platforms from A Database Perspectivecited by 3
- 2023Serving Deep Learning Model in Relational Databasescited by 2
- 2023Auto-Differentiation of Relational Computations for Very Large Scale Machine Learningcited by 1
- 2025InferF: Declarative Factorization of AI/ML Inferences over Joinscited by 0
- 2026Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computationcited by 0
- 2026Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation9 Mar 2026
- 2025InferF: Declarative Factorization of AI/ML Inferences over Joins25 Nov 2025
- 2023Serving Deep Learning Model in Relational Databases7 Oct 2023
- 2023Auto-Differentiation of Relational Computations for Very Large Scale Machine Learning31 May 2023
- 2023A Comparison of Decision Forest Inference Platforms from A Database Perspective9 Feb 2023