DOCSLIB.ORG

Sustainable Linked Data Generation: the Case of Dbpedia ⋆

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sustainable Linked Data Generation: the Case of Dbpedia ⋆ Sustainable Linked Data Generation: The Case of DBpedia ? Wouter Maroy1, Anastasia Dimou1, Dimitris Kontokostas2, Ben De Meester1, Ruben Verborgh1, Jens Lehmann3,4, Erik Mannens1, and Sebastian Hellmann2 1 imec – IDLab, Department of Electronics and Information Systems, Ghent University, Ghent, Belgium {firstname.lastname}@ugent.be 2 Leipzig University – AKSW/KILT, Leipzig, Germany {lastname}@informatik.uni-leipzig.de 3 University of Bonn, Smart Data Analytics Group, Germany [email protected] 4 Fraunhofer IAIS, Sankt Augustin, Germany [email protected] Abstract. dbpedia ef, the generation framework behind one of the Linked Open Data cloud’s central interlinking hubs, has limitations with regard to quality, coverage and sustainability of the generated dataset. dbpedia can be further improved both on schema and data level. Errors and inconsistencies can be addressed by amending (i) the dbpedia ef; (ii) the dbpedia mapping rules; or (iii) Wikipedia itself from which it extracts information. However, even though the dbpedia ef and mapping rules are continuously evolving and several changes were applied to both of them, there are no significant improvements on the dbpedia dataset since its limitations were identified. To address these shortcomings, we propose adapting a different semantic-driven approach that decouples, in a declarative manner, the extraction, transformation and mapping rules execution. In this paper, we provide details regarding the new dbpedia ef, its architecture, technical implementation and extraction results. This way, we achieve an enhanced data generation process, which can be broadly adopted, and that improves its quality, coverage and sustainability. 1 Introduction The DBpedia Extraction Framework (dbpedia ef) [12] extracts raw data from Wikipedia and makes it available as Linked Data, forming the well-known and broadly used dbpedia dataset. The majority of the dbpedia dataset is derived through Wikipedia infobox templates, after being annotated by the DBpedia ontology5 [12]. The dbpedia dataset is further enriched with additional information ? The described research activities were funded by Ghent University, imec, Flanders Innovation & Entrepreneurship (AIO), the Fund for Scientific Research Flanders (FWO Flanders), and the EU’s H2020 program for ALIGNED (GA 644055). 5 http://dbpedia.org/ontology/ 2 Wouter Maroy et al. derived from the articles such as free text, abstracts, images, links to other Web pages, and tables. Mapping Templates, i.e., rules generating most of the dbpedia dataset from Wikipedia are executed by the dbpedia ef, defined by a world-wide crowd-sourcing effort, and maintained via the DBpedia mappings wiki6. Even though dbpedia is one of the central interlinking hubs in the Linked Open Data (lod) cloud [17], its generation framework has limitations that reflect on the generated dataset [14,19]. We distinguish two types of issues with dbpedia: schema-level rules that define how to apply vocabularies to raw data [6,10,14], e.g., the dbo:militaryBranch property is used for entities of dbo:MilitaryUnit type, but it should only be used with entities of dbo:Person type [13]. data-level extracted, or processed and transformed data values. The former includes incorrect, incomplete or irrelevant extracted values and datatypes, or not (well-)recognized templates [19]; the latter issues with parsing values [18], interpreting/converting units [18], or transforming cardinal direction [15]. Errors or inconsistencies in dbpedia can be addressed by amending the dbpedia ef, mapping rules, or Wikipedia itself [19]. However, even though several changes were applied to both the dbpedia ef and mapping rules [12], quality issues still persist. For instance, 32% of its mapping rules are involved in at least one inconsistency [13], and more than half of all cardinal direction relations are still invalid or incorrect [15]. These issues challenge dbpedia dataset’s usage, hence the demands for dbpedia ef to improve in terms of expressivity, i.e., level of details that a user can specify in mapping rules, semantic flexibility, i.e., possibility to interchange among different schemas, and modularity, i.e., declarative rules and modular components for extraction, transformation and mapping. Given that quality issues persist over a long period of time [13, 15], the custom dbpedia ef appears to not meet the above and more foundational changes are required. In this work, we show that the coupling among extraction, i.e., retrieving data from Wikipedia, transformation, i.e., processing the extracted data values, and mapping rules execution, i.e., applying semantic annotations to the retrieved and transformed data values, contributes to dbpedia ef’s inadequacy to cope with the increasing demands for high quality Linked Data. While just decoupling these processes and keeping them hard-coded is just (re-)engineering, we look into a radical solution that turns the dbpedia ef more semantic rather than just a black-box. The goal is to adjust the current dbpedia ef and provide a general-purpose and more sustainable framework that enables more added value. For instance, in terms of semantic flexibility, interchanging among different schema annotations should be supported, instead of e.g., being coupled to a certain ontology as it is now, and allowing only certain semantic representation. In this paper, we show how we incorporate in the existing dbpedia ef a general-purpose semantic-driven Linked Data generation approach, based on rml [7]. It replaces the current solution, decouples extraction, transformations and conditions from dbpedia ef, and enables generating high quality Linked Data for dbpedia. The activities to achieve this solution started as a GSoC2016 6 http://mappings.dbpedia.org/index.php/Main_Page Sustainable Linked Data Generation: The Case of DBpedia 3 project7 8 and continue till nowdays. Our contribution is three-fold: we (i) outline the limitations of the current dbpedia ef; (ii) identify the requirements for a more sustainable approach; and (iii) incorporate a generic approach that fulfills those requirements to the current dbpedia ef and compare the two approaches. The paper is organized as follows: after outlining the state of the art (Section 2), we detail the current dbpedia ef limitations and requirements for a sustainable framework (Section 3). In Section 4, we introduce our approach, and provide a corresponding implementation. In Section 5, we provide the results of our approach’s evaluation. Finally, we summarize our conclusions in Section 6. 2 Background and Related Work In this section, we discuss related work in Linked Data generation (Section 2.1) and we outline the current dbpedia ef functionality (Section 2.2). 2.1 State of the Art In the past, case-specific solutions were established for Linked Data generation, which couple schema and data transformations. xslt- or xpath-based approaches were established for generating Linked Data from data originally in xml format, e.g., AstroGrid-D9. There are also query-oriented languages that combine sparql with other languages or custom alignments to the underlying data structure. For instance, xsparql [1] maps data in xml format and Tarql10 data in csv. Nevertheless, those approaches cannot be extended to cover other data sources. Different approaches emerged to define data transformations declaratively, such as volt [16] for sparql, Hydra [11] for Web Services, or fno [4]. Hydra or volt depend on the underlying system (Web Services and sparql, respectively), thus their use is inherently limited to it. Using Hydra descriptions for executing transformations only works online, whereas volt only works for data already existing in a sparql endpoint. Describing the transformations using fno does not include this dependency, thus allows for reuse in other use cases and technologies. 2.2 DBpedia Extraction Framework The dbpedia Extraction Framework (dbpedia ef) generates the dbpedia dataset [12]. It extracts data from Wikipedia, such as infobox templates or abstracts. The dbpedia ef consumes a source, i.e., an abstraction of a set of Wiki pages in wikitext syntax, parses it with a Wiki parser, and transforms it in an Abstract Syntax Tree (ast). To process the page’s content, several ast-processing com- ponents, called extractors (e.g., Mapping Extractor, Geo Extractor), traverse a Wiki page’s ast and generate rdf triples. Eventually the dbpedia ef forwards them to a sink that outputs them to different datasets based on their properties. 7 www.mail-archive.com/[email protected]/msg07837.html 8 https://summerofcode.withgoogle.com/projects/#6213126861094912 9 http://www.gac-grid.de/project-products/Software/XML2RDF.html 10 https://tarql.github.io/ 4 Wouter Maroy et al. Extractors The core dbpedia ef components are the extractors, whose common main functionality is to traverse the ast-representation of a Wiki page and gen- erate rdf triples based on the syntax tree and other heuristics. Many extractors contribute in forming the dbpedia dataset [12, Section 2.2]. A prominent one is the Mapping-Based Infobox Extractor, which uses manually written mapping rules that relate infoboxes in Wikipedia to terms in dbpedia ontology, and generates rdf triples. It is the most important extractor, as the most valuable content of dbpedia dataset is derived from infoboxes [12], and covers the greatest part of the dbpedia ontology. Infobox templates are defined in wiki syntax and summarize information related to a page’s article in a structured,
Load more

Recommended publications
  • Introduction to Linked Data and Its Lifecycle on the Web
    Introduction to Linked Data and its Lifecycle on the Web Sören Auer, Jens Lehmann, Axel-Cyrille Ngonga Ngomo, Amrapali Zaveri AKSW, Institut für Informatik, Universität Leipzig, Pf 100920, 04009 Leipzig {lastname}@informatik.uni-leipzig.de http://aksw.org Abstract. With Linked Data, a very pragmatic approach towards achieving the vision of the Semantic Web has gained some traction in the last years. The term Linked Data refers to a set of best practices for publishing and interlinking struc- tured data on the Web. While many standards, methods and technologies devel- oped within by the Semantic Web community are applicable for Linked Data, there are also a number of specific characteristics of Linked Data, which have to be considered. In this article we introduce the main concepts of Linked Data. We present an overview of the Linked Data lifecycle and discuss individual ap- proaches as well as the state-of-the-art with regard to extraction, authoring, link- ing, enrichment as well as quality of Linked Data. We conclude the chapter with a discussion of issues, limitations and further research and development challenges of Linked Data. This article is an updated version of a similar lecture given at Reasoning Web Summer School 2011. 1 Introduction One of the biggest challenges in the area of intelligent information management is the exploitation of the Web as a platform for data and information integration as well as for search and querying. Just as we publish unstructured textual information on the Web as HTML pages and search such information by using keyword-based search engines, we are already able to easily publish structured information, reliably interlink this informa- tion with other data published on the Web and search the resulting data space by using more expressive querying beyond simple keyword searches.
    [Show full text]
  • Linked Data Services for Internet of Things
    International Conference on Recent Advances in Computer Systems (RACS 2015) Linked Data Services for Internet of Things Jaroslav Pullmann, Dr. Yehya Mohamad User-Centered Ubiquitous Computing department Fraunhofer Institute for Applied Information Technology FIT Sankt Augustin, Germany {jaroslav.pullmann, yehya.mohamad}@fit.fraunhofer.de Abstract — In this paper we present the open source “LinkSmart Resource Framework” allowing developers to II. LINKSMART RESOURCE FRAMEWORK incorporate heterogeneous data sources and physical devices through a generic service facade independent of the data model, A. Rationale persistence technology or access protocol. We particularly consi- The Java Data Objects standard [2] specifies an interface to der the integration and maintenance of Linked Data, a widely persist Java objects in a technology agnostic way. The related accepted means for expressing highly-structured, machine reada- ble (meta)data graphs. Thanks to its uniform, technology- Java Persistence specification [3] concentrates on object-rela- agnostic view on data, the framework is expected to increase the tional mapping only. We consider both specifications techno- ease-of-use, maintainability and usability of software relying on logy-driven, overly detailed with regards to common data ma- it. The development of various technologies to access, interact nagement tasks, while missing some important high-level with and manage data has led to rise of parallel communities functionality. The rationale underlying the LinkSmart Resour- often unaware of alternatives beyond their technology bounda- ce Platform is to define a generic, uniform interface for ries. Systems for object-relational mapping, NoSQL document or management, retrieval and processing of data while graph-based Linked Data storage usually exhibit complex, maintaining a technology and implementation agnostic facade.
    [Show full text]
  • Using Shape Expressions (Shex) to Share RDF Data Models and to Guide Curation with Rigorous Validation B Katherine Thornton1( ), Harold Solbrig2, Gregory S
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repositorio Institucional de la Universidad de Oviedo Using Shape Expressions (ShEx) to Share RDF Data Models and to Guide Curation with Rigorous Validation B Katherine Thornton1( ), Harold Solbrig2, Gregory S. Stupp3, Jose Emilio Labra Gayo4, Daniel Mietchen5, Eric Prud’hommeaux6, and Andra Waagmeester7 1 Yale University, New Haven, CT, USA [email protected] 2 Johns Hopkins University, Baltimore, MD, USA [email protected] 3 The Scripps Research Institute, San Diego, CA, USA [email protected] 4 University of Oviedo, Oviedo, Spain [email protected] 5 Data Science Institute, University of Virginia, Charlottesville, VA, USA [email protected] 6 World Wide Web Consortium (W3C), MIT, Cambridge, MA, USA [email protected] 7 Micelio, Antwerpen, Belgium [email protected] Abstract. We discuss Shape Expressions (ShEx), a concise, formal, modeling and validation language for RDF structures. For instance, a Shape Expression could prescribe that subjects in a given RDF graph that fall into the shape “Paper” are expected to have a section called “Abstract”, and any ShEx implementation can confirm whether that is indeed the case for all such subjects within a given graph or subgraph. There are currently five actively maintained ShEx implementations. We discuss how we use the JavaScript, Scala and Python implementa- tions in RDF data validation workflows in distinct, applied contexts. We present examples of how ShEx can be used to model and validate data from two different sources, the domain-specific Fast Healthcare Interop- erability Resources (FHIR) and the domain-generic Wikidata knowledge base, which is the linked database built and maintained by the Wikimedia Foundation as a sister project to Wikipedia.
    [Show full text]
  • Linked Data Vs Schema.Org: a Town Hall Debate About the Future of Information
    Linked Data vs Schema.org: A Town Hall Debate about the Future of Information Schema.org Resources Schema.org Microdata Creation and Analysis Tools Schema.org Google Structured Data Testing Tool http://schema.org/docs/full.html http://www.google.com/webmasters/tools/richsnippets The entire hierarchy in one file. Microdata Parser Schema.org FAQ http://tools.seomoves.org/microdata http://schema.org/docs/faq.html This tool parses HTML5 microdata on a web page and displays the results in a graphical view. You can see the full details of each microdata type by clicking on it. Getting Started with Schema.org http://schema.org/docs/gs.html Drupal module Includes information about how to mark up your content http://drupal.org/project/schemaorg using microdata, using the schema.org vocabulary, and advanced topics. A drop-in solution to enable the collections of schemas available at schema.org on your Drupal 7 site. Micro Data & Schema.org: Guide To Generating Rich Snippets Wordpress plugins http://seogadget.com/micro-data-schema-org-guide-to- http://wordpress.org/extend/plugins/tags/schemaorg generating-rich-snippets A list of Wordpress plugins that allow you to easily insert A very comprehensive guide that includes an schema.org microdata on your site. introduction, a section on integrating microdata (use cases) schema.org, and a section on tools and useful Microdata generator resources. http://www.microdatagenerator.com A simple generator that allows you to input basic HTML5 Microdata and Schema.org information and have that info converted into the http://journal.code4lib.org/articles/6400 standard schema.org markup structure.
    [Show full text]
  • FAIR Linked Data
    FAIR Linked Data - Towards a Linked Data backbone for users and machines Johannes Frey Sebastian Hellmann [email protected] Knowledge Integration and Linked Data Technologies (KILT/AKSW) & DBpedia Association InfAI, Leipzig University Leipzig, Germany ABSTRACT scientific and open data. While the principles became widely ac- Although many FAIR principles could be fulfilled by 5-star Linked cepted and popular, they lack technical details and clear, measurable Open Data, the successful realization of FAIR poses a multitude criteria. of challenges. FAIR publishing and retrieval of Linked Data is still Three years ago a dedicated European Commission Expert Group rather a FAIRytale than reality, for users and machines. In this released an action plan for "turning FAIR into reality" [1] empha- paper, we give an overview on four major approaches that tackle sizing the need for defining "FAIR for implementation". individual challenges of FAIR data and present our vision of a FAIR In this paper, we argue that Linked Data as a technology in Linked Data backbone. We propose 1) DBpedia Databus - a flex- combination with the Linked Open Data movement and ontologies ible, heavily automatizable dataset management and publishing can be seen as one of the most promising approaches for managing platform based on DataID metadata; that is extended by 2) the scholarly metadata as well as representing and connecting research novel Databus Mods architecture which allows for flexible, uni- results (RDF knowledge graphs) across the web. Although many fied, community-specific metadata extensions and (search) overlay FAIR principles could be fulfilled by 5-star Linked Open Data [5], systems; 3) DBpedia Archivo an archiving solution for unified han- the successful realization of FAIR principles for the Web of Data in dling and improvement of FAIRness for ontologies on publisher and its current state is a FAIRytale.
    [Show full text]
  • Linked Data Search and Browse Application
    IT 17 019 Examensarbete 30 hp Maj 2017 Linked Data Search and Browse Application Chao Cai Fatemeh Shirazi Nasab Institutionen för informationsteknologi Department of Information Technology Abstract Linked Data Search and Browse Application Chao Cai and Fatemeh Shirazi Nasab Teknisk- naturvetenskaplig fakultet UTH-enheten In order to achieve the ISO 26262 standard on the perspective of requirements traceability, a huge volume of data has been converted into RDF format, and been Besöksadress: stored in a Triple store. The need to have a web application to search and browse Ångströmlaboratoriet Lägerhyddsvägen 1 that RDF data has been raised. In order to build this application, several open- Hus 4, Plan 0 source components such as Apache Solr, Apache Jena, Fuseki and Technologies such as Java, HTML, CSS, and Javascript have been used. The application has Postadress: been evaluated with SUS method, an industry standard and reliable tool for Box 536 751 21 Uppsala measuring the system usability, by six engineers from Scania, the evaluation result in general is positive, five out of six participants successfully retrieved their desired Telefon: search results. 018 – 471 30 03 Telefax: Keyword: ISO 26262, Traceability, Triple store, Web application 018 – 471 30 00 Hemsida: http://www.teknat.uu.se/student Handledare: Mattias Nyberg Ämnesgranskare: Tore Risch Examinator: Mats Daniels IT 17 019 Tryckt av: Reprocentralen ITC Acknowledgement We wish to extend our deepest gratitude to our advisors, Dr. Mat- tias Nyberg and Dr. Tore Risch, for their thoughtful guidance throughout our master thesis. We appreciate many fruitful discus- sions and helpful advice from the members of the Scania RESA group.
    [Show full text]
  • Creating a Linked Data-Friendly Metadata Application Profile for Archival Description Poster
    Proc. Int’l Conf. on Dublin Core and Metadata Applications 2017 Creating a Linked Data-Friendly Metadata Application Profile for Archival Description Poster Matienzo, Mark A. Roke, Elizabeth Russey Carlson, Scott Stanford University, U.S.A. Emory University, U.S.A. Rice University, U.S.A. [email protected] [email protected] [email protected] Keywords: archival description; linked data; archives; Schema.org; metadata mapping Abstract We provide an overview of efforts to apply and extend Schema.org for archives and archival description. The authors see the application of Schema.org and extensions as a low barrier means to publish easily consumable linked data about archival resources, institutions that hold them, and contextual entities such as people and organizations responsible for their creation. Rationale and Objectives Schema.org has become one of the most widely recognized and adopted mechanisms for publishing structured data on the World Wide Web, and has incorporated extensions to address the needs of specialist communities (Guha, et al., 2016). It has been used with some success in cultural heritage sector through libraries and digital collections platforms using both Schema.org core types and properties, as well as SchemaBibExtend, an extension for bibliographic information (bib.schema.org, n.d.). These uses include leveraging it as a means to improve search engine rankings (Scott, 2014), to publish library staff directories (Clark and Young, 2017) and to expose linked data about collections materials (Lampron, et al., 2016). However, the adoption of Schema.org in the context of archives has been somewhat limited. Our project focuses on identifying pragmatic methods to publish linked data about archives, archival resources, and their relationships, and to identify gaps between existing models.
    [Show full text]
  • Entity Linking with a Knowledge Base: Issues, Techniques, and Solutions Wei Shen, Jianyong Wang, Senior Member, IEEE, and Jiawei Han, Fellow, IEEE
    1 Entity Linking with a Knowledge Base: Issues, Techniques, and Solutions Wei Shen, Jianyong Wang, Senior Member, IEEE, and Jiawei Han, Fellow, IEEE Abstract—The large number of potential applications from bridging Web data with knowledge bases have led to an increase in the entity linking research. Entity linking is the task to link entity mentions in text with their corresponding entities in a knowledge base. Potential applications include information extraction, information retrieval, and knowledge base population. However, this task is challenging due to name variations and entity ambiguity. In this survey, we present a thorough overview and analysis of the main approaches to entity linking, and discuss various applications, the evaluation of entity linking systems, and future directions. Index Terms—Entity linking, entity disambiguation, knowledge base F 1 INTRODUCTION Entity linking can facilitate many different tasks such as knowledge base population, question an- 1.1 Motivation swering, and information integration. As the world HE amount of Web data has increased exponen- evolves, new facts are generated and digitally ex- T tially and the Web has become one of the largest pressed on the Web. Therefore, enriching existing data repositories in the world in recent years. Plenty knowledge bases using new facts becomes increas- of data on the Web is in the form of natural language. ingly important. However, inserting newly extracted However, natural language is highly ambiguous, es- knowledge derived from the information extraction pecially with respect to the frequent occurrences of system into an existing knowledge base inevitably named entities. A named entity may have multiple needs a system to map an entity mention associated names and a name could denote several different with the extracted knowledge to the corresponding named entities.
    [Show full text]
  • Data Extraction Using NLP Techniques and Its Transformation to Linked Data
    Vincent Kríž, Barbora Hladká, Martin Nečaský, Tomáš Knap Data Extraction using NLP techniques and its Transformation to Linked Data MICAI 2014 Mexico, Tuxtla Gutiérrez Institute of Formal and Applied Linguistics Faculty of Mathematics and Physics Charles University in Prague [email protected] Czech Republic http://ufal.mff.cuni.cz/intlib Kríž, Hladká, Nečaský, Knap: Data Extraction using NLP techniques and its Transformation to Linked Data | MICAI2014 Motivation ● large collections of documents ● efficient browsing & querying ● typical approaches – full-text search no semantics – metadata search ● semantic interpretation of documents → suitable DB & query language → user-friendly browsing & querying Kríž, Hladká, Nečaský, Knap: Data Extraction using NLP techniques and its Transformation to Linked Data | MICAI2014 Scenario ● Cooperation between – Information Extraction – Semantic Web Kríž, Hladká, Nečaský, Knap: Data Extraction using NLP techniques and its Transformation to Linked Data | MICAI2014 Scenario ● Extracting knowledge base – set of entities and relations between them – linguistic analysis (RExtractor) ● Knowledge base representation – Linked Data Principles – Resource Description Framework (RDF) Kríž, Hladká, Nečaský, Knap: Data Extraction using NLP techniques and its Transformation to Linked Data | MICAI2014 Scenario ● Extracting knowledge base – set of entities and relations between them – linguistic analysis (RExtractor) ● Knowledge base representation – Linked Data Principles – Resource Description Framework (RDF) Kríž,
    [Show full text]
  • Semantic Web: a Review of the Field Pascal Hitzler [email protected] Kansas State University Manhattan, Kansas, USA
    Semantic Web: A Review Of The Field Pascal Hitzler [email protected] Kansas State University Manhattan, Kansas, USA ABSTRACT which would probably produce a rather different narrative of the We review two decades of Semantic Web research and applica- history and the current state of the art of the field. I therefore do tions, discuss relationships to some other disciplines, and current not strive to achieve the impossible task of presenting something challenges in the field. close to a consensus – such a thing seems still elusive. However I do point out here, and sometimes within the narrative, that there CCS CONCEPTS are a good number of alternative perspectives. The review is also necessarily very selective, because Semantic • Information systems → Graph-based database models; In- Web is a rich field of diverse research and applications, borrowing formation integration; Semantic web description languages; from many disciplines within or adjacent to computer science, Ontologies; • Computing methodologies → Description log- and a brief review like this one cannot possibly be exhaustive or ics; Ontology engineering. give due credit to all important individual contributions. I do hope KEYWORDS that I have captured what many would consider key areas of the Semantic Web field. For the reader interested in obtaining amore Semantic Web, ontology, knowledge graph, linked data detailed overview, I recommend perusing the major publication ACM Reference Format: outlets in the field: The Semantic Web journal,1 the Journal of Pascal Hitzler. 2020. Semantic Web: A Review Of The Field. In Proceedings Web Semantics,2 and the proceedings of the annual International of . ACM, New York, NY, USA, 7 pages.
    [Show full text]
  • The Relationship Between BIBFRAME and OCLC•S Linked-Data Model Of
    The Relationship between BIBFRAME and OCLC’s Linked-Data Model of Bibliographic Description: A Working Paper Carol Jean Godby Senior Research Scientist OCLC Research The Relationship between BIBFRAME and OCLC’s Linked-Data Model of Bibliographic Description: A Working Paper Carol Jean Godby, for OCLC Research © 2013 OCLC Online Computer Library Center, Inc. This work is licensed under a Creative Commons Attribution 3.0 Unported License. http://creativecommons.org/licenses/by/3.0/ June 2013 Updates: September 2013 — This version corrects a problem with attribution noted by reviewers of the previous draft. The models based on Schema.org described in Section 2 were derived from ideas being discussed by the W3C Schema Bib Extend community group but were developed by OCLC. The previous version of this draft incorrectly attributes this work to the W3C group. The analysis is otherwise unchanged. OCLC Research Dublin, Ohio 43017 USA www.oclc.org ISBN: 1-55653-460-4 (978-1-55653-460-7) OCLC (WorldCat): 850705869 Please direct correspondence to: Carol Jean Godby Senior Research Scientist [email protected] Suggested citation: Godby, Carol Jean. 2013. The Relationship between BIBFRAME and OCLC’s Linked-Data Model of Bibliographic Description: A Working Paper. Dublin, Ohio: OCLC Research. http://www.oclc.org/content/dam/research/publications/library/2013/2013-05.pdf. The Relationship between BIBFRAME and OCLC’s Schema.org ‘Bib Extensions’ Model: A Working Paper Acknowledgement The ideas described in the document represent a team effort with my OCLC colleagues Jonathan Fausey, Ted Fons, Tod Matola, Richard Wallis, and Jeff Young. I am also grateful for comments by Karen Coyle and other members of the W3C ‘Schema Bib Extend’ Community Group on an earlier version of this draft, which led to many improvements.
    [Show full text]
  • Connecting RDA and RDF Linked Data for a Wide World of Connected Possibilities
    Practice Connecting RDA and RDF Linked Data for a Wide World of Connected Possibilities Ashleigh Faith & Michelle Chrzanowski Ashleigh N. Faith, MLIS is an Adjunct Instructor at the University of Pittsburgh Information School, [email protected] Michelle Chrzanowski, MLS is a Reference Librarian at the Tidewater Community College Norfolk Campus Library, [email protected] Libraries have struggled with connecting a plethora of content and the metadata stored in catalogs to patrons. Adding more value to catalogs, more tools for reference librarians, and enriched patron search, linked data is a means to connect more people with more relevant information. With the recent transition to the Resource Description and Access (RDA) cataloging standard within libraries, linking data in library databases has become a much easier project to tackle, largely because of another standard called Resource Description Framework (RDF). Both focus on resource description and both are components of linked data within the library. Tying them together is the Functional Requirements for Bibliographic Records (FRBR) conceptual framework. Acknowledging that linked data components are most likely new to many librarians, this article seeks to explain what linked data is, how RDA and RDF are connected by FRBR, and how knowledge maps may improve information access. Introduction Interest in linked data has been growing. Recently, a search of the abstract databases Scopus, Web of Science, and Google Scholar show “linked data” as a search term an average of 45,633 times from 2010 to July 2015. From January to July 2015 alone, "linked data" was searched an average of 3,573 times. It is therefore no wonder that more people are paying attention to data and how it can be linked to other data.
    [Show full text]