Slicing linked data by extracting significant, self-describing subsets: the DBpedia case

作者: Michele Minno , Davide Palmisano , Michele Mostarda

DOI: 10.1007/978-3-642-16985-4_20

关键词:

摘要: The Linked Data cloud is a huge set of data sources, the same objects being instances many different ontologies and described by overlapping concepts properties. This paper shows an innovative approach to represent in unambiguous homogeneous way such large, highly unpredictable, linked ontologies. Instead making use external, static ad-hoc devised knowledge bases, followed this leverages existing ontology univocally identify all Following kind approach, views over can be devised, depending which spot we choose see things through.

参考文章(3)
Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati, Data complexity of query answering in description logics Artificial Intelligence. ,vol. 195, pp. 335- 360 ,(2013) , 10.1016/J.ARTINT.2012.10.003
Jorge Pérez, Marcelo Arenas, Claudio Gutierrez, Semantics and complexity of SPARQL ACM Transactions on Database Systems. ,vol. 34, pp. 1- 45 ,(2009) , 10.1145/1567274.1567278
Jorge Pérez, Marcelo Arenas, Claudio Gutierrez, Semantics and complexity of SPARQL international semantic web conference. pp. 30- 43 ,(2006) , 10.1007/11926078_3