RWTH Aachen University
Data redundancy resides in most, if not all, information systems. Linked data is no exception. Existing approaches try to avoid data redundancies by proposing compression techniques or succinct data structures. However, data redundancies in linked data are useful sometimes, e.g., ontology based data access can make use of a-box redundancies to avoid unnecessary query rewritings. Either users want to avoid it or make use of it, a good understanding about data redundancies will facilitate their task, e.g., identify the exact redundant parts which could be utilized or choose most effective techniques to compress a particular dataset.