Answering queries using views: A survey
From MaRDI portal
Publication:5959564
DOI10.1007/S007780100054zbMath1012.68910DBLPjournals/vldb/Halevy01OpenAlexW2152191782WikidataQ56659367 ScholiaQ56659367MaRDI QIDQ5959564
Publication date: 3 June 2003
Published in: The VLDB Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s007780100054
Related Items (45)
A method of eliminating information disclosure in view publishing ⋮ Knowledge base exchange: the case of OWL 2 QL ⋮ Methods for solving the mean query execution time minimization problem ⋮ Exact Query Reformulation with First-Order Ontologies and Databases ⋮ View disassembly: A rewrite that extracts portions of views ⋮ Query optimization in information integration ⋮ View-based query processing: on the relationship between rewriting, answering and losslessness ⋮ Rewriting queries using views with access patterns under integrity constraints ⋮ A formal analysis of information disclosure in data exchange ⋮ Using views to generate efficient evaluation plans for queries ⋮ Strong simulation ⋮ On simplification of schema mappings ⋮ Semantic query optimization in the presence of types ⋮ The notion of abstraction in ontology-based data management ⋮ View-based query answering in description logics: semantics and complexity ⋮ Rewriting with Acyclic Queries: Mind Your Head ⋮ Determinacy and query rewriting for conjunctive queries and views ⋮ Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States. ⋮ Rewriting XPath queries using materialized XPath views ⋮ Reconcilable differences ⋮ AUTOMATIC SERVICE COMPOSITION VIA SIMULATION ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models ⋮ An analytical approach to the inference of summary data of additive type ⋮ Queries and materialized views on probabilistic databases ⋮ On the finite controllability of conjunctive query answering in databases under open-world assumption ⋮ Towards an algebraic theory of information integration ⋮ Tractable query answering and rewriting under description logic constraints ⋮ Decidable containment of recursive queries ⋮ XML queries and constraints, containment and reformulation ⋮ Data exchange: semantics and query answering ⋮ Minimal-change integrity maintenance using tuple deletions ⋮ Query evaluation on a database given by a random graph ⋮ On the complexity of entailment in existential conjunctive first-order logic with atomic negation ⋮ The relational grid monitoring architecture: Mediating information about the grid ⋮ Data Privacy for $\mathcal{ALC}$ Knowledge Bases ⋮ Minimal invariant sets in a vertex-weighted graph ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ Traversing Ontologies to Extract Views ⋮ Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ A Single Approach to Decide Chase Termination on Linear Existential Rules ⋮ A Top-Down Approach to Rewriting Conjunctive Queries Using Views ⋮ Rewriting Conjunctive Queries over Description Logic Knowledge Bases ⋮ Rewriting union queries using views
This page was built for publication: Answering queries using views: A survey
