{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:24Z","timestamp":1750307244579,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T00:00:00Z","timestamp":1329350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2012,2,16]]},"abstract":"<jats:p>In this paper we introduce GLADE, a scalable distributed framework for large scale data analytics. GLADE consists of a simple user-interface to define Generalized Linear Aggregates (GLA), the fundamental abstraction at the core of GLADE, and a distributed runtime environment that executes GLAs by using parallelism extensively.<\/jats:p>\n          <jats:p>GLAs are derived from User-Defined Aggregates (UDA), a relational database extension that allows the user to add specialized aggregates to be executed inside the query processor. GLAs extend the UDA interface with methods to Serialize\/Deserialize the state of the aggregate required for distributed computation. As a significant departure from UDAs which can be invoked only through SQL, GLAs give the user direct access to the state of the aggregate, thus allowing for the computation of significantly more complex aggregate functions.<\/jats:p>\n          <jats:p>GLADE runtime is an execution engine optimized for the GLA computation. The runtime takes the user-defined GLA code, compiles it inside the engine, and executes it right near the data by taking advantage of parallelism both inside a single machine as well as across a cluster of computers. This results in maximum possible execution time performance (all our experimental tasks are I\/O-bound) and linear scaleup.<\/jats:p>","DOI":"10.1145\/2146382.2146386","type":"journal-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T18:42:36Z","timestamp":1329936156000},"page":"12-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["GLADE"],"prefix":"10.1145","volume":"46","author":[{"given":"Florin","family":"Rusu","sequence":"first","affiliation":[{"name":"University of California, Merced, Merced, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alin","family":"Dobra","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,2,16]]},"reference":[{"volume-title":"http:\/\/hadoop.apache.org\/. {Online","year":"2011","key":"e_1_2_1_1_1","unstructured":"Hadoop. http:\/\/hadoop.apache.org\/. {Online ; accessed July 2011 }. Hadoop. http:\/\/hadoop.apache.org\/. {Online; accessed July 2011}."},{"key":"e_1_2_1_2_1","volume-title":"http:\/\/msdn.microsoft.com\/enus\/library\/ms131057.aspx. {Online","author":"Server SQL","year":"2011","unstructured":"Microsoft SQL Server . http:\/\/msdn.microsoft.com\/enus\/library\/ms131057.aspx. {Online ; accessed July 2011 }. Microsoft SQL Server. http:\/\/msdn.microsoft.com\/enus\/library\/ms131057.aspx. {Online; accessed July 2011}."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807224"},{"key":"e_1_2_1_4_1","volume-title":"SCOPE: Easy and Efficient Parallel Processing of Massive Data Sets. In VLDB","author":"Chaiken R.","year":"2008","unstructured":"R. Chaiken and al. SCOPE: Easy and Efficient Parallel Processing of Massive Data Sets. In VLDB 2008 . R. Chaiken and al. SCOPE: Easy and Efficient Parallel Processing of Massive Data Sets. In VLDB 2008."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687576"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142480"},{"key":"e_1_2_1_7_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters. In OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters. In OSDI 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI 2004."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687567"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559962"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559865"},{"key":"e_1_2_1_13_1","volume-title":"Scientific Programming Journal","author":"Pike R.","year":"2003","unstructured":"R. Pike and al. Interpreting the Data: Parallel Analysis with Sawzall . In Scientific Programming Journal 2003 . R. Pike and al. Interpreting the Data: Parallel Analysis with Sawzall. In Scientific Programming Journal 2003."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645914.671647"},{"key":"e_1_2_1_15_1","volume-title":"MapReduce Framework. In VLDB","author":"Thusoo A.","year":"2009","unstructured":"A. Thusoo and al. Hive -- A Warehousing Solution Over a MapReduce Framework. In VLDB 2009 . A. Thusoo and al. Hive -- A Warehousing Solution Over a MapReduce Framework. In VLDB 2009."},{"key":"e_1_2_1_16_1","volume-title":"VLDB","author":"Wang H.","year":"2000","unstructured":"H. Wang and C. Zaniolo . Using SQL to Build New Aggregates and Extenders for Object-Relational Systems . In VLDB 2000 . H. Wang and C. Zaniolo. Using SQL to Build New Aggregates and Extenders for Object-Relational Systems. In VLDB 2000."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629600"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2146382.2146386","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2146382.2146386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:02Z","timestamp":1750243922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2146382.2146386"}},"subtitle":["a scalable framework for efficient analytics"],"short-title":[],"issued":{"date-parts":[[2012,2,16]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2,16]]}},"alternative-id":["10.1145\/2146382.2146386"],"URL":"https:\/\/doi.org\/10.1145\/2146382.2146386","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2012,2,16]]},"assertion":[{"value":"2012-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}