Abstract
The Linked Data initiative promotes the publication of previously isolated databases as interlinked RDF datasets, thereby creating a global scale data space. Datasets are frequently interlinked using some automated matching process that results in a materialized sameAs linkset, that is, a set of links of the form (s, owl:sameAs, o), which asserts that s denotes the same resource as o. This paper proposes strategies to reduce the cognitive overhead of creating materialized sameAs linksets and to correctly maintain them. The paper also outlines an architecture to improve the support for materialized sameAs linksets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexander, K., Cyganiak, R., Hausenblas, M., Zhao, J. (2011) Describing Linked Triplesets with the VoID Vocabulary. W3C Interest Group Note (March 3, 2011)
Berners-Lee, T.: Linked Data (2006), http://www.w3.org/DesignIssues/LinkedData.html
Isele, R., Jentzsch, A., Bizer, C.: Efficient Multidimensional Blocking for Link Discovery without losing Recall. In: Proc. WebDB (2011)
Leme, L.A.P.P., Lopes, G.R., Nunes, B.P., Casanova, M.A., Dietze, S.: Identifying candidate datasets for data interlinking. In: Daniel, F., Dolog, P., Li, Q. (eds.) ICWE 2013. LNCS, vol. 7977, pp. 354–366. Springer, Heidelberg (2013)
Lopes, G.R., Leme, L.A.P.P., Nunes, B.P., Casanova, M.A., Dietze, S.: Recommending Tripleset Interlinking through a Social Network Approach. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds.) WISE 2013, Part I. LNCS, vol. 8180, pp. 149–161. Springer, Heidelberg (2013)
Möller, K., Bechhofer, S., Heath, T.: Semantic Web Conference Ontology (2009), http://data.semanticweb.org/ns/swc/ontology
Nikolov, A., d’Aquin, M., Motta, E.: What should I link to? Identifying relevant sources and classes for data linking. In: Pan, J.Z., Chen, H., Kim, H.-G., Li, J., Wu, Z., Horrocks, I., Mizoguchi, R., Wu, Z. (eds.) JIST 2011. LNCS, vol. 7185, pp. 284–299. Springer, Heidelberg (2012)
Ngonga Ngomo, A.-C., Auer, S.: LIMES - A Time-Efficient Approach for Large-Scale Link Discovery on the Web of Data. In: Proc. IJCAI 2011, pp. 2312–2317 (2011)
Ourofino, C.G.: Materialização e Manutenção de Ligações owl:sameAs. M.Sc. Dissertation. Dept. Informatics, Pontifical Catholic University of Rio de Janeiro (2013)
Popitsch, N., Haslhofer, B.: DSNotify – A Solution for event detection and link maintenance in dynamic triplesets. Journal of Web Semantics 9(3), 266–283 (2011)
Staudt, M., Jarke, M.: Incremental maintenance of externally materialized views. In: Proc. VLDB 1996, pp. 75–86 (1996)
Vidal, V.M.P., Casanova, M.A., Cardoso, D.S.: Incremental Maintenance of RDF Views of Relational Data. In: Meersman, R., Panetto, H., Dillon, T., Eder, J., Bellahsene, Z., Ritter, N., De Leenheer, P., Dou, D. (eds.) ODBASE 2013. LNCS, vol. 8185, pp. 572–587. Springer, Heidelberg (2013)
Volz, J., Bizer, C., Gaedke, M., Kobilarov, G.: Discovering and Maintaining Links on the Web of Data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 650–665. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Casanova, M.A., Vidal, V.M.P., Lopes, G.R., Leme, L.A.P.P., Ruback, L. (2014). On Materialized sameAs Linksets. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 2014. Lecture Notes in Computer Science, vol 8644. Springer, Cham. https://doi.org/10.1007/978-3-319-10073-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-10073-9_31
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10072-2
Online ISBN: 978-3-319-10073-9
eBook Packages: Computer ScienceComputer Science (R0)