Equivalent Rewritings on Path Views with Binding Patterns

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.

33 pages including 16 pages of main text. This is the full version of the ESWC'2020 article, which integrates all reviewer feedback, with the same text as the publisher version except minor changes. Several corrections relative to the first version