TY - GEN
T1 - Support of part-whole relations in query answering
AU - Kozikowski, Piotr
AU - Ioannou, Ekaterini
AU - Velegrakis, Yannis
AU - Guerra, Francesco
PY - 2015/1/1
Y1 - 2015/1/1
N2 - Part-whole relations are ubiquitous in our world, yet they do not get “first-class” treatment in the data managements systems most commonly used today. One aspect of part-whole relations that is particularly important is that of attribute transitivity. Some attributes of a whole are also attributes of its parts, and vice versa. We propose an extension to a generic entity-centric data model to support part-whole relations and attribute transitivity and provide more meaningful results to certain types of queries as a result. We describe how this model can be implemented using an RDF repository and three approaches to infer the implicit information necessary for query answering that adheres to the semantics of the model. The first approach is a naive implementation and the other two use indexing to improve performance. We evaluate several aspects of our implementations in a series of experimental results that show that the two approaches that use indexing are far superior to the naive approach and exhibit some advantages and disadvantages when compared to each other.
AB - Part-whole relations are ubiquitous in our world, yet they do not get “first-class” treatment in the data managements systems most commonly used today. One aspect of part-whole relations that is particularly important is that of attribute transitivity. Some attributes of a whole are also attributes of its parts, and vice versa. We propose an extension to a generic entity-centric data model to support part-whole relations and attribute transitivity and provide more meaningful results to certain types of queries as a result. We describe how this model can be implemented using an RDF repository and three approaches to infer the implicit information necessary for query answering that adheres to the semantics of the model. The first approach is a naive implementation and the other two use indexing to improve performance. We evaluate several aspects of our implementations in a series of experimental results that show that the two approaches that use indexing are far superior to the naive approach and exhibit some advantages and disadvantages when compared to each other.
UR - http://www.scopus.com/inward/record.url?scp=84955301952&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-27932-9_9
DO - 10.1007/978-3-319-27932-9_9
M3 - Conference contribution
AN - SCOPUS:84955301952
SN - 9783319279312
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 94
EP - 107
BT - Semantic Keyword-Based Search on Structured Data Sources First COST Action IC1302 – International KEYSTONE Conference, IKC 2015, Revised Selected Papers
A2 - Velegrakis, Yannis
A2 - Cardoso, Jorge
A2 - Cardoso, Jorge
A2 - Pinto, Alexandre Miguel
A2 - Guerra, Francesco
A2 - Houben, Geert-Jan
PB - Springer
T2 - 1st COST Action IC1302 International KEYSTONE Conference on Semantic Keyword-Based Search on Structured Data Sources, IKC 2015
Y2 - 8 September 2015 through 9 September 2015
ER -