Complexity of conjunctive query answering under access Limitations

Andrea Calì, Igor Razgon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The Deep Web consists of data accessible through HTML forms but not as web pages; usually such data are modelled as relations that can be queried only by operating a selection on certain attributes - such restrictions are called access limitations. In this paper we illus- Trate the problem of Boolean conjunctive query answering under access limitations; we define and motivate the problem's two main cases, we provide some preliminary results on its computational complexity and we suggest some research directions.

Original languageEnglish
Title of host publication22nd Italian Symposium on Advanced Database Systems, SEBD 2014
PublisherUniversita Reggio Calabria and Centro di Competenza (ICT-SUD)
Pages256-263
Number of pages8
ISBN (Electronic)9781634391450
StatePublished - 1 Jan 2014
Externally publishedYes
Event22nd Italian Symposium on Advanced Database Systems, SEBD 2014 - Castellammare di Stabia, Italy
Duration: 16 Jun 201418 Jun 2014

Publication series

Name22nd Italian Symposium on Advanced Database Systems, SEBD 2014

Conference

Conference22nd Italian Symposium on Advanced Database Systems, SEBD 2014
Country/TerritoryItaly
CityCastellammare di Stabia
Period16/06/1418/06/14

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Complexity of conjunctive query answering under access Limitations'. Together they form a unique fingerprint.

Cite this