IDEAS home Printed from https://ideas.repec.org/a/spr/infosf/v25y2023i5d10.1007_s10796-022-10320-2.html
   My bibliography  Save this article

Cost-based Optimization of Multistore Query Plans

Author

Listed:
  • Chiara Forresi

    (University of Bologna)

  • Matteo Francia

    (University of Bologna)

  • Enrico Gallinucci

    (University of Bologna)

  • Matteo Golfarelli

    (University of Bologna)

Abstract

Multistores are data management systems that enable query processing across different and heterogeneous databases; besides the distribution of data, complexity factors like schema heterogeneity and data replication must be resolved through integration and data fusion activities. Our multistore solution relies on a dataspace to provide the user with an integrated view of the available data and enables the formulation and execution of GPSJ queries. In this paper, we propose a technique to optimize the execution of GPSJ queries by formulating and evaluating different execution plans on the multistore. In particular, we outline different strategies to carry out joins and data fusion by relying on different schema representations; then, a self-learning black-box cost model is used to estimate execution times and select the most efficient plan. The experiments assess the effectiveness of the cost model in choosing the best execution plan for the given queries and exploit multiple multistore benchmarks to investigate the factors that influence the performance of different plans.

Suggested Citation

  • Chiara Forresi & Matteo Francia & Enrico Gallinucci & Matteo Golfarelli, 2023. "Cost-based Optimization of Multistore Query Plans," Information Systems Frontiers, Springer, vol. 25(5), pages 1925-1951, October.
    • Handle: RePEc:spr:infosf:v:25:y:2023:i:5:d:10.1007_s10796-022-10320-2
    DOI: 10.1007/s10796-022-10320-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10796-022-10320-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10796-022-10320-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:infosf:v:25:y:2023:i:5:d:10.1007_s10796-022-10320-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.