Declarative Systems for Large-Scale Machine Learning.
Vinayak Borkar, Yingyi Bu, Michael J. Carey et al. · 2012
In this article, we make the case for a declarative foundation for data-intensive machine learning systems. Instead of creating a new system for each specific flavor of machine learning task, or hardcoding new optimizations, we argue for the use of recursive queries to program a variety of machine learning algorithms. By taking this approach, database query optimization techniques can be utilized to identify effective execution plans, and the resulting runtime plans can be executed on a single unified data-parallel query processing engine. 1
Cited by 31 works.
Authors
- Vinayak Borkar
- Yingyi Bu
- Michael J. Carey
- Joshua Rosen
- Neoklis Polyzotis
- Tyson Condie
- Markus Weimer
- Raghu Ramakrishnan
References
- MapReduce
- Map-Reduce for Machine Learning on Multicore
- Spark: cluster computing with working sets
- Parallel database systems
- Efficient noise-tolerant learning from statistical queries
- A Reliable Effective Terascale Linear Learning System
- Hyracks: A flexible and extensible foundation for data-intensive computing
- Inside "Big Data management"
- A Survey of Research in Deductive Database Systems
- Negation and aggregates in recursive rules: the LDL++ approach