{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T11:11:01Z","timestamp":1723547461268},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T00:00:00Z","timestamp":1430179200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>Versioning has proven to be essential in areas like software development or data and knowledge management. For systems or applications making use of documents formatted according to the Resource Description Framework (RDF) standard, it is difficult to calculate the difference between two versions, owing to the presence of blank nodes, also known as bnodes in RDF graphs. These are anonymous nodes that can assume different identifiers between versions. In this case, the challenge lies in finding a mapping between the sets of blank nodes in the two versions while minimizing the operations needed to convert one version into another.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Methods<\/jats:title>\n            <jats:p>Within this context, we propose an algorithm, named <jats:italic>ApproxMap<\/jats:italic>, for mapping bnodes based on extended concepts of rough set theory, which provides a way to measure the proximity of bnodes and map them with closer approximations. Our heuristic method considers various strategies for reducing both the number of comparisons between blank nodes and the delta between the compared versions. The proposed algorithm has a worst-case time complexity of <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>\n              <jats:sup>2<\/jats:sup>).<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Results<\/jats:title>\n            <jats:p>\n              <jats:italic>ApproxMap<\/jats:italic> showed satisfactory performance in our groups of experiments, as the algorithm that obtained solutions closest to the optimal values. This algorithm succeeded in finding the optimal delta size in 59% of the tests involving optimal values. <jats:italic>ApproxMap<\/jats:italic> achieved a delta size smaller than or equal to those of existing algorithms in at least 95% of the tested cases.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Conclusions<\/jats:title>\n            <jats:p>The results show that the proposed algorithm can be successfully applied to versioning RDF documents, such as that produced by software processes with iterative and incremental development. We recommend applying <jats:italic>ApproxMap<\/jats:italic> in various situations, particularly those involving similar versions and directly connected bnodes.<\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/s13173-015-0022-3","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T16:52:15Z","timestamp":1430153535000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ApproxMap - a method for mapping blank nodes in RDF datasets"],"prefix":"10.1186","volume":"21","author":[{"given":"Juliano de","family":"Almeida Monte-Mor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adilson Marques","family":"da Cunha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,28]]},"reference":[{"key":"22_CR1","unstructured":"Klyne G, Carroll JJ, McBride B (2014) RDF 1.1 concepts and abstract syntax. World Wide Web Consortium, Recommendation. http:\/\/www.w3.org\/TR\/rdf11-concepts."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Monte-Mor JA, Cunha AM (2014) Galo: a semantic method for software configuration management In: Information Technology: New Generations (ITNG), 2014 11th International Conference On, 33\u201339.","DOI":"10.1109\/ITNG.2014.66"},{"key":"22_CR3","volume-title":"A Semantic Web prime","author":"G Antoniou","year":"2004","unstructured":"Antoniou G, van Hatrmelen F (2004) A Semantic Web prime. The MIT Press, London, England. p. 238."},{"key":"22_CR4","unstructured":"Lee TB, Connolly D (2001) Delta: an ontology for the distribution of differences between RDF graphs. Technical report, W3C. http:\/\/www.w3.org\/DesignIssues\/Diff."},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1993053.1993056","volume":"5","author":"D Zeginis","year":"2011","unstructured":"Zeginis D, Tzitzikas Y, Christophides V (2011) On computing deltas of RDF\/s knowledge bases. ACM Trans Web 5(3): 14\u201311436.","journal-title":"ACM Trans Web"},{"key":"22_CR6","first-page":"591","volume-title":"Proceedings of the 11th International Conference on The Semantic Web - Volume Part I. ISWC\u201912","author":"Y Tzitzikas","year":"2012","unstructured":"Tzitzikas Y, Lantzaki C, Zeginis D (2012) Blank node matching and RDF\/s comparison functions In: Proceedings of the 11th International Conference on The Semantic Web - Volume Part I. ISWC\u201912, 591\u2013607.. Springer, Berlin, Heidelberg."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inform Sci 11: 341\u2013356.","journal-title":"Int J Comput Inform Sci"},{"issue":"3","key":"22_CR8","first-page":"621","volume":"11","author":"M do Carmo Nicoletti","year":"2001","unstructured":"do Carmo Nicoletti M, Uch\u00f4a JQ, Baptistini MTZ (2001) Rough relation properties. Int J Appl Math Comput Sci 11(3): 621\u2013635.","journal-title":"Int J Appl Math Comput Sci"},{"key":"22_CR9","first-page":"5","volume-title":"Proceedings of the First International Semantic Web Conference on The Semantic Web. ISWC \u201902","author":"JJ Carroll","year":"2002","unstructured":"Carroll JJ (2002) Matching RDF graphs In: Proceedings of the First International Semantic Web Conference on The Semantic Web. ISWC \u201902, 5\u201315.. Springer, London, UK."},{"key":"22_CR10","first-page":"259","volume-title":"ISWC2004, Proceeding of the 3rd International Semantic Web Conference, Hiroshima, Japan, November 7-11, 2004","author":"NF Noy","year":"2004","unstructured":"Noy NF, Kunnatur H, Klein M, Musen MA (2004) Tracking changes during ontology evolution In: ISWC2004, Proceeding of the 3rd International Semantic Web Conference, Hiroshima, Japan, November 7-11, 2004, 259\u2013273.. Springer, Berlin, Heidelberg."},{"key":"22_CR11","first-page":"744","volume-title":"Eighteenth National Conference on Artificial Intelligence","author":"NF Noy","year":"2002","unstructured":"Noy NF, Musen MA (2002) Promptdiff: a fixed-point algorithm for comparing ontology versions In: Eighteenth National Conference on Artificial Intelligence, 744\u2013750.. American Association for Artificial Intelligence, Menlo Park, CA, USA."},{"issue":"4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MIS.2004.33","volume":"19","author":"NF Noy","year":"2004","unstructured":"Noy NF, Musen MA (2004) Ontology versioning in an ontology management framework. IEEE Intell Syst 19(4): 6\u201313.","journal-title":"IEEE Intell Syst"},{"key":"22_CR13","first-page":"55","volume-title":"Proceedings of the 6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics. PSI\u201906","author":"S Auer","year":"2006","unstructured":"Auer S, Herre H (2006) A versioning and evolution framework for RDF knowledge bases In: Proceedings of the 6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics. PSI\u201906, 55\u201369.. Springer, Berlin, Heidelberg."},{"key":"22_CR14","unstructured":"V\u00f6lkel M, Groza T (2006) SemVersion: An RDF-based ontology versioning system. In: Nunes MB (ed)Proceedings of IADIS International Conference on WWW\/Internet (IADIS 2006), 195\u2013202, Murcia, Spain."},{"key":"22_CR15","first-page":"5","volume-title":"ICSOFT 2007, Proceedings of the Second International Conference on Software and Data Technologies, Volume ISDM\/EHST\/DC, Barcelona, Spain, July 22-25, 2007","author":"S Cassidy","year":"2007","unstructured":"Cassidy S, Ballantine J (2007) Version control for RDF triple stores. In: Filipe J, Shishkov B, Helfert M (eds)ICSOFT 2007, Proceedings of the Second International Conference on Software and Data Technologies, Volume ISDM\/EHST\/DC, Barcelona, Spain, July 22-25, 2007, 5\u201312.. INSTICC Press, Setubal, Portugal."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0218194012500040","volume":"22","author":"D-H Im","year":"2012","unstructured":"Im D-H, Lee S-W, Kim H-J (2012) A version management framework for RDF triple stores. Int J Softw Eng Knowl Eng 22(1): 85\u2013106.","journal-title":"Int J Softw Eng Knowl Eng"},{"key":"22_CR17","first-page":"637","volume-title":"Proceedings of the 6th International The Semantic Web and 2nd Asian Conference on Asian Semantic Web Conference. ISWC\u201907\/ASWC\u201907","author":"D Zeginis","year":"2007","unstructured":"Zeginis D, Tzitzikas Y, Christophides V (2007) On the foundations of computing deltas between RDF models In: Proceedings of the 6th International The Semantic Web and 2nd Asian Conference on Asian Semantic Web Conference. ISWC\u201907\/ASWC\u201907, 637\u2013651.. Springer, Berlin, Heidelberg."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart 2: 83\u201397.","journal-title":"Naval Res. Logist. Quart"},{"key":"22_CR19","unstructured":"Uch\u00f4a JQ (1998) Representa\u00e7\u00e3o e indu\u00e7\u00e3o de conhecimento usando teoria de conjuntos aproximados. Master\u2019s thesis, Universidade Federal de S\u00e3o Carlos, S\u00e3o Carlos, Brasil."},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ins.2006.06.006","volume":"177","author":"Z Pawlak","year":"2007","unstructured":"Pawlak Z, Skowron A (2007) Rough sets: some extensions. Inform Sci 177(1): 28\u201340.","journal-title":"Inform Sci"},{"key":"22_CR21","unstructured":"Isele R, Umbrich J, Bizer C, Harth A (2010) Ldspider: An open-source crawling framework for the web of linked data. In: Polleres A Chen H (eds)ISWC Posters & Demos. CEUR Workshop Proceedings.. CEUR-WS.org."},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009081901","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer C, Heath T, Berners-Lee T (2009) Linked data - the story so far. Int J Semantic Web Inf Syst 5(3): 1\u201322.","journal-title":"Int J Semantic Web Inf Syst"},{"issue":"2-3","key":"22_CR23","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo Y, Pan Z, Heflin J (2005) LUBM: a benchmark for owl knowledge base systems. Web Semant 3(2-3): 158\u2013182.","journal-title":"Web Semant"},{"issue":"2","key":"22_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer C, Schultz A (2009) The Berlin SPARQL benchmark. Int J Semantic Web Inform Syst 5(2): 1\u201324.","journal-title":"Int J Semantic Web Inform Syst"}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-015-0022-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13173-015-0022-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-015-0022-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-015-0022-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T10:45:50Z","timestamp":1723545950000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1186\/s13173-015-0022-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,28]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1186\/s13173-015-0022-3","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"type":"print","value":"0104-6500"},{"type":"electronic","value":"1678-4804"}],"subject":[],"published":{"date-parts":[[2015,4,28]]},"assertion":[{"value":"21 October 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"3"}}