Complexity of conjunctive query answering under access limitations (preliminary report)
Andrea Calı̀, Igor Razgon · BIROn (Birkbeck, University of London) · 2014
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 illustrate 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.