Skip to Main content Skip to Navigation
Conference papers

Determining Relevance of Accesses at Runtime

Abstract : Consider the situation where a query is to be answered using Web sources that restrict the accesses that can be made on backend relational data by requiring some attributes to be given as input of the service. The accesses provide lookups on the collection of attributes values that match the binding. They can differ in whether or not they require arguments to be generated from prior accesses. Prior work has focused on the question of whether a query can be answered using a set of data sources, and in developing static access plans (e.g., Datalog programs) that implement query answering. We are interested in dynamic aspects of the query answering problem: given partial information about the data, which accesses could provide relevant data for answering a given query? We consider immediate and long-term notions of "relevant accesses", and ascertain the complexity of query relevance, for both conjunctive queries and arbitrary positive queries.
Document type :
Conference papers
Complete list of metadata
Contributor : Pierre Senellart Connect in order to contact the contributor
Submitted on : Tuesday, May 10, 2011 - 11:05:29 AM
Last modification on : Tuesday, September 8, 2020 - 4:58:02 PM


  • HAL Id : inria-00591793, version 1



Michael Benedikt, Georg Gottlob, Pierre Senellart. Determining Relevance of Accesses at Runtime. PODS, Jun 2011, Athènes, Greece. ⟨inria-00591793⟩



Record views