Recursive query plans for data integration

DOI10.1016/S0743-1066(99)00025-4zbMath0949.68063OpenAlexW2093480367WikidataQ44493509 ScholiaQ44493509MaRDI QIDQ4948026

Oliver M. Duschka, Michael R. Genesereth, Alon Y. Halevy

Publication date: 26 April 2000

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(99)00025-4

zbMATH Keywords

conjunctive plansrecursive query answering plans

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Related Items (16)

On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ A novel architecture of metadata management system based on intelligent cache ⋮ Deductive databases for computing certain and consistent answers from mediated data integration systems ⋮ Query optimization in information integration ⋮ Relaxed notions of schema mapping equivalence revisited ⋮ Rewriting queries using views with access patterns under integrity constraints ⋮ Query containment for data integration systems ⋮ On the content of materialized aggregate views ⋮ Tractable reasoning and efficient query answering in description logics: The DL-Lite family ⋮ On the finite controllability of conjunctive query answering in databases under open-world assumption ⋮ Rewriting of regular expressions and regular path queries ⋮ Data exchange: semantics and query answering ⋮ Minimal-change integrity maintenance using tuple deletions ⋮ Conceptual Modeling for Data Integration ⋮ Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies ⋮ Rewriting union queries using views

This page was built for publication: Recursive query plans for data integration