The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
The MADlib analytics library: or MAD skills, the SQL
Abstract
MADlib is a free, open-source library of in-database analytic methods. It provides an evolving suite of SQL-based algorithms for machine learning, data mining and statistics that run at scale within a database engine, with no need for data import/export to other tools. The goal is for MADlib to eventually serve a role for scalable database systems that is similar to the CRAN library for R: a community repository of statistical methods, this time written with scale and parallelism in mind. In this paper we introduce the MADlib project, including the background that led to its beginnings, and the motivation for its open-source nature. We provide an overview of the library's architecture and design patterns, and provide a description of various statistical methods in that context. We include performance and speedup results of a core design pattern from one of those methods over the Greenplum parallel DBMS on a modest-sized test cluster. We then report on two initial efforts at incorporating academic research into MADlib, which is one of the project's goals. MADlib is freely available at http://madlib.net, and the project is open for contributions of both new methods, and ports to additional database platforms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · Cited by 3,622
Speech and language processing
(2010) · Day-to-Day Dyslexia in the Classroom · doi:10.4324/9780203461891_chapter_3 · Cited by 3,544
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
The R Project in Statistical Computing
Ripley, B. D. (2001) · MSOR Connections · doi:10.11120/msor.2001.01010023 · Cited by 2,529
Valgrind: a framework for heavyweight dynamic binary instrumentation
Nethercote, N., & Seward, J. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250746 · Cited by 2,244
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
Parallelized Stochastic Gradient Descent
Zinkevich, M., Weimer, M., Li, L., & Smola, A. J. (2010) · Cited by 1,124
A comparison of approaches to large-scale data analysis
Pavlo, A., Paulson, E., Rasin, A., Abadi, D. J., DeWitt, D. J., Madden, S., & Stonebraker, M. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559865 · Cited by 1,071
NP-hardness of Euclidean sum-of-squares clustering
Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009) · Machine Learning · doi:10.1007/s10994-009-5103-0 · Cited by 867
MAD skills: new analysis practices for big data
Cohen, J., Dolan, B., Dunlap, M., Hellerstein, J. M., & Welton, C. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687576 · Cited by 465
Self-citationBlackford, L. S., Choi, J., Cleary, A. J., Petitet, A. P., Whaley, R., Demmel, J. W., Dhillon, I. S., Stanley, K. S., Dongarra, J. J., Hammarling, S. J., et al. (1996) · Proceedings - Supercomputing · doi:10.1145/369028.369038 · Cited by 320
The Planar k-Means Problem is NP-Hard
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00202-1_24 · Cited by 308
Conditional Random Fields: An Introduction
Wallach, H. (2004) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 306
SystemML: Declarative machine learning on MapReduce
Ghoting, A., Krishnamurthy, R., Pednault, E., Reinwald, B., Sindhwani, V., Tatikonda, S., Tian, Y., & Vaithyanathan, S. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767930 · Cited by 295
The planark-means problem is NP-hard
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2012) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.05.034 · Cited by 277
Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data
Feldman, R., & Sanger, J. R. (2006) · Cited by 204
Stochastic Optimization: Algorithms and Applications
(2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6 · Cited by 198
Convergence Rate of Incremental Subgradient Algorithms
Nedić, A., & Bertsekas, D. (2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6_11 · Cited by 190
Towards a unified architecture for in-RDBMS analytics
Feng, X., Kumar, A., Recht, B., & Ré, C. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213874 · Cited by 182
Self-citationChoi, J., Demmel, J., Dhillon, I., Dongarra, J., Ostrouchov, S., Petitet, A., Stanley, K., Walker, D., & Whaley, R. C. (1996) · Computer Physics Communications · doi:10.1016/0010-4655(96)00017-3 · Cited by 176
k-Means Has Polynomial Smoothed Complexity
Arthur, D., Manthey, B., & Röglin, H. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.14 · Cited by 145
Integrating K-means clustering with a relational DBMS using SQL
ORDÓÑEZ, C. R. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.31 · Cited by 117
Statistical Model Computation with UDFs
ORDÓÑEZ, C. R. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.44 · Cited by 86
Snow: A Parallel Computing Framework for the R System
Tierney, L., Rossini, A. J., & Li, N. (2008) · International Journal of Parallel Programming · doi:10.1007/s10766-008-0077-2 · Cited by 65
Cited by
A survey of open source tools for machine learning with big data in the Hadoop ecosystem
Landset, S., Khoshgoftaar, T. M., Richter, A. N., & Hasanin, T. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0032-1 · Cited by 432
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
Self-citationProfiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
Automotive big data: Applications, workloads and infrastructures
Luckow, A., Kennedy, K., Manhardt, F., Djerekarov, E., Vorster, B., & Apon, A. (2015) · 2015 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2015.7363874 · Cited by 92
PALM: Machine Learning Explanations For Iterative Debugging
Krishnan, S., & Wu, E. (2017) · Proceedings of the 2nd Workshop on Human-In-the-Loop Data Analytics · doi:10.1145/3077257.3077271 · Cited by 81
Metadata
- Authors
- Hellerstein, J. M., Ré, C., Schoppmann, F., Wang, D. Z., Fratkin, E., Gorajek, A., Ng, K. S., Welton, C., Feng, X., Li, K., & Kumar, A.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2012-08
- Volume
- 5
- Issue
- 12
- Pages
- 1700-1711
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2044849727
- Cited by
- 373
- References
- 35
- FWCI
- 37.14
- Type
- journal article
- Language
- en
- Open access
- closed
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.