The Experts below are selected from a list of 66 Experts worldwide ranked by ideXlab platform

Fabian M. Suchanek - One of the best experts on this subject based on the ideXlab platform.

  • ESWC - Equivalent Rewritings on Path Views with Binding Patterns
    The Semantic Web, 2020
    Co-Authors: Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
    Abstract:

    A view with a binding pattern is a Parameterized Query on a database. Such views are used, e.g., to model Web services. To answer a Query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the Query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.

  • Equivalent Rewritings on Path Views with Binding Patterns
    arXiv: Databases, 2020
    Co-Authors: Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
    Abstract:

    A view with a binding pattern is a Parameterized Query on a database. Such views are used, e.g., to model Web services. To answer a Query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the Query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.

Surajit Chaudhuri - One of the best experts on this subject based on the ideXlab platform.

  • SIGMOD Conference - Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees
    Proceedings of the 2017 ACM International Conference on Management of Data, 2017
    Co-Authors: Anshuman Dutt, Vivek Narasayya, Surajit Chaudhuri
    Abstract:

    Parametric Query optimization (PQO) deals with the problem of finding and reusing a relatively small number of plans that can achieve good plan quality across multiple instances of a Parameterized Query. An ideal solution to PQO would process Query instances online and ensure (a) tight, bounded cost sub-optimality for each instance, (b) low optimization overheads, and (c) only a small number of plans need to be stored. Existing solutions to online PQO however, fall short on at least one of the above metrics. We propose a plan re-costing based approach that enables us to perform well on all three metrics. We empirically show the effectiveness of our technique on industry benchmark and real-world Query workloads with our modified version of the Microsoft SQL Server Query optimizer.

  • SIGMOD Conference - Variance aware optimization of Parameterized queries
    Proceedings of the 2010 international conference on Management of data - SIGMOD '10, 2010
    Co-Authors: Surajit Chaudhuri, Hongrae Lee, Vivek Narasayya
    Abstract:

    Parameterized queries are commonly used in database applications. In a Parameterized Query, the same SQL statement is potentially executed multiple times with different parameter values. In today's DBMSs the Query optimizer typically chooses a single execution plan that is reused for multiple instances of the same Query. A key problem is that even if a plan with low average cost across instances is chosen, its variance can be high, which is undesirable in many production settings. In this paper, we describe techniques for selecting a plan that can better address the trade-off between the average and variance of cost across instances of a Parameterized Query. We show how to efficiently compute the skyline in the average-variance cost space. We have implemented our techniques on top of a commercial DBMS. We present experimental results on benchmark and real-world decision support queries.

Vivek Narasayya - One of the best experts on this subject based on the ideXlab platform.

  • SIGMOD Conference - Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees
    Proceedings of the 2017 ACM International Conference on Management of Data, 2017
    Co-Authors: Anshuman Dutt, Vivek Narasayya, Surajit Chaudhuri
    Abstract:

    Parametric Query optimization (PQO) deals with the problem of finding and reusing a relatively small number of plans that can achieve good plan quality across multiple instances of a Parameterized Query. An ideal solution to PQO would process Query instances online and ensure (a) tight, bounded cost sub-optimality for each instance, (b) low optimization overheads, and (c) only a small number of plans need to be stored. Existing solutions to online PQO however, fall short on at least one of the above metrics. We propose a plan re-costing based approach that enables us to perform well on all three metrics. We empirically show the effectiveness of our technique on industry benchmark and real-world Query workloads with our modified version of the Microsoft SQL Server Query optimizer.

  • SIGMOD Conference - Variance aware optimization of Parameterized queries
    Proceedings of the 2010 international conference on Management of data - SIGMOD '10, 2010
    Co-Authors: Surajit Chaudhuri, Hongrae Lee, Vivek Narasayya
    Abstract:

    Parameterized queries are commonly used in database applications. In a Parameterized Query, the same SQL statement is potentially executed multiple times with different parameter values. In today's DBMSs the Query optimizer typically chooses a single execution plan that is reused for multiple instances of the same Query. A key problem is that even if a plan with low average cost across instances is chosen, its variance can be high, which is undesirable in many production settings. In this paper, we describe techniques for selecting a plan that can better address the trade-off between the average and variance of cost across instances of a Parameterized Query. We show how to efficiently compute the skyline in the average-variance cost space. We have implemented our techniques on top of a commercial DBMS. We present experimental results on benchmark and real-world decision support queries.

Julien Romero - One of the best experts on this subject based on the ideXlab platform.

  • ESWC - Equivalent Rewritings on Path Views with Binding Patterns
    The Semantic Web, 2020
    Co-Authors: Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
    Abstract:

    A view with a binding pattern is a Parameterized Query on a database. Such views are used, e.g., to model Web services. To answer a Query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the Query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.

  • Equivalent Rewritings on Path Views with Binding Patterns
    arXiv: Databases, 2020
    Co-Authors: Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
    Abstract:

    A view with a binding pattern is a Parameterized Query on a database. Such views are used, e.g., to model Web services. To answer a Query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the Query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.

Nicoleta Preda - One of the best experts on this subject based on the ideXlab platform.

  • ESWC - Equivalent Rewritings on Path Views with Binding Patterns
    The Semantic Web, 2020
    Co-Authors: Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
    Abstract:

    A view with a binding pattern is a Parameterized Query on a database. Such views are used, e.g., to model Web services. To answer a Query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the Query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.

  • Equivalent Rewritings on Path Views with Binding Patterns
    arXiv: Databases, 2020
    Co-Authors: Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek
    Abstract:

    A view with a binding pattern is a Parameterized Query on a database. Such views are used, e.g., to model Web services. To answer a Query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the Query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.