Unidata SQL Commands Reference the Above Trademarks Are Property of the Specified Companies in the United States, Other Countries, Or Both

Total Page:16

File Type:pdf, Size:1020Kb

Load more

C:\Program Files\Adobe\FrameMaker8\UniData 7.2\7.2rebranded\SQLREF\SQLRTITL.fm March 9, 2010 1:05 pm Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta UniData SQL Commands Reference UDT-720-SQLR-1 C:\Program Files\Adobe\FrameMaker8\UniData 7.2\7.2rebranded\SQLREF\SQLRTITL.fm March 9, 2010 1:05 pm Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Notices Edition Publication date: July 2008 Book number: UDT-720-SQLR-1 Product version: UniData 7.2 Copyright © Rocket Software, Inc. 1988-2008. All Rights Reserved. Trademarks The following trademarks appear in this publication: Trademark Trademark Owner Rocket Software™ Rocket Software, Inc. Dynamic Connect® Rocket Software, Inc. RedBack® Rocket Software, Inc. SystemBuilder™ Rocket Software, Inc. UniData® Rocket Software, Inc. UniVerse™ Rocket Software, Inc. U2™ Rocket Software, Inc. U2.NET™ Rocket Software, Inc. U2 Web Development Environment™ Rocket Software, Inc. wIntegrate® Rocket Software, Inc. Microsoft® .NET Microsoft Corporation Microsoft® Office Excel®, Outlook®, Word Microsoft Corporation Windows® Microsoft Corporation Windows® 7 Microsoft Corporation Windows Vista® Microsoft Corporation Java™ and all Java-based trademarks and logos Sun Microsystems, Inc. UNIX® X/Open Company Limited ii UniData SQL Commands Reference The above trademarks are property of the specified companies in the United States, other countries, or both. All other products or services mentioned in this document may be covered by the trademarks, service marks, or product names as designated by the companies who own or market them. License agreement This software and the associated documentation are proprietary and confidential to Rocket Software, Inc., are furnished under license, and may be used and copied only in accordance with the terms of such license and with the inclusion of the copyright notice. This software and any copies thereof may not be provided or otherwise made available to any other person. No title to or ownership of the software and associated documentation is hereby transferred. Any unauthorized use or reproduction of this software or documentation may be subject to civil or criminal liability. The information in the software and documentation is subject to change and should not be construed as a commitment by Rocket Software, Inc. Restricted rights notice for license to the U.S. Government: Use, reproduction, or disclosure is subject to restrictions as stated in the “Rights in Technical Data- General” clause (alternate III), in FAR section 52.222-14. All title and ownership in this computer software remain with Rocket Software, Inc. Note This product may contain encryption technology. Many countries prohibit or restrict the use, import, or export of encryption technologies, and current use, import, and export regulations should be followed when exporting this product. Please be aware: Any images or indications reflecting ownership or branding of the product(s) documented herein may or may not reflect the current legal ownership of the intellectual property rights associated with such product(s). All right and title to the product(s) documented herein belong solely to Rocket Software, Inc. and its subsidiaries, notwithstanding any notices (including screen captures) or any other indications to the contrary. Contact information Rocket Software 275 Grove Street Suite 3-410 Newton, MA 02466-2272 USA Tel: (617) 614-4321 Fax: (617) 630-7100 Web Site: www.rocketsoftware.com UniData SQL Commands Reference iii Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Beta Table of Contents Table of Contents Chapter 1 UniData SQL Commands Commands Summary . 1-3 UniData SQL Limitations . 1-7 ALTER TABLE . 1-8 AUTO COMMIT . 1-13 BREAK . 1-15 BTITLE . 1-18 CLEAR . 1-25 COLUMN . 1-26 COMMIT . 1-31 COMO . 1-33 COMPUTE . 1-36 CREATE INDEX . 1-40 CREATE SUBTABLE . 1-42 CREATE TABLE . 1-51 CREATE VIEW . 1-57 DELETE . 1-60 DROP INDEX . 1-63 DROP SUBTABLE . 1-64 DROP TABLE . 1-65 DROP VIEW . 1-67 EXIT . 1-69 GRANT . 1-70 INSERT . 1-73 LISTDICT . 1-77 LOCK TABLE . 1-78 QUIT . 1-80 REVOKE . 1-81 ROLLBACK . 1-83 SELECT . 1-84 SET . 1-102 SHOW . 1-113 :\Program Files\Adobe\FrameMaker8\UniData 7.2\7.2rebranded\SQLREF\SQLRTOC.fm (bookTOC.template) March 9 2010 1:05 pm SQL . 1-115 TTITLE . 1-116 UPDATE . 1-123 Adding Multivalues and Multi-Subvalues . 1-125 Examples . 1-127 Appendix A Defining Attributes Default Format and Conversion Codes . A-2 Attribute Name . A-3 Data Type. A-4 CHAR . A-4 DATE . A-5 NUMBER . A-5 LONG . A-6 Virtual Attributes (IDESC or VIRTUAL) . A-10 Location (LOC) . A-11 Display Name (DISP) . A-12 FORMAT. A-13 Value Code Specification . A-15 SM . A-15 Associating Attributes . A-16 Appendix B Unnesting Attributes Unnesting Associated Attributes . B-2 Sample Table for Unnesting Examples . B-2 Unnesting Associated Multivalued Attributes . B-4 Unnesting Associated Multi-Subvalued Attributes . B-5 Unnesting All Attributes in an Association. B-6 Unnesting Unassociated Attributes . B-8 Appendix C Creating Subtables Base Tables . C-2 T_CLIENTS . C-3 T_INVENTORY . C-4 T_ORDERS . C-5 CREATE SUBTABLE Examples . C-7 T_CLIENTS NL0 Subtables . C-7 T_CLIENTS NL1 Subtables . C-8 T_INVENTORY NL0 Subtable . C-9 T_INVENTORY NL1 Subtables . C-9 Table of Contents v T_ORDERS NL0 Subtables . C-13 T_ORDERS NL1 Subtables . C-14 T_ORDERS NL2 Subtables . C-18 Appendix D Arithmetic Functions and Operators Arithmetic Functions. D-2 Arithmetic Operators. D-3 vi UniData SQL Commands Reference UniData SQL Commands This chapter provides complete descriptions of all commands in the UniData imple- mentation of Structured Query Language (SQL). UniData SQL commands can be entered from the sql prompt or by encoding a series of SQL statements in an ASCII text file (UniData SQL script) with your system editor. You can then execute the script from the operating system prompt. This provides the capability of reusing a series of UniData SQL statements. 1-1 Elements of Syntax Statements This reference manual uses a common method for stating syntax for UniData commands. The syntax statement includes the command name, required arguments, and options that you can use with the command. Italics represents a variable that you can replace with any valid option. The following figure illustrates the elements of a syntax statement. command names square brackets indicate appear in boldface an optional argument no brackets or braces a vertical line indicates that indicates a required you may choose between argument the given arguments COMMAND required [option] [option1 | option2] {option1 | option2} required... "string" quotation marks must enclose a literal string braces indicate that you an ellipsis indicates that must choose between you may enter more than the given arguments one argument 1-2 UniData SQL Commands Reference Elements of UniData SQL Commands Summary Data Definition Language (DDL) Data definition language is also called “schema definition.” It uses table, indexing, view, and subtable commands. Table Commands: CREATE TABLE ALTER TABLE DROP TABLE Indexing Commands: CREATE INDEX DROP INDEX View Commands: CREATE VIEW DROP VIEW Subtable Commands: CREATE SUBTABLE DROP SUBTABLE Data Control Language (DCL) Data control language is also called “connection management.” It uses privilege and transaction processing commands. 1-3 Privilege Commands: GRANT REVOKE Transaction Processing Commands: AUTO COMMIT COMMIT ROLLBACK LOCK TABLE SET DISPLAY SET TRANSACTION Data Manipulation Language (DML) INSERT SELECT UPDATE DELETE Report Commands (RPT) TTITLE BTITLE COLUMN COMPUTE BREAK CLEAR SET SHOW Supplementary Commands (SUP) SQL 1-4 UniData SQL Commands Reference EXIT QUIT LISTDICT COMO 1-5 SELECT Statement Elements * ALL DISTINCT attributes functions expressions literals FROM UNNEST NL1, NL2, NL_ALL WHERE =, !=, <, <=, >, >=, <>, !<, !> EVERY subquery NOT IS [NOT] NULL [NOT] BETWEEN [NOT] IN [NOT] INTERSECT [NOT] LIKE %, _, ..., nA, nN, nX GROUP BY HAVING UNION ORDER BY TO INTO LPTR 1-6 UniData SQL Commands Reference UniData SQL Limitations In a SELECT statement, you cannot select more than 1000 attributes. All identifiers in UniData SQL, such as table_name, view_name, attribute_name, table_label, and all variables in OLD/NEW_VALUE of the COLUMN statement can be no longer than 30 characters. A UniData SQL statement cannot exceed 49 lines. The length of a single line of a UniData SQL statement, when used interactively, cannot exceed 272 characters. A single association cannot exceed 64 attributes. A table can contain a maximum of 12 associations. SELECT statement or clause cannot contain more than 255 virtual attributes. The IN predicate cannot contain more than five operators. Each operator must be a constant. The length of each constant cannot exceed 95 characters. Within a WHERE clause, the total number of predicates and Boolean operators cannot exceed 255. The ORDER BY clause can contain no more than nine elements (attribute names, expressions, and ordinal positions). The number of tables in the FROM clause of a SELECT statement is limited to 16. However, when performing a join, a new temporary table is created internally for every two joined tables in the FROM clause. Therefore, a join can contain no more than eight join tables, whereas a nested subquery with exactly one table at every level may contain up to 16 levels. The UNNEST clause can process 10,240 values in a multivalued or multi-subvalued attribute, or in all associations
Recommended publications
  • Select Items from Proc.Sql Where Items&gt;Basics

    Select Items from Proc.Sql Where Items>Basics

    Advanced Tutorials SELECT ITEMS FROM PROC.SQL WHERE ITEMS> BASICS Alan Dickson & Ray Pass ASG. Inc. to get more SAS sort-space. Also, it may be possible to limit For those of you who have become extremely the total size of the resulting extract set by doing as much of comfortable and competent in the DATA step, getting into the joining/merging as close to the raw data as possible. PROC SQL in a big wrJ may not initially seem worth it Your first exposure may have been through a training class. a 3) Communications. SQL is becoming a lingua Tutorial at a conference, or a real-world "had-to" situation, franca of data processing, and this trend is likely to continue such as needing to read corporate data stored in DB2, or for some time. You may find it easier to deal with your another relational database. So, perhaps it is just another tool systems department, vendors etc., who may not know SAS at in your PROC-kit for working with SAS datasets, or maybe all, ifyou can explain yourself in SQL tenus. it's your primary interface with another environment 4) Career growth. Not unrelated to the above - Whatever the case, your first experiences usually there's a demand for people who can really understand SQL. involve only the basic CREATE TABLE, SELECT, FROM, Its apparent simplicity is deceiving. On the one hand, you can WHERE, GROUP BY, ORDER BY options. Thus, the do an incredible amount with very little code - on the other, tendency is frequently to treat it as no more than a data extract you can readily generate plausible, but inaccurate, results with tool.
  • Database Foundations 6-8 Sorting Data Using ORDER BY

    Database Foundations 6-8 Sorting Data Using ORDER BY

    Database Foundations 6-8 Sorting Data Using ORDER BY Copyright © 2015, Oracle and/or its affiliates. All rights reserved. Roadmap Data Transaction Introduction to Structured Data Definition Manipulation Control Oracle Query Language Language Language (TCL) Application Language (DDL) (DML) Express (SQL) Restricting Sorting Data Joining Tables Retrieving Data Using Using ORDER Using JOINS Data Using WHERE BY SELECT You are here DFo 6-8 Copyright © 2015, Oracle and/or its affiliates. All rights reserved. 3 Sorting Data Using ORDER BY Objectives This lesson covers the following objectives: • Use the ORDER BY clause to sort SQL query results • Identify the correct placement of the ORDER BY clause within a SELECT statement • Order data and limit row output by using the SQL row_limiting_clause • Use substitution variables in the ORDER BY clause DFo 6-8 Copyright © 2015, Oracle and/or its affiliates. All rights reserved. 4 Sorting Data Using ORDER BY Using the ORDER BY Clause • Sort the retrieved rows with the ORDER BY clause: – ASC: Ascending order (default) – DESC: Descending order • The ORDER BY clause comes last in the SELECT statement: SELECT last_name, job_id, department_id, hire_date FROM employees ORDER BY hire_date ; DFo 6-8 Copyright © 2015, Oracle and/or its affiliates. All rights reserved. 5 Sorting Data Using ORDER BY Sorting • Sorting in descending order: SELECT last_name, job_id, department_id, hire_date FROM employees 1 ORDER BY hire_date DESC ; • Sorting by column alias: SELECT employee_id, last_name, salary*12 annsal 2 FROM employees ORDER BY annsal ; DFo 6-8 Copyright © 2015, Oracle and/or its affiliates. All rights reserved. 6 Sorting Data Using ORDER BY Sorting • Sorting by using the column's numeric position: SELECT last_name, job_id, department_id, hire_date FROM employees 3 ORDER BY 3; • Sorting by multiple columns: SELECT last_name, department_id, salary FROM employees 4 ORDER BY department_id, salary DESC; DFo 6-8 Copyright © 2015, Oracle and/or its affiliates.
  • How Mysql Handles ORDER BY, GROUP BY, and DISTINCT

    How Mysql Handles ORDER BY, GROUP BY, and DISTINCT

    How MySQL handles ORDER BY, GROUP BY, and DISTINCT Sergey Petrunia, [email protected] MySQL University Session November 1, 2007 Copyright 2007 MySQL AB The World’s Most Popular Open Source Database 1 Handling ORDER BY • Available means to produce ordered streams: – Use an ordered index • range access – not with MyISAM/InnoDB's DS-MRR – not with Falcon – Has extra (invisible) cost with NDB • ref access (but not ref-or-null) results of ref(t.keypart1=const) are ordered by t.keypart2, t.keypart3, ... • index access – Use filesort Copyright 2007 MySQL AB The World’s Most Popular Open Source Database 2 Executing join and producing ordered stream There are three ways to produce ordered join output Method EXPLAIN shows Use an ordered index Nothing particular Use filesort() on 1st non-constant table “Using filesort” in the first row Put join result into a temporary table “Using temporary; Using filesort” in the and use filesort() on it first row EXPLAIN is a bit counterintuitive: id select_type table type possible_keys key key_len ref rows Extra Using where; 1 SIMPLE t2 range a a 5 NULL 10 Using temporary; Using filesort 1 SIMPLE t2a ref a a 5 t2.b 1 Using where Copyright 2007 MySQL AB The World’s Most Popular Open Source Database 3 Using index to produce ordered join result • ORDER BY must use columns from one index • DESC is ok if it is present for all columns • Equality propagation: – “a=b AND b=const” is detected – “WHERE x=t.key ORDER BY x” is not • Cannot use join buffering – Use of matching join order disables use of join buffering.
  • Database SQL Call Level Interface 7.1

    Database SQL Call Level Interface 7.1

    IBM IBM i Database SQL call level interface 7.1 IBM IBM i Database SQL call level interface 7.1 Note Before using this information and the product it supports, read the information in “Notices,” on page 321. This edition applies to IBM i 7.1 (product number 5770-SS1) and to all subsequent releases and modifications until otherwise indicated in new editions. This version does not run on all reduced instruction set computer (RISC) models nor does it run on CISC models. © Copyright IBM Corporation 1999, 2010. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents SQL call level interface ........ 1 SQLExecute - Execute a statement ..... 103 What's new for IBM i 7.1 .......... 1 SQLExtendedFetch - Fetch array of rows ... 105 PDF file for SQL call level interface ....... 1 SQLFetch - Fetch next row ........ 107 Getting started with DB2 for i CLI ....... 2 SQLFetchScroll - Fetch from a scrollable cursor 113 | Differences between DB2 for i CLI and embedded SQLForeignKeys - Get the list of foreign key | SQL ................ 2 columns .............. 115 Advantages of using DB2 for i CLI instead of SQLFreeConnect - Free connection handle ... 120 embedded SQL ............ 5 SQLFreeEnv - Free environment handle ... 121 Deciding between DB2 for i CLI, dynamic SQL, SQLFreeHandle - Free a handle ...... 122 and static SQL ............. 6 SQLFreeStmt - Free (or reset) a statement handle 123 Writing a DB2 for i CLI application ....... 6 SQLGetCol - Retrieve one column of a row of Initialization and termination tasks in a DB2 for i the result set ............ 125 CLI application ............ 7 SQLGetConnectAttr - Get the value of a Transaction processing task in a DB2 for i CLI connection attribute .........
  • Firebird 3 Windowing Functions

    Firebird 3 Windowing Functions

    Firebird 3 Windowing Functions Firebird 3 Windowing Functions Author: Philippe Makowski IBPhoenix Email: pmakowski@ibphoenix Licence: Public Documentation License Date: 2011-11-22 Philippe Makowski - IBPhoenix - 2011-11-22 Firebird 3 Windowing Functions What are Windowing Functions? • Similar to classical aggregates but does more! • Provides access to set of rows from the current row • Introduced SQL:2003 and more detail in SQL:2008 • Supported by PostgreSQL, Oracle, SQL Server, Sybase and DB2 • Used in OLAP mainly but also useful in OLTP • Analysis and reporting by rankings, cumulative aggregates Philippe Makowski - IBPhoenix - 2011-11-22 Firebird 3 Windowing Functions Windowed Table Functions • Windowed table function • operates on a window of a table • returns a value for every row in that window • the value is calculated by taking into consideration values from the set of rows in that window • 8 new windowed table functions • In addition, old aggregate functions can also be used as windowed table functions • Allows calculation of moving and cumulative aggregate values. Philippe Makowski - IBPhoenix - 2011-11-22 Firebird 3 Windowing Functions A Window • Represents set of rows that is used to compute additionnal attributes • Based on three main concepts • partition • specified by PARTITION BY clause in OVER() • Allows to subdivide the table, much like GROUP BY clause • Without a PARTITION BY clause, the whole table is in a single partition • order • defines an order with a partition • may contain multiple order items • Each item includes
  • Aggregate Order by Clause

    Aggregate Order by Clause

    Aggregate Order By Clause Dialectal Bud elucidated Tuesdays. Nealy vulgarizes his jockos resell unplausibly or instantly after Clarke hurrah and court-martial stalwartly, stanchable and jellied. Invertebrate and cannabic Benji often minstrels some relator some or reactivates needfully. The default order is ascending. Have exactly match this assigned stream aggregate functions, not work around with security software development platform on a calculation. We use cookies to ensure that we give you the best experience on our website. Result output occurs within the minimum time interval of timer resolution. It is not counted using a table as i have group as a query is faster count of getting your browser. Let us explore it further in the next section. If red is enabled, when business volume where data the sort reaches the specified number of bytes, the collected data is sorted and dumped into these temporary file. Kris has written hundreds of blog articles and many online courses. Divides the result set clock the complain of groups specified as an argument to the function. Threat and leaves only return data by order specified, a human agents. However, this method may not scale useful in situations where thousands of concurrent transactions are initiating updates to derive same data table. Did you need not performed using? If blue could step me first what is vexing you, anyone can try to explain it part. It returns all employees to database, and produces no statements require complex string manipulation and. Solve all tasks to sort to happen next lesson. Execute every following query access GROUP BY union to calculate these values.
  • Hive Where Clause Example

    Hive Where Clause Example

    Hive Where Clause Example Bell-bottomed Christie engorged that mantids reattributes inaccessibly and recrystallize vociferously. Plethoric and seamier Addie still doth his argents insultingly. Rubescent Antin jibbed, his somnolency razzes repackages insupportably. Pruning occurs directly with where and limit clause to store data question and column must match. The ideal for column, sum of elements, the other than hive commands are hive example the terminator for nonpartitioned external source table? Cli to hive where clause used to pick tables and having a column qualifier. For use of hive sql, so the source table csv_table in most robust results yourself and populated using. If the bucket of the sampling is created in this command. We want to talk about which it? Sql statements are not every data, we should run in big data structures the. Try substituting synonyms for full name. Currently the where at query, urban private key value then prints the where hive table? Hive would like the partitioning is why the. In hive example hive data types. For the data, depending on hive will also be present in applying the example hive also widely used. The electrician are very similar to avoid reading this way, then one virtual column values in data aggregation functionalities provided below is sent to be expressed. Spark column values. In where clause will print the example when you a script for example, it will be spelled out of subquery must produce such hash bucket level of. After copy and collect_list instead of the same type is only needs to calculate approximately percentiles for sorting phase in keyword is expected schema.
  • SQL from Wikipedia, the Free Encyclopedia Jump To: Navigation

    SQL from Wikipedia, the Free Encyclopedia Jump To: Navigation

    SQL From Wikipedia, the free encyclopedia Jump to: navigation, search This article is about the database language. For the airport with IATA code SQL, see San Carlos Airport. SQL Paradigm Multi-paradigm Appeared in 1974 Designed by Donald D. Chamberlin Raymond F. Boyce Developer IBM Stable release SQL:2008 (2008) Typing discipline Static, strong Major implementations Many Dialects SQL-86, SQL-89, SQL-92, SQL:1999, SQL:2003, SQL:2008 Influenced by Datalog Influenced Agena, CQL, LINQ, Windows PowerShell OS Cross-platform SQL (officially pronounced /ˌɛskjuːˈɛl/ like "S-Q-L" but is often pronounced / ˈsiːkwəl/ like "Sequel"),[1] often referred to as Structured Query Language,[2] [3] is a database computer language designed for managing data in relational database management systems (RDBMS), and originally based upon relational algebra. Its scope includes data insert, query, update and delete, schema creation and modification, and data access control. SQL was one of the first languages for Edgar F. Codd's relational model in his influential 1970 paper, "A Relational Model of Data for Large Shared Data Banks"[4] and became the most widely used language for relational databases.[2][5] Contents [hide] * 1 History * 2 Language elements o 2.1 Queries + 2.1.1 Null and three-valued logic (3VL) o 2.2 Data manipulation o 2.3 Transaction controls o 2.4 Data definition o 2.5 Data types + 2.5.1 Character strings + 2.5.2 Bit strings + 2.5.3 Numbers + 2.5.4 Date and time o 2.6 Data control o 2.7 Procedural extensions * 3 Criticisms of SQL o 3.1 Cross-vendor portability * 4 Standardization o 4.1 Standard structure * 5 Alternatives to SQL * 6 See also * 7 References * 8 External links [edit] History SQL was developed at IBM by Donald D.
  • Relational Calculus Introduction • Contrived by Edgar F

    Relational Calculus Introduction • Contrived by Edgar F

    Starting with SQL Server and Azure SQL Database Module 5: Introducing the relational model Lessons • Introduction to the relational model • Domains • Relational operators • Relational algebra • Relational calculus Introduction • Contrived by Edgar F. Codd, IBM, 1969 • Background independent • A simple, yet rigorously defined concept of how users perceive data – The relational model represents data in the form of two- dimension tables, i.e. relations – Each table represents some real-world entity (person, place, thing, or event) about which information is collected – Information principle: all information is stored in relations A Logical Point of View • A relational database is a collection of tables – The organization of data into relational tables is known as the logical view of the database – The way the database software physically stores the data on a computer disk system is called the internal view – The internal view differs from product to product – Interchangeability principle: a physical relation can always be replaced by a virtual one (e.g., a view can replace a table) Tuples • A tuple is a set of ordered triples of attributes – A triple consists of attribute name, attribute type and attribute value – Every attribute of a tuple contains exactly one value of appropriate type – The order of the attributes is insignificant • Every attribute must have unique name – A subset of attributes of tuple is a tuple Relations • A relation is a variable consisting of a set of tuples – The order of the attributes is insignificant – Every attribute
  • SQL to Hive Cheat Sheet

    SQL to Hive Cheat Sheet

    We Do Hadoop Contents Cheat Sheet 1 Additional Resources 2 Query, Metadata Hive for SQL Users 3 Current SQL Compatibility, Command Line, Hive Shell If you’re already a SQL user then working with Hadoop may be a little easier than you think, thanks to Apache Hive. Apache Hive is data warehouse infrastructure built on top of Apache™ Hadoop® for providing data summarization, ad hoc query, and analysis of large datasets. It provides a mechanism to project structure onto the data in Hadoop and to query that data using a SQL-like language called HiveQL (HQL). Use this handy cheat sheet (based on this original MySQL cheat sheet) to get going with Hive and Hadoop. Additional Resources Learn to become fluent in Apache Hive with the Hive Language Manual: https://cwiki.apache.org/confluence/display/Hive/LanguageManual Get in the Hortonworks Sandbox and try out Hadoop with interactive tutorials: http://hortonworks.com/sandbox Register today for Apache Hadoop Training and Certification at Hortonworks University: http://hortonworks.com/training Twitter: twitter.com/hortonworks Facebook: facebook.com/hortonworks International: 1.408.916.4121 www.hortonworks.com We Do Hadoop Query Function MySQL HiveQL Retrieving information SELECT from_columns FROM table WHERE conditions; SELECT from_columns FROM table WHERE conditions; All values SELECT * FROM table; SELECT * FROM table; Some values SELECT * FROM table WHERE rec_name = “value”; SELECT * FROM table WHERE rec_name = "value"; Multiple criteria SELECT * FROM table WHERE rec1=”value1” AND SELECT * FROM
  • Going OVER and Above with SQL

    Going OVER and Above with SQL

    Going OVER and Above with SQL Tamar E. Granor Tomorrow's Solutions, LLC Voice: 215-635-1958 Email: [email protected] The SQL 2003 standard introduced the OVER keyword that lets you apply a function to a set of records. Introduced in SQL Server 2005, this capability was extended in SQL Server 2012. The functions allow you to rank records, aggregate them in a variety of ways, put data from multiple records into a single result record, and compute and use percentiles. The set of problems they solve range from removing exact duplicates to computing running totals and moving averages to comparing data from different periods to removing outliers. In this session, we'll look at the OVER operator and the many functions you can use with it. We'll look at a variety of problems that can be solved using OVER. Going OVER and Above with SQL Over the last couple of years, I’ve been exploring aspects of SQL Server’s T-SQL implementation that aren’t included in VFP’s SQL sub-language. I first noticed the OVER keyword as an easy way to solve a problem that’s fairly complex with VFP’s SQL, getting the top N records in each of a set of groups with a single query. At the time, I noticed that OVER had other uses, but I didn’t stop to explore them. When I finally returned to see what else OVER could do, I was blown away. In recent versions of SQL Server (2012 and later), OVER provides ways to compute running totals and moving averages, to put data from several records of the same table into a single result record, to divide records into percentile groups and more.
  • Efficient Processing of Window Functions in Analytical SQL Queries

    Efficient Processing of Window Functions in Analytical SQL Queries

    Efficient Processing of Window Functions in Analytical SQL Queries Viktor Leis Kan Kundhikanjana Technische Universitat¨ Munchen¨ Technische Universitat¨ Munchen¨ [email protected] [email protected] Alfons Kemper Thomas Neumann Technische Universitat¨ Munchen¨ Technische Universitat¨ Munchen¨ [email protected] [email protected] ABSTRACT select location, time, value, abs(value- (avg(value) over w))/(stddev(value) over w) Window functions, also known as analytic OLAP functions, have from measurement been part of the SQL standard for more than a decade and are now a window w as ( widely-used feature. Window functions allow to elegantly express partition by location many useful query types including time series analysis, ranking, order by time percentiles, moving averages, and cumulative sums. Formulating range between 5 preceding and 5 following) such queries in plain SQL-92 is usually both cumbersome and in- efficient. The query normalizes each measurement by subtracting the aver- Despite being supported by all major database systems, there age and dividing by the standard deviation. Both aggregates are have been few publications that describe how to implement an effi- computed over a window of 5 time units around the time of the cient relational window operator. This work aims at filling this gap measurement and at the same location. Without window functions, by presenting an efficient and general algorithm for the window it is possible to state the query as follows: operator. Our algorithm is optimized for high-performance main- memory database systems and has excellent performance on mod- select location, time, value, abs(value- ern multi-core CPUs. We show how to fully parallelize all phases (select avg(value) of the operator in order to effectively scale for arbitrary input dis- from measurement m2 tributions.