modern sql
play

Modern SQL: Evolution of a dinosaur Markus Winand Krakw, 9-11 May - PowerPoint PPT Presentation

Dec 30, 2023 •126 likes •1.33k views

Modern SQL: Evolution of a dinosaur Markus Winand Krakw, 9-11 May 2018 Still using Windows 3.1? So why stick with SQL-92? @ModernSQL - https://modern-sql.com/ @MarkusWinand SQL:1999 WITH (Common Table Expressions) WITH (non-recursive)

  1. OVER (PARTITION BY) The Problem Two distinct concepts could not be used independently: ‣ Merge rows with the same key properties ‣ GROUP BY to specify key properties ‣ DISTINCT to use full row as key ‣ Aggregate data from related rows ‣ Requires GROUP BY to segregate the rows ‣ COUNT , SUM , AVG , MIN , MAX to aggregate grouped rows

  2. OVER (PARTITION BY) The Problem No ⇠ Aggregate ⇢ Yes SELECT c1 SELECT c1 Yes ⇠ Merge rows ⇢ No , c2 , c2 FROM t FROM t SELECT DISTINCT SELECT c1 SELECT c1 c1 , SUM (c2) tot , SUM (c2) tot , c2 FROM t FROM t FROM t GROUP BY c1 GROUP BY c1

  3. OVER (PARTITION BY) The Problem No ⇠ Aggregate ⇢ Yes SELECT c1 SELECT c1 Yes ⇠ Merge rows ⇢ No , tot , c2 , c2 FROM t FROM t SELECT c1 JOIN ( ) ta , SUM (c2) tot FROM t GROUP BY c1 ON (t.c1=ta.c1) SELECT DISTINCT SELECT c1 c1 , SUM (c2) tot , c2 FROM t FROM t GROUP BY c1

  4. OVER (PARTITION BY) The Problem No ⇠ Aggregate ⇢ Yes SELECT c1 SELECT c1 Yes ⇠ Merge rows ⇢ No , tot , c2 , c2 FROM t FROM t SELECT c1 JOIN ( ) ta , SUM (c2) tot FROM t GROUP BY c1 ON (t.c1=ta.c1) SELECT DISTINCT SELECT c1 c1 , SUM (c2) tot , c2 FROM t FROM t GROUP BY c1

  5. OVER (PARTITION BY) Since SQL:2003 No ⇠ Aggregate ⇢ Yes SELECT c1 SELECT c1 Yes ⇠ Merge rows ⇢ No , c2 , c2 FROM t FROM t , SUM(c2) OVER (PARTITION BY c1) FROM t SELECT DISTINCT SELECT c1 c1 , SUM (c2) tot , c2 FROM t FROM t GROUP BY c1

  6. OVER (PARTITION BY) How it works dep salary ts SELECT dep, 1 1000 6000 salary, 22 1000 6000 SUM(salary) 22 1000 6000 OVER() 333 1000 6000 FROM emp 333 1000 6000 333 1000 6000

  7. OVER (PARTITION BY) How it works dep salary ts SELECT dep, 1 1000 6000 salary, 22 1000 6000 SUM(salary) 22 1000 6000 OVER() 333 1000 6000 FROM emp 333 1000 6000 333 1000 6000

  8. OVER (PARTITION BY) How it works dep salary ts SELECT dep, 1 1000 6000 salary, 22 1000 6000 SUM(salary) 22 1000 6000 OVER() 333 1000 6000 FROM emp 333 1000 6000 333 1000 6000

  9. OVER (PARTITION BY) How it works dep salary ts SELECT dep, 1 1000 6000 salary, 22 1000 6000 SUM(salary) 22 1000 6000 OVER() 333 1000 6000 FROM emp 333 1000 6000 333 1000 6000

  10. OVER (PARTITION BY) How it works dep salary ts SELECT dep, 1 1000 6000 salary, 22 1000 6000 SUM(salary) 22 1000 6000 OVER() 333 1000 6000 FROM emp 333 1000 6000 333 1000 6000

  11. OVER (PARTITION BY) How it works dep salary ts SELECT dep, 1 1000 1000 salary, 22 1000 2000 SUM(salary) 22 1000 2000 OVER() PARTITION BY dep ) 333 1000 3000 FROM emp 333 1000 3000 333 1000 3000

  12. OVER and ORDER BY (Framing & Ranking)

  13. OVER (ORDER BY) The Problem acnt id value balance SELECT id, 1 1 +10 +10 value, FROM transactions t 22 2 +20 +30 22 3 -10 +20 333 4 +50 +70 333 5 -30 +40 333 6 -20 +20

  14. OVER (ORDER BY) The Problem acnt id value balance SELECT id, 1 1 +10 +10 value, (SELECT SUM(value) 22 2 +20 +30 FROM transactions t2 22 3 -10 +20 WHERE t2.id <= t.id) 333 4 +50 +70 FROM transactions t 333 5 -30 +40 333 6 -20 +20

  15. OVER (ORDER BY) The Problem acnt id value balance SELECT id, 1 1 +10 +10 value, (SELECT SUM(value) 22 2 +20 +30 FROM transactions t2 22 3 -10 +20 WHERE t2.id <= t.id) 333 4 +50 +70 FROM transactions t 333 5 -30 +40 Range segregation (<=) 
 not possible with 
 333 6 -20 +20 GROUP BY or 
 PARTITION BY

  16. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 333 4 +50 +70 333 5 -30 +40 333 6 -20 +20 ) FROM transactions t

  17. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 333 5 -30 +40 333 6 -20 +20 ) FROM transactions t

  18. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 333 6 -20 +20 ) FROM transactions t

  19. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 AND CURRENT ROW 333 6 -20 +20 ) FROM transactions t

  20. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 AND CURRENT ROW 333 6 -20 +20 ) FROM transactions t

  21. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 AND CURRENT ROW 333 6 -20 +20 ) FROM transactions t

  22. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 AND CURRENT ROW 333 6 -20 +20 ) FROM transactions t

  23. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 AND CURRENT ROW 333 6 -20 +20 ) FROM transactions t

  24. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +30 OVER ( 22 3 -10 +20 ORDER BY id 333 4 +50 +70 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +40 AND CURRENT ROW 333 6 -20 +20 ) FROM transactions t

  25. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 value, SUM(value) 22 2 +20 OVER ( 22 3 -10 ORDER BY id 333 4 +50 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 AND CURRENT ROW 333 6 -20 ) FROM transactions t

  26. OVER (ORDER BY) Since SQL:2003 acnt id value balance SELECT id, 1 1 +10 +10 value, SUM(value) 22 2 +20 +20 OVER ( PARTITION BY acnt 22 3 -10 +10 ORDER BY id 333 4 +50 +50 ROWS BETWEEN 
 UNBOUNDED PRECEDING 333 5 -30 +20 AND CURRENT ROW 333 6 -20 . 0 ) FROM transactions t

  27. OVER (ORDER BY) Since SQL:2003 With OVER (ORDER BY n) a new type of functions make sense: n ROW_NUMBER RANK DENSE_RANK PERCENT_RANK CUME_DIST 1 1 1 1 0 0.25 2 2 2 2 0.33… 0.75 3 3 2 2 0.33… 0.75 4 4 4 3 1 1

  28. Use Cases OVER (SQL:2003) ‣ Aggregates without GROUP BY ‣ Running totals, 
 AVG(…) OVER(ORDER BY … moving averages ROWS BETWEEN 3 PRECEDING AND 3 FOLLOWING) moving_avg ‣ Ranking SELECT * FROM (SELECT ROW_NUMBER() ‣ Top-N per Group OVER(PARTITION BY … ORDER BY …) rn , t.* ‣ Avoiding self-joins FROM t) numbered_t WHERE rn <= 3 [… many more …]

  29. In a Nutshell OVER (SQL:2003) OVER may follow any aggregate function OVER defines which rows are visible at each row OVER() makes all rows visible at every row OVER(PARTITION BY …) segregates like GROUP BY OVER(ORDER BY … BETWEEN) segregates using < , >

  30. Availability OVER (SQL:2003) Impala Spark Hive 1999 2001 2003 2005 2007 2009 2011 2013 2015 2017 NuoDB MariaDB 5.1 10.2 8.0 MySQL PostgreSQL 8.4 SQLite DB2 LUW 7.0 Oracle 8i SQL Server 2005

  31. SQL:2006

  32. XMLTABLE

  33. Since SQL:2006 XMLTABLE Stored in tbl.x : SELECT id , c1 <d> XPath * expression , n to identify rows <e id="42"> FROM tbl <c1>…</c1> , XMLTABLE( </e> '/d/e' </d> PASSING x COLUMNS id INT PATH '@id' , c1 VARCHAR(255) PATH 'c1' , n FOR ORDINALITY ) r *Standard SQL allows XQuery

  34. Since SQL:2006 XMLTABLE Stored in tbl.x : SELECT id , c1 <d> , n <e id="42"> FROM tbl <c1>…</c1> , XMLTABLE( </e> '/d/e' </d> PASSING x COLUMNS id INT PATH '@id' , c1 VARCHAR(255) PATH 'c1' , n FOR ORDINALITY ) r *Standard SQL allows XQuery

  35. Since SQL:2006 XMLTABLE Stored in tbl.x : SELECT id , c1 <d> , n <e id="42"> FROM tbl <c1>…</c1> XPath * expressions , XMLTABLE( </e> to extract data '/d/e' </d> PASSING x COLUMNS id INT PATH '@id' , c1 VARCHAR(255) PATH 'c1' , n FOR ORDINALITY ) r *Standard SQL allows XQuery

  36. Since SQL:2006 XMLTABLE Stored in tbl.x : SELECT id , c1 <d> , n <e id="42"> FROM tbl <c1>…</c1> , XMLTABLE( </e> '/d/e' </d> Row number PASSING x (like for unnest) COLUMNS id INT PATH '@id' , c1 VARCHAR(255) PATH 'c1' , n FOR ORDINALITY ) r *Standard SQL allows XQuery

  37. Since SQL:2006 XMLTABLE Stored in tbl.x : SELECT id Result , c1 <d> id | c1 | n , n <e id="42"> ----+----+--- FROM tbl <c1>…</c1> 42 | … | 1 , XMLTABLE( </e> '/d/e' </d> PASSING x COLUMNS id INT PATH '@id' , c1 VARCHAR(255) PATH 'c1' , n FOR ORDINALITY ) r *Standard SQL allows XQuery

  38. Availability XMLTABLE 1999 2001 2003 2005 2007 2009 2011 2013 2015 2017 MariaDB MySQL 10 [0] PostgreSQL SQLite DB2 LUW 9.7 Oracle 11gR1 SQL Server [0] No XQuery (only XPath). No default namespace declaration.

  39. SQL:2008

  40. FETCH FIRST

  41. The Problem FETCH FIRST Limit the result to a number of rows. ( LIMIT , TOP and ROWNUM are all proprietary) SELECT * FROM (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn FROM data) numbered_data WHERE rn <=10 SQL:2003 introduced ROW_NUMBER() to number rows. 
 But this still requires wrapping to limit the result. And how about databases not supporting ROW_NUMBER() ?

  42. The Problem FETCH FIRST Limit the result to a number of rows. ( LIMIT , TOP and ROWNUM are all proprietary) Dammit! SELECT * Let's take 
 FROM (SELECT * LIMIT , ROW_NUMBER() OVER(ORDER BY x) rn FROM data) numbered_data WHERE rn <=10 SQL:2003 introduced ROW_NUMBER() to number rows. 
 But this still requires wrapping to limit the result. And how about databases not supporting ROW_NUMBER() ?

  43. Since SQL:2008 FETCH FIRST SQL:2008 introduced the FETCH FIRST … ROWS ONLY clause: SELECT * FROM data ORDER BY x FETCH FIRST 10 ROWS ONLY

  44. Availability FETCH FIRST 1999 2001 2003 2005 2007 2009 2011 2013 2015 2017 MariaDB 5.1 MySQL 3.19.3 [0] PostgreSQL 6.5 8.4 [1] SQLite 2.1.0 [1] DB2 LUW 7.0 Oracle 12cR1 SQL Server 7.0 2012 [2] [0] Earliest mention of LIMIT . Probably inherited from mSQL [1] Functionality available using LIMIT [2] SELECT TOP n ... SQL Server 2000 also supports expressions and bind parameters

  45. SQL:2011

  46. OFFSET

  47. The Problem OFFSET How to fetch the rows after a limit? 
 (pagination anybody?) SELECT * FROM (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn FROM data) numbered_data WHERE rn > 10 and rn <= 20

  48. Since SQL:2011 OFFSET SQL:2011 introduced OFFSET , unfortunately! SELECT * FROM data ORDER BY x OFFSET 10 ROWS FETCH NEXT 10 ROWS ONLY

  49. Since SQL:2011 OFFSET SQL:2011 introduced OFFSET , unfortunately! OFFSET SELECT * FROM data ORDER BY x OFFSET 10 ROWS FETCH NEXT 10 ROWS ONLY e r s o a s t a b c G r e r s ! s t i c k & https://use-the-index-luke.com/no-offset

  50. Since SQL:2011 OFFSET 1999 2001 2003 2005 2007 2009 2011 2013 2015 MariaDB 5.1 MySQL 3.20.3 4.0.6 [0] [1] PostgreSQL 6.5 SQLite 2.1.0 DB2 LUW 9.7 11.1 [2] Oracle 12c SQL Server 2012 [0] LIMIT [offset,] limit : "With this it's easy to do a poor man's next page/previous page WWW application." [1] The release notes say "Added PostgreSQL compatible LIMIT syntax" [2] Requires enabling the MySQL compatibility vector: db2set DB2_COMPATIBILITY_VECTOR=MYS

  51. OVER

  52. The Problem OVER (SQL:2011) Direct access of other rows of the same window is not possible. (E.g., calculate the di ff erence to the previous rows) WITH numbered_t AS (SELECT * FROM t ) SELECT curr.* curr , curr.balance balance … rn - COALESCE(prev.balance,0) 50 … 1 FROM numbered_t curr 90 … 2 LEFT JOIN numbered_t prev 70 … 3 ON (curr.rn = prev.rn+1) 30 … 4

  53. The Problem OVER (SQL:2011) Direct access of other rows of the same window is not possible. (E.g., calculate the di ff erence to the previous rows) WITH numbered_t AS (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn ) FROM t SELECT curr.* curr , curr.balance balance … rn - COALESCE(prev.balance,0) 50 … 1 FROM numbered_t curr 90 … 2 LEFT JOIN numbered_t prev 70 … 3 ON (curr.rn = prev.rn+1) 30 … 4

  54. The Problem OVER (SQL:2011) Direct access of other rows of the same window is not possible. (E.g., calculate the di ff erence to the previous rows) WITH numbered_t AS (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn ) FROM t SELECT curr.* curr , curr.balance balance … rn - COALESCE(prev.balance,0) 50 … 1 FROM numbered_t curr 90 … 2 LEFT JOIN numbered_t prev 70 … 3 ON (curr.rn = prev.rn+1) 30 … 4

  55. The Problem OVER (SQL:2011) Direct access of other rows of the same window is not possible. (E.g., calculate the di ff erence to the previous rows) WITH numbered_t AS (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn ) FROM t SELECT curr.* curr prev , curr.balance balance … rn balance … rn - COALESCE(prev.balance,0) 50 … 1 50 … 1 FROM numbered_t curr 90 … 2 90 … 2 LEFT JOIN numbered_t prev 70 … 3 70 … 3 ON (curr.rn = prev.rn+1) 30 … 4 30 … 4

  56. The Problem OVER (SQL:2011) Direct access of other rows of the same window is not possible. (E.g., calculate the di ff erence to the previous rows) WITH numbered_t AS (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn ) FROM t SELECT curr.* curr prev , curr.balance balance … rn balance … rn - COALESCE(prev.balance,0) 50 … 1 FROM numbered_t curr 50 … 1 90 … 2 LEFT JOIN numbered_t prev 70 … 3 90 … 2 ON (curr.rn = prev.rn+1) 30 … 4 70 … 3 30 … 4

  57. The Problem OVER (SQL:2011) Direct access of other rows of the same window is not possible. (E.g., calculate the di ff erence to the previous rows) WITH numbered_t AS (SELECT * , ROW_NUMBER() OVER(ORDER BY x) rn ) FROM t SELECT curr.* curr prev , curr.balance balance … rn balance … rn - COALESCE(prev.balance,0) +50 50 … 1 FROM numbered_t curr 50 … 1 +40 90 … 2 LEFT JOIN numbered_t prev 70 … 3 90 … 2 -20 ON (curr.rn = prev.rn+1) 30 … 4 70 … 3 -40 30 … 4

  58. Since SQL:2011 OVER (SQL:2011) SQL:2011 introduced LEAD , LAG , NTH_VALUE , … for that: SELECT *, balance 
 - COALESCE( LAG(balance) 
 OVER(ORDER BY x) 
 , 0) 
 FROM t Available functions: LEAD / LAG 
 FIRST_VALUE / LAST_VALUE 
 NTH_VALUE(col, n) FROM FIRST/LAST 
 RESPECT/IGNORE NULLS

  59. Since SQL:2011 OVER (LEAD, LAG, …) 1999 2001 2003 2005 2007 2009 2011 2013 2015 2017 MariaDB 5.1 10.2 [0] [0] MySQL 8.0 PostgreSQL 8.4 [0] SQLite DB2 LUW 9.5 11.1 [1] Oracle 8i 11gR2 [1] SQL Server 2012 [1] [0] No IGNORE NULLS and FROM LAST [1] No NTH_VALUE

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

MODERN 1 MODERN 2 MODERN 3 MODERN 4 MODERN A peep at some distant orb has power to raise

MODERN 1 MODERN 2 MODERN 3 MODERN 4 MODERN A peep at some distant orb has power to raise

MODERN 1 MODERN 2 MODERN 3 MODERN 4 MODERN A peep at some distant orb has power to raise and purify our thoughts like a strain picture, or a passage from the grander poets. It always does one good. 5 MODERN 6 MODERN 7 MODERN 8

524 views • 24 slides
H6751 Summary Zhao Rui Agenda 1. Modern AI 2. Course Summary Modern AI Modern AI

H6751 Summary Zhao Rui Agenda 1. Modern AI 2. Course Summary Modern AI Modern AI

H6751 Summary Zhao Rui Agenda 1. Modern AI 2. Course Summary Modern AI Modern AI (90s-present) Stat Model :Pearl (1988) promote Bayesian networks in AI to model uncertainty (based on Bayes rule from 1700) Stat Model: infer the

441 views • 11 slides
Wonders of Modern Architecture Oh, the wonders of modern architecture! The geniuses of

Wonders of Modern Architecture Oh, the wonders of modern architecture! The geniuses of

Wonders of Modern Architecture Oh, the wonders of modern architecture! The geniuses of architecture today continue to create design masterpieces that could make one proud of being a citizen of the 21st Century! Enjoy the beauty of these modern

832 views • 52 slides
Apprenticeships Modern Apprenticeships Tackling Scotlands skills gap Modern

Apprenticeships Modern Apprenticeships Tackling Scotlands skills gap Modern

Modern and Graduate Apprenticeships Modern Apprenticeships Tackling Scotlands skills gap Modern Apprenticeships help employers to develop their workforce by training new staff, and upskilling existing employees. For individuals, an MA is

532 views • 6 slides
Modern Defense Tooling Artificial intelligence as a defense platform Ameen Altajer Modern

Modern Defense Tooling Artificial intelligence as a defense platform Ameen Altajer Modern

Modern Defense Tooling Artificial intelligence as a defense platform Ameen Altajer Modern Defense Tooling A drastic change in the modern AI landscape The work of both DeepMind and OpenAI is a testament of how things drastically changed Modern

700 views • 15 slides
Modern Mississippi Chapters 10-11 MS state flag, seal and Coat of Arms Chp 10 &amp;11 (Modern

Modern Mississippi Chapters 10-11 MS state flag, seal and Coat of Arms Chp 10 &amp;11 (Modern

Modern Mississippi Chapters 10-11 MS state flag, seal and Coat of Arms Chp 10 &amp;11 (Modern MS) 2 Chp 10 &amp;11 (Modern MS) 3 Modern Mississippi Statistics As of the year 2000, MS had a population of 2,844,658. The largest city

1.09k views • 60 slides
Using Modern C++ In Anger Todd L. Montgomery @toddlmontgomery Aeron and C++? What

Using Modern C++ In Anger Todd L. Montgomery @toddlmontgomery Aeron and C++? What

StoneTor Using Modern C++ In Anger Todd L. Montgomery @toddlmontgomery Aeron and C++? What constitutes Modern C++ ? How Aeron Adopts Modern C++? What Lessons were learned? Whats Next ? Aeron and C++? Truly modern

2.03k views • 98 slides
Modern Modern Template Techniques Template The Simplest Function Template

Modern Modern Template Techniques Template The Simplest Function Template

Modern Modern Template Techniques Template The Simplest Function Template CRTPStatic Polymorphism Techniques Type TraitsBasic Metaprogramming Compile-time Conditionals Policy Classes Perfect Forwarding

1.29k views • 42 slides
Modern cryptography CSCI 470: Web Science Keith Vertanen Overview Modern cryptography

Modern cryptography CSCI 470: Web Science Keith Vertanen Overview Modern cryptography

Modern cryptography CSCI 470: Web Science Keith Vertanen Overview Modern cryptography Symmetric cryptography DES 3DES AES Asymmetric cryptography Diffie-Hellman key exchange 2 Modern cryptography Moving into

338 views • 16 slides
W HAT CAN BE DONE WITH A SO SIMPLE LOGIC ? The facts are propositional variables The knowledge is

W HAT CAN BE DONE WITH A SO SIMPLE LOGIC ? The facts are propositional variables The knowledge is

History of SAT Modern Solvers Main Components Conclusion / Challenges T OWARDS A N EW E RA OF SAT S OLVERS Laurent Simon Inside Modern SAT Solvers Contains Materials from Joao Marques-Silva, Daniel Le Berre 1/66 History of SAT Modern

2.02k views • 186 slides
What is TypeScript? TypeScript = JavaScript TypeScript = Modern JavaScript TypeScript = Modern

What is TypeScript? TypeScript = JavaScript TypeScript = Modern JavaScript TypeScript = Modern

What is TypeScript? TypeScript = JavaScript TypeScript = Modern JavaScript TypeScript = Modern JavaScript + Types Open source and open development Closely track ECMAScript standard Innovate in type system Best of breed tooling Continuously

909 views • 53 slides
CAREERS &amp; SKILLS ASSEMBLY Modern Languages Modern Languages at Boroughmuir and beyond

CAREERS &amp; SKILLS ASSEMBLY Modern Languages Modern Languages at Boroughmuir and beyond

CAREERS &amp; SKILLS ASSEMBLY Modern Languages Modern Languages at Boroughmuir and beyond You have the chance to learn French, German, Spanish, Mandarin and Italian Everyone studies at least one language until the end of S4 From S3,

554 views • 6 slides
In Investor Update Ju June 2017 What is is Modern? Success in a Low Modern GRANDE PRAIRIE

In Investor Update Ju June 2017 What is is Modern? Success in a Low Modern GRANDE PRAIRIE

In Investor Update Ju June 2017 What is is Modern? Success in a Low Modern GRANDE PRAIRIE Market Pipelines Price Environment (NGTL, Alliance) Pembina Peace Clean, safe, low liability HS&amp;E Leadership Liquids Pipeline HWY 40

485 views • 21 slides
In Investor Update Ju June 2017 What is is Modern? Success in a Low Modern GRANDE PRAIRIE

In Investor Update Ju June 2017 What is is Modern? Success in a Low Modern GRANDE PRAIRIE

In Investor Update Ju June 2017 What is is Modern? Success in a Low Modern GRANDE PRAIRIE Market Pipelines Price Environment (NGTL, Alliance) Pembina Peace Clean, safe, low liability HS&amp;E Leadership Liquids Pipeline HWY 40

389 views • 23 slides
C Progra amming A Modern Approach K. N. King, C Progra C P ramming i Approach , A Modern

C Progra amming A Modern Approach K. N. King, C Progra C P ramming i Approach , A Modern

C Progra amming A Modern Approach K. N. King, C Progra C P ramming i Approach , A Modern W. W. Norton &amp; C Company, 1996. Original Notes by Raj Sunderraman Converted to present p ation and updated by p y Michael Weeks Note

853 views • 49 slides
CISM MODERN PENTATHLON COMMITTEE CISM Modern Pentathlon Committee Composition of the CISM Modern

CISM MODERN PENTATHLON COMMITTEE CISM Modern Pentathlon Committee Composition of the CISM Modern

CISM MODERN PENTATHLON COMMITTEE CISM Modern Pentathlon Committee Composition of the CISM Modern Pentathlon Committee - Lt. Colonel Nilton Rolim Brazil President - Capt

517 views • 10 slides
Facility 96 Calan TM Gate facility Feed Intake in Brangus

Facility 96 Calan TM Gate facility Feed Intake in Brangus

Lisa Kriese-Anderson, 6/1/17 Facility 96 Calan TM Gate facility Feed Intake in Brangus CaDle: Since 1978 Experiences and RecommendaKons 3,170

509 views • 3 slides
Improved classical simulation of quantum 3 Appendix circuits dominated by Clifford gates

Improved classical simulation of quantum 3 Appendix circuits dominated by Clifford gates

1 Introduction Model of Computation Gottesmann-Knill Theorem Magic States 2 Algorithm Improved classical simulation of quantum 3 Appendix circuits dominated by Clifford gates Presented by Patrick Rall Publication by Sergey Bravyi

522 views • 20 slides
COL863: Quantum Computation and Information Ragesh Jaiswal, CSE, IIT Delhi Ragesh Jaiswal, CSE,

COL863: Quantum Computation and Information Ragesh Jaiswal, CSE, IIT Delhi Ragesh Jaiswal, CSE,

COL863: Quantum Computation and Information Ragesh Jaiswal, CSE, IIT Delhi Ragesh Jaiswal, CSE, IIT Delhi COL863: Quantum Computation and Information Quantum Computation: Quantum circuits Ragesh Jaiswal, CSE, IIT Delhi COL863: Quantum

642 views • 24 slides
What do quantum computers do? Daniel J. Bernstein University of Illinois at Chicago Quantum

What do quantum computers do? Daniel J. Bernstein University of Illinois at Chicago Quantum

1 What do quantum computers do? Daniel J. Bernstein University of Illinois at Chicago Quantum algorithm means an algorithm that a quantum computer can run. i.e. a sequence of instructions, where each instruction is in a quantum

892 views • 76 slides
Transparently Scale-out SQL Databases with Data Grids Erik Brandsberg, CTO Heimdall Data Agenda

Transparently Scale-out SQL Databases with Data Grids Erik Brandsberg, CTO Heimdall Data Agenda

Transparently Scale-out SQL Databases with Data Grids Erik Brandsberg, CTO Heimdall Data Agenda Rolling Your Own Solutions 1 Considerations when implementing a cache &amp; read/write split in your application 2 How Database Proxies Solves

533 views • 21 slides
Unit Testing a C++ Database Application with Unit Testing a C++ Database Application with Unit

Unit Testing a C++ Database Application with Unit Testing a C++ Database Application with Unit

Unit Testing a C++ Database Application with Unit Testing a C++ Database Application with Unit Testing a C++ Database Application with Unit Testing a C++ Database Application with Mock Objects Mock Objects Mock Objects Mock Objects Ray

326 views • 13 slides
CS 3410 Computer Science Cornell University [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]

CS 3410 Computer Science Cornell University [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon]

CS 3410 Computer Science Cornell University [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon] Combinational logic Output computed directly from inputs System has no internal state Nothing depends on the past! Combinational Inputs

715 views • 38 slides
Convex optimization based on global lower second-order models Nikita Doikov Yurii Nesterov

Convex optimization based on global lower second-order models Nikita Doikov Yurii Nesterov

Convex optimization based on global lower second-order models Nikita Doikov Yurii Nesterov UCLouvain, Belgium NeurIPS 2020 Problem Composite convex optimization problem: def min x F ( x ) = f ( x ) + ( x ) f is convex,

290 views • 13 slides

More recommend