DOCSLIB.ORG

Monetdb/Datacell: Online Analytics in a Streaming Column-Store

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Monetdb/Datacell: Online Analytics in a Streaming Column-Store MonetDB/DataCell: Online Analytics in a Streaming Column-Store Erietta Liarou, Stratos Idreos, Stefan Manegold, Martin Kersten CWI, Amsterdam, The Netherlands [email protected] [email protected] [email protected] [email protected] ABSTRACT tion, web log analysis requires fast analysis of big streaming In DataCell, we design streaming functionalities in a mod- data for decision support. ern relational database kernel which targets big data analyt- A new processing paradigm is born [15, 19, 11] where in- ics. This includes exploitation of both its storage/execution coming streams of data need to quickly be analyzed and engine and its optimizer infrastructure. We investigate the possibly combined with existing data to discover trends and opportunities and challenges that arise with such a direction patterns. Subsequently, the new data may also enter the and we show that it carries significant advantages for mod- data warehouse and be stored as normal for further analy- ern applications in need for online analytics such as web sis if necessary. This new paradigm requires scalable query logs, network monitoring and scientific data management. processing that can combine continuous querying for fast The major challenge then becomes the efficient support for reaction to incoming data with traditional querying for ac- specialized stream features, e.g., multi-query processing and cess to the existing data. However, neither pure database incremental window-based processing as well as exploiting technology nor pure stream technology are designed for this standard DBMS functionalities in a streaming environment purpose. Database systems do not qualify for continuous such as indexing. query processing, while data stream systems are not built In this demo, we present the DataCell system, an exten- to scale for big data analysis. sion of the MonetDB open-source column-store for online an- DataCell Motivation. MonetDB/DataCell aims to pro- alytics. The demo gives the user the opportunity to experi- vide scalable online analytics. We begin from a state of ence the features of DataCell such as processing both stream the art column-store design for big data analytics, Mon- and persistent data and performing window based process- etDB, and extend it with online functionality. The goal is ing. The demo provides a visual interface to monitor the to fully exploit the generic storage and execution engine of critical system components, e.g., how query plans transform the DBMS as well as its complete optimizer stack. Stream from typical DBMS query plans to online query plans, how processing then becomes primarily a query scheduling task, data flows through the query plans as the streams evolve, i.e., make the proper queries see the proper portion of stream how DataCell maintains intermediate results in columnar data at the proper time. A positive side-effect is that our form to avoid repeated evaluation of the same stream por- architecture supports SQL'03, which allows stream applica- tions, etc. The demo also provides the ability to interac- tions to exploit sophisticated query semantics. Numerous tively set the test scenarios regarding input data and various research and technical questions immediately arise. The DataCell knobs. most prominent issues are the ability to provide specialized stream functionality and hindrances to guarantee real-time constraints for event handling. 1. INTRODUCTION Contributions and Demo. Paper [15] illustrates the Numerous applications nowadays require online analytics basic DataCell architecture and sets the research path and over high rate streaming data. For example, emerging ap- critical milestones. In addition, DataCell ships together plications over mobile data can exploit the big mobile data with the MonetDB open-source system. Here, we present streams for advertising and traffic control. In addition, the a demo based on MonetDB/DataCell. The demo showcases recent and continuously expanding massive cloud infrastruc- several of the key aspects of the MonetDB/DataCell design tures require continuous monitoring to remain in good state such as the ability to do both stream processing and normal and prevent fraud attacks. Similarly, scientific databases queries and the ability to provide window based processing. create data at massive rates daily or even hourly. In addi- Through a graphical user interface the user of the demo can observe the query execution inside DataCell, e.g., how the various columnar structures are populated, how intermedi- Permission to make digital or hard copies of all or part of this work for ate results are kept around to avoid reevaluation for sliding personal or classroom use is granted without fee provided that copies are window queries and how the shape of a normal query plan not made or distributed for profit or commercial advantage and that copies changes to a continuous query plan through the optimizer. bear this notice and the full citation on the first page. To copy otherwise, to In addition, the user can interact with the system, posing republish, to post on servers or to redistribute to lists, requires prior specific continuous or one-time queries or choosing some pre-defined permission and/or a fee. Articles from this volume were invited to present scenarios as well as varying both input parameters and Da- their results at The xth International Conference on Very Large Data Bases. Proceedings of the VLDB Endowment, Vol. X, No. Y taCell knobs. Copyright 20xy VLDB Endowment 2150-8097/11/XX... $ 10.00. Paper Organization. The rest of the paper is organized Receptors Parser/Compiler Emitters as follows. Section 2 briefly discusses related work while Sec- tion 3 gives an overview of the main design s of DataCell. Optimizer Then, Section 4 presents the demonstration scenarios as well Rewriter as the ways the user can interact with the system and how the demo visualizes query execution and system status. Fi- Scheduler/Factories nally, Section 5 concludes the paper. 2. RELATED WORK DataCell fundamentally differs from existing stream ef- Kernel forts [2, 3, 4, 7, 8, 9, 12, 21, 5, 10], etc. by building on top Baskets Tables of the storage and execution engine of a DBMS kernel. It opens a very interesting path towards exploiting and merg- ing technologies from both worlds. Figure 1: The DataCell Architecture Compared to even earlier efforts on active databases, e.g., [20], DataCell adds support for specialized stream function- alities, such as incremental processing. Incremental process- each attribute. Advanced column-stores process one column ing in a DBMS has been studied in the context of updat- at a time, using late tuple reconstruction, discussed in, e.g., ing materialized views, e.g., [6, 13], but there the scenario is [1, 14]. Intermediates are also in column format. This allows very different given that it targets read-mostly environments the engine to exploit CPU- and cache-optimized vector-like whereas an online scenario is by definition a write-only one. operator implementations throughout the whole query eval- Truviso Continuous Analytics system [11], a commercial uation, using an efficient bulk processing model instead of product of Truviso, is another recent example that follows the typical tuple-at-a-time volcano approach. This way, a the same approach as DataCell. They extend the open select operator for example, operates on a single column, fil- source PostgreSQL database [18] to enable continuous anal- tering the qualifying values and producing an intermediate ysis of streaming data, tackling the problem of low latency that holds their tuple IDs. This intermediate can then be query evaluation over massive data volumes. TruCQ inte- used to retrieve the necessary values from a different column grates streaming and traditional relational query process- for further actions, e.g., aggregations, further filtering, etc. ing in such a way that ends-up to a stream-relational da- The key point is that in DataCell these intermediates can be tabase architecture. It is able to run SQL queries continu- exploited for flexible incremental processing strategies, i.e., ously and incrementally over data while they are still com- we can selectively keep around the proper intermediates at ing and before they are stored in active database tables (if the proper places of a plan for efficient future reuse. they). TruCQ's query processing significantly outperforms DataCell. DataCell [15] is positioned between the SQL traditional store-first-query-later database technologies as compiler/optimizer and the DBMS kernel. The SQL com- the query evaluation has already been initiated when the piler is extended with a few orthogonal language constructs first tuples arrive. It allows evaluation of one-time queries, to recognize and process continuous queries. The query plan continuous queries, as well as combinations of both types. as generated by the SQL optimizer is rewritten to a contin- Another recent work, coming from the HP Labs [19], also uous query plan and handed over to the DataCell scheduler. confirms the strong research attraction for this trend. It In turn, the scheduler handles the execution of the plan. defines an extended SQL query model that unifies queries Figure 1 shows a DataCell instance. It contains receptors over both static relations and dynamic streaming data, by and emitters, i.e., a set of separate processes per stream and developing techniques to generalize the query engine. It also per client, respectively, to listen for new data and to deliver extends the PostgreSQL database kernel [18], building an results. They form the edges of the architecture and the engine that can process persistent and streaming data in bridges to the outside world, e.g., to sensor drivers. a uniform design. First, they convert the stream into a Baskets/Columns. The key idea is that when an event sequence of chunks and then continuously call the query stream enters the system via a receptor, stream tuples are over each sequential chunk. The query instance never shuts immediately stored in a lightweight table, called basket.
Load more

Recommended publications
  • Monetdb/X100: Hyper-Pipelining Query Execution
    MonetDB/X100: Hyper-Pipelining Query Execution Peter Boncz, Marcin Zukowski, Niels Nes CWI Kruislaan 413 Amsterdam, The Netherlands fP.Boncz,M.Zukowski,[email protected] Abstract One would expect that query-intensive database workloads such as decision support, OLAP, data- Database systems tend to achieve only mining, but also multimedia retrieval, all of which re- low IPC (instructions-per-cycle) efficiency on quire many independent calculations, should provide modern CPUs in compute-intensive applica- modern CPUs the opportunity to get near optimal IPC tion areas like decision support, OLAP and (instructions-per-cycle) efficiencies. multimedia retrieval. This paper starts with However, research has shown that database systems an in-depth investigation to the reason why tend to achieve low IPC efficiency on modern CPUs in this happens, focusing on the TPC-H bench- these application areas [6, 3]. We question whether mark. Our analysis of various relational sys- it should really be that way. Going beyond the (im- tems and MonetDB leads us to a new set of portant) topic of cache-conscious query processing, we guidelines for designing a query processor. investigate in detail how relational database systems The second part of the paper describes the interact with modern super-scalar CPUs in query- architecture of our new X100 query engine intensive workloads, in particular the TPC-H decision for the MonetDB system that follows these support benchmark. guidelines. On the surface, it resembles a The main conclusion we draw from this investiga- classical Volcano-style engine, but the cru- tion is that the architecture employed by most DBMSs cial difference to base all execution on the inhibits compilers from using their most performance- concept of vector processing makes it highly critical optimization techniques, resulting in low CPU CPU efficient.
    [Show full text]
  • Hannes Mühleisen
    Large-Scale Statistics with MonetDB and R Hannes Mühleisen DAMDID 2015, 2015-10-13 About Me • Postdoc at CWI Database architectures since 2012 • Amsterdam is nice. We have open positions. • Special interest in data management for statistical analysis • Various research & software projects in this space 2 Outline • Column Store / MonetDB Introduction • Connecting R and MonetDB • Advanced Topics • “R as a Query Language” • “Capturing The Laws of Data Nature” 3 Column Stores / MonetDB Introduction 4 Postgres, Oracle, DB2, etc.: Conceptional class speed flux NX 1 3 Constitution 1 8 Galaxy 1 3 Defiant 1 6 Intrepid 1 1 Physical (on Disk) NX 1 3 Constitution 1 8 Galaxy 1 3 Defiant 1 6 Intrepid 1 1 5 Column Store: class speed flux Compression! NX 1 3 Constitution 1 8 Galaxy 1 3 Defiant 1 6 Intrepid 1 1 NX Constitution Galaxy Defiant Intrepid 1 1 1 1 1 3 8 3 6 1 6 What is MonetDB? • Strict columnar architecture OLAP RDBMS (SQL) • Started by Martin Kersten and Peter Boncz ~1994 • Free & Open Open source, active development ongoing • www.monetdb.org Peter A. Boncz, Martin L. Kersten, and Stefan Manegold. 2008. Breaking the memory wall in MonetDB. Communications of the ACM 51, 12 (December 2008), 77-85. DOI=10.1145/1409360.1409380 7 MonetDB today • Expanded C code • MAL “DB assembly” & optimisers • SQL to MAL compiler • Memory-Mapped files • Automatic indexing 8 Some MAL • Optimisers run on MAL code • Efficient Column-at-a-time implementations EXPLAIN SELECT * FROM mtcars; | X_2 := sql.mvc(); | | X_3:bat[:oid,:oid] := sql.tid(X_2,"sys","mtcars"); | | X_6:bat[:oid,:dbl]
    [Show full text]
  • LDBC Introduction and Status Update
    8th Technical User Community meeting - LDBC Peter Boncz [email protected] ldbcouncil.org LDBC Organization (non-profit) “sponsors” + non-profit members (FORTH, STI2) & personal members + Task Forces, volunteers developing benchmarks + TUC: Technical User Community (8 workshops, ~40 graph and RDF user case studies, 18 vendor presentations) What does a benchmark consist of? • Four main elements: – data & schema: defines the structure of the data – workloads: defines the set of operations to perform – performance metrics: used to measure (quantitatively) the performance of the systems – execution & auditing rules: defined to assure that the results from different executions of the benchmark are valid and comparable • Software as Open Source (GitHub) – data generator, query drivers, validation tools, ... Audience • For developers facing graph processing tasks – recognizable scenario to compare merits of different products and technologies • For vendors of graph database technology – checklist of features and performance characteristics • For researchers, both industrial and academic – challenges in multiple choke-point areas such as graph query optimization and (distributed) graph analysis SPB scope • The scenario involves a media/ publisher organization that maintains semantic metadata about its Journalistic assets (articles, photos, videos, papers, books, etc), also called Creative Works • The Semantic Publishing Benchmark simulates: – Consumption of RDF metadata (Creative Works) – Updates of RDF metadata, related to Annotations • Aims to be
    [Show full text]
  • The Database Architectures Research Group at CWI
    The Database Architectures Research Group at CWI Martin Kersten Stefan Manegold Sjoerd Mullender CWI Amsterdam, The Netherlands fi[email protected] http://www.cwi.nl/research-groups/Database-Architectures/ 1. INTRODUCTION power provided by the early MonetDB implementa- The Database research group at CWI was estab- tions. In the years following, many technical inno- lished in 1985. It has steadily grown from two PhD vations were paired with strong industrial maturing students to a group of 17 people ultimo 2011. The of the software base. Data Distilleries became a sub- group is supported by a scientific programmer and sidiary of SPSS in 2003, which in turn was acquired a system engineer to keep our machines running. by IBM in 2009. In this short note, we look back at our past and Moving MonetDB Version 4 into the open-source highlight the multitude of topics being addressed. domain required a large number of extensions to the code base. It became of the utmost importance to support a mature implementation of the SQL- 2. THE MONETDB ANTHOLOGY 03 standard, and the bulk of application program- The workhorse and focal point for our research is ming interfaces (PHP, JDBC, Python, Perl, ODBC, MonetDB, an open-source columnar database sys- RoR). The result of this activity was the first official tem. Its development goes back as far as the early open-source release in 2004. A very strong XQuery eighties when our first relational kernel, called Troll, front-end was developed with partners and released was shipped as an open-source product. It spread to in 2005 [1].
    [Show full text]
  • Micro Adaptivity in Vectorwise
    Micro Adaptivity in Vectorwise Bogdan Raducanuˇ Peter Boncz Actian CWI [email protected] [email protected] ∗ Marcin Zukowski˙ Snowflake Computing marcin.zukowski@snowflakecomputing.com ABSTRACT re-arrange the shape of a query plan in reaction to its execu- Performance of query processing functions in a DBMS can tion so far, thereby enabling the system to correct mistakes be affected by many factors, including the hardware plat- in the cost model, or to e.g. adapt to changing selectivities, form, data distributions, predicate parameters, compilation join hit ratios or tuple arrival rates. Micro Adaptivity, intro- method, algorithmic variations and the interactions between duced here, is an orthogonal approach, taking adaptivity to these. Given that there are often different function imple- the micro level by making the low-level functions of a query mentations possible, there is a latent performance diversity executor more performance-robust. which represents both a threat to performance robustness Micro Adaptivity was conceived inside the Vectorwise sys- if ignored (as is usual now) and an opportunity to increase tem, a high performance analytical RDBMS developed by the performance if one would be able to use the best per- Actian Corp. [18]. The raw execution power of Vectorwise forming implementation in each situation. Micro Adaptivity, stems from its vectorized query executor, in which each op- proposed here, is a framework that keeps many alternative erator performs actions on vectors-at-a-time, rather than a function implementations (“flavors”) in a system. It uses a single tuple-at-a-time; where each vector is an array of (e.g.
    [Show full text]
  • Hmi + Clds = New Sdsc Center
    New Technologies for Data Management Chaitan Baru 2013 Summer Institute: Discover Big Data, August 5-9, San Diego, California SAN DIEGO SUPERCOMPUTER CENTER at the UNIVERSITY OF CALIFORNIA, SAN DIEGO 2 2 Why new technologies? • Big Data Characteristics: Volume, Velocity, Variety • Began as a Volume problem ▫ E.g. Web crawls … ▫ 1’sPB-100’sPB in a single cluster • Velocity became an issue ▫ E.g. Clickstreams at Facebook ▫ 100,000 concurrent clients ▫ 6 billion messages/day • Variety is now important ▫ Integrate, fuse data from multiple sources ▫ Synoptic view; solve complex problems 2013 Summer Institute: Discover Big Data, August 5-9, San Diego, California SAN DIEGO SUPERCOMPUTER CENTER at the UNIVERSITY OF CALIFORNIA, SAN DIEGO 3 3 Varying opinions on Big Data • “It’s all about velocity. The others issues are old problems.” • “Variety is the important characteristic.” • “Big Data is nothing new.” 2013 Summer Institute: Discover Big Data, August 5-9, San Diego, California SAN DIEGO SUPERCOMPUTER CENTER at the UNIVERSITY OF CALIFORNIA, SAN DIEGO 4 4 Expanding Enterprise Systems: From OLTP to OLAP to “Catchall” • OLTP: OnLine Transaction Processing ▫ E.g., point-of-sale terminals, e-commerce transactions, etc. ▫ High throughout; high rate of “single shot” read/write operations ▫ Large number of concurrent clients ▫ Robust, durable processing 2013 Summer Institute: Discover Big Data, August 5-9, San Diego, California SAN DIEGO SUPERCOMPUTER CENTER at the UNIVERSITY OF CALIFORNIA, SAN DIEGO 5 5 Expanding Enterprise Systems: OLAP • OLAP: Decision Support Systems requiring complex query processing ▫ Fast response times for complex SQL queries ▫ Queries over historical data ▫ Fewer number of concurrent clients ▫ Data aggregated from multiple systems Multiple business systems, e.g.
    [Show full text]
  • Columnar Storage in SQL Server 2012
    Columnar Storage in SQL Server 2012 Per-Ake Larson Eric N. Hanson Susan L. Price [email protected] [email protected] [email protected] Abstract SQL Server 2012 introduces a new index type called a column store index and new query operators that efficiently process batches of rows at a time. These two features together greatly improve the performance of typical data warehouse queries, in some cases by two orders of magnitude. This paper outlines the design of column store indexes and batch-mode processing and summarizes the key benefits this technology provides to customers. It also highlights some early customer experiences and feedback and briefly discusses future enhancements for column store indexes. 1 Introduction SQL Server is a general-purpose database system that traditionally stores data in row format. To improve performance on data warehousing queries, SQL Server 2012 adds columnar storage and efficient batch-at-a- time processing to the system. Columnar storage is exposed as a new index type: a column store index. In other words, in SQL Server 2012 an index can be stored either row-wise in a B-tree or column-wise in a column store index. SQL Server column store indexes are “pure” column stores, not a hybrid, because different columns are stored on entirely separate pages. This improves I/O performance and makes more efficient use of memory. Column store indexes are fully integrated into the system. To improve performance of typical data warehous- ing queries, all a user needs to do is build a column store index on the fact tables in the data warehouse.
    [Show full text]
  • User's Guide for Oracle Data Visualization
    Oracle® Fusion Middleware User's Guide for Oracle Data Visualization 12c (12.2.1.4.0) E91572-02 September 2020 Oracle Fusion Middleware User's Guide for Oracle Data Visualization, 12c (12.2.1.4.0) E91572-02 Copyright © 2015, 2020, Oracle and/or its affiliates. Primary Author: Hemala Vivek Contributing Authors: Nick Fry, Christine Jacobs, Rosie Harvey, Stefanie Rhone Contributors: Oracle Business Intelligence development, product management, and quality assurance teams This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish, or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this is software or related documentation that is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Government, then the following notice is applicable: U.S. GOVERNMENT END USERS: Oracle programs (including any operating system, integrated software, any programs embedded, installed or activated on delivered hardware, and modifications of such programs) and Oracle computer documentation or other Oracle data delivered to or accessed by U.S. Government end users are "commercial computer software" or "commercial computer software documentation" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental regulations.
    [Show full text]
  • (Spring 2019) :: Query Execution & Processing
    ADVANCED DATABASE SYSTEMS Query Execution & Processing @Andy_Pavlo // 15-721 // Spring 2019 Lecture #15 CMU 15-721 (Spring 2019) 2 ARCHITECTURE OVERVIEW Networking Layer SQL Query SQL Parser Planner Binder Rewriter Optimizer / Cost Models Compiler Scheduling / Placement Concurrency Control We Are Here Execution Engine Operator Execution Indexes Storage Models Storage Manager Logging / Checkpoints CMU 15-721 (Spring 2019) 3 OPERATOR EXECUTION Query Plan Processing Application Logic Execution (UDFs) Parallel Join Algorithms Vectorized Operators Query Compilation CMU 15-721 (Spring 2019) 4 QUERY EXECUTION A query plan is comprised of operators. An operator instance is an invocation of an operator on some segment of data. A task is the execution of a sequence of one or more operator instances. CMU 15-721 (Spring 2019) 5 EXECUTION OPTIMIZATION We are now going to start discussing ways to improve the DBMS's query execution performance for data sets that fit entirely in memory. There are other bottlenecks to target when we remove the disk. CMU 15-721 (Spring 2019) 6 OPTIMIZATION GOALS Approach #1: Reduce Instruction Count → Use fewer instructions to do the same amount of work. Approach #2: Reduce Cycles per Instruction → Execute more CPU instructions in fewer cycles. → This means reducing cache misses and stalls due to memory load/stores. Approach #3: Parallelize Execution → Use multiple threads to compute each query in parallel. CMU 15-721 (Spring 2019) 7 MonetDB/X100 Analysis Processing Models Parallel Execution CMU 15-721 (Spring 2019) 8 MONETDB/X100 Low-level analysis of execution bottlenecks for in- memory DBMSs on OLAP workloads. → Show how DBMS are designed incorrectly for modern CPU architectures.
    [Show full text]
  • Prototype and Deployment of a Big Data Analytics Platform
    Prototype and Deployment of a Big Data Analytics Platform CTT2.0 Carbon Track and Trace Deliverable D3.1 Atle Vesterkjær, Patrick Merlot (Numascale) Oslo, Norway| 14 December 2016 climate-kic.org Contents Preface ................................................................................................................................................................. 2 Requirement Analysis ........................................................................................................................................ 3 Previous E2E Analytics IoT platform ....................................................................................................................... 3 CTT Analytics IoT platform ......................................................................................................................................... 5 State of the art technology overview ..................................................................................................................... 6 Adaption of standard and develop-ment of custom components ............................................................. 7 Standard components ................................................................................................................................................. 7 Custom components .................................................................................................................................................... 9 Deployment of the platform ............................................................................................................................
    [Show full text]
  • DBMS Data Loading: an Analysis on Modern Hardware
    DBMS Data Loading: An Analysis on Modern Hardware Adam Dziedzic1?, Manos Karpathiotakis2, Ioannis Alagiannis2, Raja Appuswamy2, and Anastasia Ailamaki2,3 1 University of Chicago [email protected] 2 Ecole Polytechnique Fed´ erale´ de Lausanne (EPFL) [email protected] 3 RAW Labs SA Abstract. Data loading has traditionally been considered a “one-time deal” – an offline process out of the critical path of query execution. The architecture of DBMS is aligned with this assumption. Nevertheless, the rate in which data is produced and gathered nowadays has nullified the “one-off” assumption, and has turned data loading into a major bottleneck of the data analysis pipeline. This paper analyzes the behavior of modern DBMS in order to quantify their ability to fully exploit multicore processors and modern storage hardware during data loading. We examine multiple state-of-the-art DBMS, a variety of hardware configurations, and a combination of synthetic and real-world datasets to iden- tify bottlenecks in the data loading process and to provide guidelines on how to accelerate data loading. Our findings show that modern DBMS are unable to saturate the available hardware resources. We therefore identify opportunities to accelerate data loading. 1 Introduction Applications both from the scientific and business worlds accumulate data at an increas- ingly rapid pace. Natural science experiments produce unprecedented amounts of data. Similarly, companies aggressively collect data to optimize business strategy. The recent advances in cost-effective storage hardware enable storing the produced data, but the ability to organize and process this data has been unable to keep pace with data growth.
    [Show full text]
  • Accelerating Database Queries for Advanced Data Analytics Hanfeng Chen, Joseph V
    Short Paper HorsePower: Accelerating Database Queries for Advanced Data Analytics Hanfeng Chen, Joseph V. D’silva, Laurie Hendren, Bettina Kemme McGill University [email protected],[email protected],[email protected],[email protected] ABSTRACT database columns, HorseIR follows conceptually the data The rising popularity of data science has resulted in a chal- model of column-based DBS, which has been proven to be lenging interplay between traditional declarative queries effective for data analytics tasks. and numerical computations on the data. In this paper, we HorsePower extends the idea to a full-fledged execution present and evaluate the advanced analytical system Horse- environment for data analytics. Additionally to support- Power that is able to combine and optimize both program- ing plain SQL queries, HorsePower also supports functions ming styles in a holistic manner. It can execute traditional written in MATLAB, a popular high-level array language SQL-based database queries, programs written in the statis- widely used in the field of statistics and engineering. Horse- tical language MATLAB, as well as a mix of both by support- Power can take stand-alone functions written in MATLAB ing user-defined functions within database queries. Horse- and translate them to HorseIR, of have these functions be Power exploits HorseIR, an array-based intermediate rep- embedded in SQL queries and then translate all into a sin- resentation (IR), to which source programs are translated, gle HorseIR program, before optimizing and compiling the allowing to combine query optimization and compiler opti- code in a holistic manner. mization techniques at an intermediate level of abstraction.
    [Show full text]