The ACE theorem for querying the web of data

Authors:
Jürgen Umbrich;Claudio Gutierrez;Aidan Hogan;Marcel Karnstedt;Josiane Xavier Parreira
Affiliations:
Fujitsu (Ireland) Limited, Dublin, Ireland, Galway, Ireland;DCC, Universidad de Chile, Santiago, Chile, Santiago, Chile;DERI Galway, NUI Galway, Ireland, Galway, Ireland;DERI Galway, NUI Galway, Ireland, Galway, Ireland;DERI Galway, NUI Galway, Ireland, Galway, Ireland
Venue:
Proceedings of the 22nd international conference on World Wide Web companion
Year:
2013

Citing 1
Cited 0

Towards robust distributed systems (abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by the CAP theorem, we identify three desirable properties when querying the Web of Data: Alignment (results up-to-date with sources), Coverage (results covering available remote sources), and Efficiency (bounded resources). In this short paper, we show that no system querying the Web can meet all three ACE properties, but instead must make practical trade-offs that we outline.