On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems.

Gianluigi Greco|Francesco Scarcello


Anthology ID:DBLP:conf/cikm/GrecoS05
Volume:Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005
Year:2005
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:36-43
URL:https://doi.org/10.1145/1099554.1099564
DOI:https://doi.org/10.1145/1099554.1099564
DBLP:conf/cikm/GrecoS05
BibTeX:
@inproceedings{greco-2005-complexity, author = {Gianluigi Greco and Francesco Scarcello}, editor = {Otthein Herzog and Hans-J\"{o}rg Schek and Norbert Fuhr and Abdur Chowdhury and Wilfried Teiken}, title = {{On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems}}, booktitle = {{Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005}}, pages = {36--43}, publisher = {ACM}, year = {2005}, url = {https://doi.org/10.1145/1099554.1099564}, doi = {https://doi.org/10.1145/1099554.1099564} }