TY - GEN
T1 - Complexity of conjunctive query answering under access Limitations
AU - Calì, Andrea
AU - Razgon, Igor
N1 - Publisher Copyright:
Copyright © (2014) by Universita Reggio Calabria & Centro di Competenza (ICT-SUD) All rights reserved.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84914145397&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84914145397
T3 - 22nd Italian Symposium on Advanced Database Systems, SEBD 2014
SP - 256
EP - 263
BT - 22nd Italian Symposium on Advanced Database Systems, SEBD 2014
PB - Universita Reggio Calabria and Centro di Competenza (ICT-SUD)
T2 - 22nd Italian Symposium on Advanced Database Systems, SEBD 2014
Y2 - 16 June 2014 through 18 June 2014
ER -