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

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Gianluigi Greco Università della Calabria, Rende, Italy
Francesco Scarcello Università della Calabria, Rende, Italy
Published in:
Cover Image
 
· Proceeding
CIKM '05 Proceedings of the 14th ACM international conference on Information and knowledge management
Pages 36-43
ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-140-6 doi>10.1145/1099554.1099564
On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 22
· Downloads (cumulative): 544
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder