query evaluation with constant delay
play

Query Evaluation With Constant Delay Wojciech Kazana INRIA Saclay, - PowerPoint PPT Presentation

Mar 05, 2023 •125 likes •639 views

Query Evaluation With Constant Delay Wojciech Kazana INRIA Saclay, ENS de Cachan PhD Thesis Defense LSV, Ecole normale sup erieure de Cachan September 16, 2013 Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay

  1. Query Evaluation With Constant Delay Wojciech Kazana INRIA Saclay, ENS de Cachan PhD Thesis Defense LSV, ´ Ecole normale sup´ erieure de Cachan September 16, 2013 Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 1 / 46

  2. Introduction Enumeration Examples Results Conclusions Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 2 / 46

  3. Introduction – databases Databases: storage of data and retrieval of information. 1. A store has its list of offered products. Can I buy orange shoes? 2. Private collection of photos. 3. Map of a metro system. 4. Social network and its graph. 5. . . . Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 3 / 46

  4. Introduction – databases Databases: storage of data and retrieval of information. 1. A store has its list of offered products. 2. Private collection of photos. On how many of my photos am I actually present? 3. Map of a metro system. 4. Social network and its graph. 5. . . . Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 4 / 46

  5. Introduction – databases Databases: storage of data and retrieval of information. 1. A store has its list of offered products. 2. Private collection of photos. 3. Map of a metro system. Can I get from Chˆ ateau d’Eau to Bagneux with just one hop? 4. Social network and its graph. 5. . . . Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 5 / 46

  6. Introduction – databases Databases: storage of data and retrieval of information. 1. A store has its list of offered products. 2. Private collection of photos. 3. Map of a metro system. 4. Social network and its graph. Which pairs of people are in the 2-handshakes distance from each other? 5. . . . B C A E D P Wojtek 1 R 2 3 Q Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 6 / 46

  7. Introduction – Query Evaluation B C A E D P Wojtek 1 R 2 3 Q Query Evaluation Problem: Input: Output: • query q (¯ x ) q ( D ) • database D of size | | D | | Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) , (1 , 3) , (1 , Wojtek) , (1 , D ) , (1 , E ) , (1 , P ) , (1 , Q ) , (1 , R ) (2 , 1) , (2 , 3) , (2 , Wojtek) , (2 , D ) , (2 , E ) , (2 , P ) , (2 , Q ) , (2 , R ) (3 , 1) , (3 , 2) , (3 , Wojtek) , (3 , D ) , (3 , E ) , (3 , P ) , (3 , Q ) , (3 , R ) . . . Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 7 / 46

  8. Introduction – Query Evaluation C B A E D P Wojtek 1 R 2 3 Q Query Evaluation Problem: Input: Output: • query q (¯ x ) q ( D ) • database D of size | | D | | Special case: q boolean = Model Checking Problem. Are there two green friends? No Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 8 / 46

  9. Introduction – Query Evaluation Query Evaluation Problem: Input: Output: • query q (¯ x ) q ( D ) • database D | k ) if q has k free variables. Issue: | q ( D ) | = O ( | | D | | k is too big! | | D | Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 9 / 46

  10. Query Enumeration and Related Problems Input: • query q (¯ x ) • database D Enumeration: • compute first solution quickly, • compute the rest with minimal delay between consecutive ones. Aim: First solution in O ( | | D | | ), O (1) delay → C ONSTANT- D ELAY lin Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 10 / 46

  11. Query Enumeration and Related Problems Input: • query q (¯ x ) • database D Enumeration: • compute first solution quickly, • compute the rest with minimal delay between consecutive ones. Aim: First solution in O ( | | D | | ), O (1) delay → C ONSTANT- D ELAY lin In practice: ◮ the O ( | | D | | ) preprocessing is a linear refactorization of the input database (usually adding to it some additional navigational power), ◮ the refactorized database can then be traversed efficiently, producing new solutions after only constant delays. Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 10 / 46

  12. Query Enumeration and Related Problems B C A E D P Wojtek 1 R 2 3 Q Query Evaluation Problem: Input: Output: • query q (¯ x ) q ( D ) • database D Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) , (1 , 3) , (1 , Wojtek) , (1 , D ) , (1 , E ) , (1 , P ) , (1 , Q ) , (1 , R ) (2 , 1) , (2 , 3) , (2 , Wojtek) , (2 , D ) , (2 , E ) , (2 , P ) , (2 , Q ) , (2 , R ) (3 , 1) , (3 , 2) , (3 , Wojtek) , (3 , D ) , (3 , E ) , (3 , P ) , (3 , Q ) , (3 , R ) . . . Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 11 / 46

  13. Query Enumeration and Related Problems B C A E D P Wojtek 1 R 2 3 Q Query Enumeration Problem: Input: Output: • query q (¯ x ) q ( D ) • database D Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 12 / 46

  14. Query Enumeration and Related Problems B C A E D P Wojtek 1 R 2 3 Q Query Enumeration Problem: Input: Output: • query q (¯ x ) q ( D ) • database D Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) , (1 , 3) Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 12 / 46

  15. Query Enumeration and Related Problems B C A E D P Wojtek 1 R 2 3 Q Query Enumeration Problem: Input: Output: • query q (¯ x ) q ( D ) • database D Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) , (1 , 3) , (1 , Wojtek) Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 12 / 46

  16. Query Enumeration and Related Problems B C A E D P Wojtek 1 R 2 3 Q Query Enumeration Problem: Input: Output: • query q (¯ x ) q ( D ) • database D Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) , (1 , 3) , (1 , Wojtek) , (1 , D ) Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 12 / 46

  17. Query Enumeration and Related Problems B C A E D P Wojtek 1 R 2 3 Q Query Enumeration Problem: Input: Output: • query q (¯ x ) q ( D ) • database D Which pairs of people are in the 2-handshakes distance from each other? (1 , 2) , (1 , 3) , (1 , Wojtek) , (1 , D ) , (1 , E ) , (1 , P ) , (1 , Q ) , (1 , R ) (2 , 1) , (2 , 3) , (2 , Wojtek) , (2 , D ) , (2 , E ) , (2 , P ) , (2 , Q ) , (2 , R ) (3 , 1) , (3 , 2) , (3 , Wojtek) , (3 , D ) , (3 , E ) , (3 , P ) , (3 , Q ) , (3 , R ) . . . Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 12 / 46

  18. Query Enumeration and Related Problems C B A E D P Wojtek 1 R 2 3 Q Counting Problem: Input: Output: | q ( D ) | • query q (¯ x ) • database D Aim: O ( | | D | | ) How many pairs of people are in the 2-handshakes distance from each other? 78 Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 13 / 46

  19. Query Enumeration and Related Problems C B A E D P Wojtek 1 R 2 3 Q Testing Problem: Input: Dynamical output: ? • query q (¯ x ) given ¯ v , answer ¯ v ∈ q ( D ) • database D Aim: preprocessing (once, ¯ v unknown) O ( | | D | | ) After preprocessing answering (multiple times) O (1) Is (1 , P ) in the 2-handshakes distance? Yes Is ( A , E ) in the 2-handshakes distance? No Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 14 / 46

  20. C ONSTANT- D ELAY lin vs. Evaluation Remark 1 C ONSTANT- D ELAY lin enumeration → O ( | | D | | + | q ( D ) | ) evaluation. Remark 2 C ONSTANT- D ELAY lin enumeration → O ( | | D | | ) model checking. Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 15 / 46

  21. Computational model – RAM machine ◮ Necessary, since we want to talk about linear time. ◮ We assume that the elements can be compared in constant time. A < lex P < lex Wojtek In real life: user = (short) e-mail address ◮ We can sort lexicographically tuples of constant size in linear time. Radix sort ◮ We can follow pointers in constant time. Direct access to the n -th cell of an array. ◮ Coding of a graph: List of consecutive edges. NOT an adjacency matrix! Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 16 / 46

  22. Introduction Enumeration Examples Results Conclusions Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 17 / 46

  23. Example 1: enumeration of edges Database: Query: q ( x , y ) = E ( x , y ) graph G = ( V , E ) | | G | | = | V | + | E | • C ONSTANT- D ELAY lin enumeration is not too difficult. • O ( | | G | | ) counting is not too difficult. • Testing requires logarithmic time. ◦ O (1) testing if G is a tree. Wojciech Kazana (INRIA, ENS Cachan) Query Evaluation With Constant Delay September 16th, 2013 18 / 46

Recommend

Lazy Evaluation Announcements Promises Delay Creates a Promise From the Revised 5 Report on the

Lazy Evaluation Announcements Promises Delay Creates a Promise From the Revised 5 Report on the

Lazy Evaluation Announcements Promises Delay Creates a Promise From the Revised 5 Report on the Algorithmic Language Scheme ( delay &lt;expression&gt; ) The delay construct is used together with the procedure force to implement lazy evaluation or

531 views • 13 slides
Overview of Query Evaluation [R&amp;G] Chapter 12 CS4320 1 Overview of Query Evaluation

Overview of Query Evaluation [R&amp;G] Chapter 12 CS4320 1 Overview of Query Evaluation

Overview of Query Evaluation [R&amp;G] Chapter 12 CS4320 1 Overview of Query Evaluation Plan : Tree of R.A. ops, with choice of alg for each op. Each operator typically implemented using a `pull interface: when an operator is

1.06k views • 21 slides
Scalable Uncertainty Management 05 Query Evaluation in Probabilistic Databases Rainer Gemulla

Scalable Uncertainty Management 05 Query Evaluation in Probabilistic Databases Rainer Gemulla

Scalable Uncertainty Management 05 Query Evaluation in Probabilistic Databases Rainer Gemulla Jun 1, 2012 Overview In this lecture Primer: relational calculus Understand complexity of query evaluation How to determine whether a query is

1.54k views • 119 slides
Time-delay cosmography: Tensions between the Hubble constant inferred from the early and late

Time-delay cosmography: Tensions between the Hubble constant inferred from the early and late

Time-delay cosmography: Tensions between the Hubble constant inferred from the early and late Universe Lon Koopmans (Kapteyn Astronomical Institute) Based on work by the H0LICOW, COSMOGRAIL, STRIDES and SHARP collaborations 1 Many slides

1.11k views • 85 slides
CAS CS 460/660 Introduction to Database Systems Query Evaluation II 1.1 Cost-based Query

CAS CS 460/660 Introduction to Database Systems Query Evaluation II 1.1 Cost-based Query

CAS CS 460/660 Introduction to Database Systems Query Evaluation II 1.1 Cost-based Query Sub-System Select * Queries From Blah B Where B.blah = blah Query Parser Query Optimizer Plan Plan Cost Catalog Manager Generator Estimator

711 views • 44 slides
Constant delay algorithms for regular document spanners Fernando Florenzano Cristian Riveros

Constant delay algorithms for regular document spanners Fernando Florenzano Cristian Riveros

Constant delay algorithms for regular document spanners Fernando Florenzano Cristian Riveros Domagoj Vrgo c From PUC Chile Mart n Ugarte Stijn Vansummeren From Universit e Libre de Bruxelles Rule-based information extraction by

764 views • 39 slides
Trade-offs in Static and Dynamic Query Evaluation Ahmet Kara, Milos Nikolic Dan Olteanu, and

Trade-offs in Static and Dynamic Query Evaluation Ahmet Kara, Milos Nikolic Dan Olteanu, and

Trade-offs in Static and Dynamic Query Evaluation Ahmet Kara, Milos Nikolic Dan Olteanu, and Haozhe Zhang fdbresearch.github.io KOCOON Workshop 2019, Arras Static and Dynamic Query Evaluation Static Query Evaluation preprocessing

1.38k views • 51 slides
CAS CS 460/660 Introduction to Database Systems Query Evaluation I Slides from UC Berkeley 1.1

CAS CS 460/660 Introduction to Database Systems Query Evaluation I Slides from UC Berkeley 1.1

CAS CS 460/660 Introduction to Database Systems Query Evaluation I Slides from UC Berkeley 1.1 Introduction We ve covered the basic underlying storage, buffering, and indexing SQL Query technology. Now we can move on to query

617 views • 32 slides
Coordination-free query evaluation and multi-query optimization in parallel and distributed

Coordination-free query evaluation and multi-query optimization in parallel and distributed

Formal approaches to: Coordination-free query evaluation and multi-query optimization in parallel and distributed systems Bas Ketsman Outline CALM Formalization CALM Revision 1 Coordination-free evaluation Conclusion Parallel-Correctness

1.25k views • 88 slides
End to End Delay Performance Evaluation for VoIP in the LTE Network Dai, Hongxin

End to End Delay Performance Evaluation for VoIP in the LTE Network Dai, Hongxin

ENSC 427 COMMUNICATION NETWORKS SPRING 2013 Final Project Presentation End to End Delay Performance Evaluation for VoIP in the LTE Network Dai, Hongxin danield @ sfu.ca Ishita, Farah fishita @ sfu.ca Lo, Hao Hua

530 views • 24 slides
Advanced Database Management Systems Query Processing: Query Evaluation Alvaro A A Fernandes

Advanced Database Management Systems Query Processing: Query Evaluation Alvaro A A Fernandes

Advanced Database Management Systems Query Processing: Query Evaluation Alvaro A A Fernandes School of Computer Science, University of Manchester AAAF (School of CS, Manchester) Advanced DBMSs 2012-2013 1 / 111 Outline Algorithmic

1.23k views • 111 slides
Relational Query Optimization UMass Amherst March 25 and 27, 2008 Slide Content Courtesy of R.

Relational Query Optimization UMass Amherst March 25 and 27, 2008 Slide Content Courtesy of R.

Relational Query Optimization UMass Amherst March 25 and 27, 2008 Slide Content Courtesy of R. Ramakrishnan, J. Gehrke, and J. Hellerstein 1 Overview of Query Evaluation Query Evaluation Plan : tree of relational algebra (R.A.) operators,

548 views • 36 slides
Query Evaluation Doing what we're told to do. Hoyt Koepke 10/02/06 1 Purpose of the Paper

Query Evaluation Doing what we're told to do. Hoyt Koepke 10/02/06 1 Purpose of the Paper

Query Evaluation Doing what we're told to do. Hoyt Koepke 10/02/06 1 Purpose of the Paper Survey efficient algorithms and software architectures for database query execution. How database systems handle complex queries. Complex means

732 views • 22 slides
Two Adaptive Query Execution Systems Outline Motivation Tukwila Eddies Evaluation

Two Adaptive Query Execution Systems Outline Motivation Tukwila Eddies Evaluation

Two Adaptive Query Execution Systems Outline Motivation Tukwila Eddies Evaluation Data integration Extreme form of distributed database Sources of data all over the internet (unrelated) Query optimization is difficult

507 views • 33 slides
Efficient Regular Path Query Evaluation in PGX Author : Supervisor : Xuming Meng dr. G.H.L. F

Efficient Regular Path Query Evaluation in PGX Author : Supervisor : Xuming Meng dr. G.H.L. F

Efficient Regular Path Query Evaluation in PGX Author : Supervisor : Xuming Meng dr. G.H.L. F LETCHER 15-08-2016 Introduction &amp; Problem Statement Regular Path Query ( RPQ ) in PGX . - an in-memory parallel graph analytics framework,

650 views • 15 slides
Repeated On-Chip Interconnect Analysis and Evaluation of Delay, Power, and Bandwidth Metrics under

Repeated On-Chip Interconnect Analysis and Evaluation of Delay, Power, and Bandwidth Metrics under

Repeated On-Chip Interconnect Analysis and Evaluation of Delay, Power, and Bandwidth Metrics under Different Design Goals Ling Zhang 1 , Hongyu Chen 2 , Bo Yao 3 , Kevin Hamilton 4 , Chung-Kuan Cheng 1 1 University of California, San Diego, CA

193 views • 6 slides
Query Evaluation Techniques for Large Databases GOETZ GRAETE Presented by Long Zhang Dept. of

Query Evaluation Techniques for Large Databases GOETZ GRAETE Presented by Long Zhang Dept. of

Query Evaluation Techniques for Large Databases GOETZ GRAETE Presented by Long Zhang Dept. of Computer Science, UBC zhlong73@cs.ubc.ca 1 Purpose To survey efficient algorithms and software architecture of query execution engines for

627 views • 52 slides
Interconnect Gate delay Wire delay The delay in VLSI circuits have two components Gate delay (

Interconnect Gate delay Wire delay The delay in VLSI circuits have two components Gate delay (

Advanced Digital IC-Design Propagation Delay Lumped C p Distributed model C model Interconnect Gate delay Wire delay The delay in VLSI circuits have two components Gate delay ( t pHL / t pLH ) Wire (interconnect) delay ( t w ) The Wire

492 views • 20 slides
Constant delay enumeration for FO queries over databases with local bounded expansion Luc Segoufin

Constant delay enumeration for FO queries over databases with local bounded expansion Luc Segoufin

Constant delay enumeration for FO queries over databases with local bounded expansion Luc Segoufin 1 Alexandre Vigny 2 1 ENS Ulm, Paris 2 Universit Paris Diderot, Paris November 16, 2017 Alexandre Vigny Enumeration &amp; local-bounded

527 views • 29 slides
Cost-based Query Sub-System Select * Queries From Blah B Where B.blah = blah Query Parser

Cost-based Query Sub-System Select * Queries From Blah B Where B.blah = blah Query Parser

Faloutsos/Pavlo CMU - 15-415/615 CMU SCS Carnegie Mellon Univ. Dept. of Computer Science 15-415/615 - DB Applications C. Faloutsos A. Pavlo Lecture#13: Query Evaluation CMU SCS Today's Class Catalog (12.1) Intro to Operator

377 views • 18 slides
Query Decompositions survey Nicola Onose January 19, 2007 Nicola Onose Query Decompositions

Query Decompositions survey Nicola Onose January 19, 2007 Nicola Onose Query Decompositions

Speeding Up Query Evaluation Graphs &amp; Queries Back to Hypergraphs Computing Decompositions and Widths Related Concepts &amp; Conclusions Query Decompositions survey Nicola Onose January 19, 2007 Nicola Onose Query Decompositions

762 views • 47 slides
SQL and Relational Calculus Although relational algebra is useful in the analysis of query

SQL and Relational Calculus Although relational algebra is useful in the analysis of query

Relational Calculus,Visual Query Languages, and Deductive Databases Chapter 13 SQL and Relational Calculus Although relational algebra is useful in the analysis of query evaluation, SQL is actually based on a different query language:

946 views • 90 slides
Normalization by Evaluation in the Delay Monad Andreas Abel 1 James Chapman 2 1 Department of

Normalization by Evaluation in the Delay Monad Andreas Abel 1 James Chapman 2 1 Department of

Normalization by Evaluation in the Delay Monad Andreas Abel 1 James Chapman 2 1 Department of Computer Science and Engineering Gothenburg University, Sweden 2 Computer and Information Sciences Strathclyde University Types for Proofs and Programs

483 views • 19 slides
Improve Query Performance with the Query Log Analyzer Kees Vegter Field Engineer Query Log

Improve Query Performance with the Query Log Analyzer Kees Vegter Field Engineer Query Log

Improve Query Performance with the Query Log Analyzer Kees Vegter Field Engineer Query Log Analyzer kees@neo4j.com Query Log dbms.logs.query.enabled=true # If the execution of query takes more time than this threshold, # the query is

1.12k views • 27 slides

More recommend