LaraDB
Dylan Hutchison, Bill Howe, Dan Mircea Suciu · 2017
Analytics tasks manipulate structured data with variants of relational algebra (RA) and quantitative data with variants of linear algebra (LA). The two computational models have overlapping expressiveness, motivating a common programming model that affords unified reasoning and algorithm design. At the logical level we propose LARA, a lean algebra of three operators, that expresses RA and LA as well as relevant optimization rules. We show a series of proofs that position LARA at just the right level of expressiveness for a middleware algebra: more explicit than MapReduce but more general than RA or LA. At the physical level we find that the LARA operators afford efficient implementations using a single primitive that is available in a variety of backend engines: range scans over partitioned sorted maps.
Cited by 58 works. doi:10.1145/3070607.3070608 Open-access PDF
Authors
References
- Bigtable: a distributed storage system for structured data
- Bigtable
- Spark: cluster computing with working sets
- SCOPE
- The generalized distributive law
- MLlib: Machine Learning in Apache Spark
- The Stratosphere platform for big data analytics
- Principles of programming with complex objects and collection types
- The MADlib analytics library
- Tenzing a SQL implementation on the MapReduce framework