Equivalent Rewritings on Path Views with Binding Patterns

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 guar...

Descripción completa

Detalles Bibliográficos
Autores principales: Romero, Julien, Preda, Nicoleta, Amarilli, Antoine, Suchanek, Fabian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7250601/
http://dx.doi.org/10.1007/978-3-030-49461-2_26
_version_ 1783538793491464192
author Romero, Julien
Preda, Nicoleta
Amarilli, Antoine
Suchanek, Fabian
author_facet Romero, Julien
Preda, Nicoleta
Amarilli, Antoine
Suchanek, Fabian
author_sort Romero, Julien
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7250601
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-72506012020-05-27 Equivalent Rewritings on Path Views with Binding Patterns Romero, Julien Preda, Nicoleta Amarilli, Antoine Suchanek, Fabian The Semantic Web Article 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. 2020-05-07 /pmc/articles/PMC7250601/ http://dx.doi.org/10.1007/978-3-030-49461-2_26 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Romero, Julien
Preda, Nicoleta
Amarilli, Antoine
Suchanek, Fabian
Equivalent Rewritings on Path Views with Binding Patterns
title Equivalent Rewritings on Path Views with Binding Patterns
title_full Equivalent Rewritings on Path Views with Binding Patterns
title_fullStr Equivalent Rewritings on Path Views with Binding Patterns
title_full_unstemmed Equivalent Rewritings on Path Views with Binding Patterns
title_short Equivalent Rewritings on Path Views with Binding Patterns
title_sort equivalent rewritings on path views with binding patterns
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7250601/
http://dx.doi.org/10.1007/978-3-030-49461-2_26
work_keys_str_mv AT romerojulien equivalentrewritingsonpathviewswithbindingpatterns
AT predanicoleta equivalentrewritingsonpathviewswithbindingpatterns
AT amarilliantoine equivalentrewritingsonpathviewswithbindingpatterns
AT suchanekfabian equivalentrewritingsonpathviewswithbindingpatterns

Ejemplares similares