A Scalable Implementation for Human-Friendly URIs

Abstract. In the Web, Uniform Resource Identifiers (URIs) are used to name resources. The most common form of URI, the Uniform Resource Locator (URL) has, unfortunately, some scalability problems. In this paper, we proposes the use of Human-Friendly Names (HFNs) to solve these scalability problems. HFNs are high-level names that allow (human) users to easily deal with names. We also describes a scalable HFN-to-URL resolution mechanism. This mechanism is based on the existing Domain Name System (DNS) and the Globe Location Service. To gain experience and validate our ideas, we have implemented our HFN resolution scheme

Towards persistent resource identification with the uniform resource name

The exponential growth of the Internet, and the subsequent reliance on the resources it connects, has exposed a clear need for an Internet identifier which remains accessible over time. Such identifiers have been dubbed persistent identifiers owing to the promise of reliability they imply. Persistent naming systems exist at present, however it is the resolution of these systems into what Kunze, (2003) calls persistent actionable identifiers which is the focus of this work. Actionable identifiers can be thought of as identifiers which are accessible in a simple fashion such as through a web browser or through a specific application. This thesis identifies the Uniform Resource Name (URN) as an appropriate identification scheme for persistent resource naming. Evaluation of current URN systems finds that no practical means of global URN resolution is currently available. Two ,new approaches to URN resolution, unique in their use of the Domain Name System (DNS) are introduced. The proposed designs are assessed according to their Usability, Security and Evolution and an implementation described for an example URN namespace of language identifiers

Designing data for the open world of the web

The domain name system of the world wide web provides a managed space of globally unique identifiers for web pages -- Uniform Resource Identifiers, or URIs. URIs can also be used to name things – specifically, to name things in the world ("people," a "books," or "Nelson Mandela"); to name concepts used to describe those things ("Renaissance Sculpture" or "Lyme Disease"); and to name relationships between things (this book "was translated by" that person). Because URIs, used as names, are globally unique, they serve to anchor the strands in "webs of meaning" ("semantic web"). Each strand of the web is a statement following a grammar, the Resource Description Framework (RDF), which uses URIs as its words. Each RDF statement expresses a simple idea – "Dante wrote L'Inferno" or "Dante was born in Florence" – which, taken together, can express complex webs of relationships. Expressing data as statements makes it easy to integrate data across many different sources ("linked data"). The opportunity for cultural heritage lies in translating the traditions of resource description into the language of URIs so that its descriptions of Works, Items, Subject Headings, and People can serve as central hubs in growing webs of linked data.The domain name system of the world wide web provides a managed space of globally unique identifiers for web pages -- Uniform Resource Identifiers, or URIs. URIs can also be used to name things – specifically, to name things in the world ("people," a "books," or "Nelson Mandela"); to name concepts used to describe those things ("Renaissance Sculpture" or "Lyme Disease"); and to name relationships between things (this book "was translated by" that person). Because URIs, used as names, are globally unique, they serve to anchor the strands in "webs of meaning" ("semantic web"). Each strand of the web is a statement following a grammar, the Resource Description Framework (RDF), which uses URIs as its words. Each RDF statement expresses a simple idea – "Dante wrote L'Inferno" or "Dante was born in Florence" – which, taken together, can express complex webs of relationships. Expressing data as statements makes it easy to integrate data across many different sources ("linked data"). The opportunity for cultural heritage lies in translating the traditions of resource description into the language of URIs so that its descriptions of Works, Items, Subject Headings, and People can serve as central hubs in growing webs of linked data

BioGUID: resolving, discovering, and minting identifiers for biodiversity informatics

Background: Linking together the data of interest to biodiversity researchers (including specimen records, images, taxonomic names, and DNA sequences) requires services that can mint, resolve, and discover globally unique identifiers (including, but not limited to, DOIs, HTTP URIs, and LSIDs). Results: BioGUID implements a range of services, the core ones being an OpenURL resolver for bibliographic resources, and a LSID resolver. The LSID resolver supports Linked Data-friendly resolution using HTTP 303 redirects and content negotiation. Additional services include journal ISSN look-up, author name matching, and a tool to monitor the status of biodiversity data providers. Conclusion: BioGUID is available at http://bioguid.info/. Source code is available from http://code.google.com/p/bioguid/

The essence of P2P: A reference architecture for overlay networks

The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide variety of algorithms, data structures, and architectures have been proposed. The terminologies and abstractions used, however, have become quite inconsistent since the P2P paradigm has attracted people from many different communities, e.g., networking, databases, distributed systems, graph theory, complexity theory, biology, etc. In this paper we propose a reference model for overlay networks which is capable of modeling different approaches in this domain in a generic manner. It is intended to allow researchers and users to assess the properties of concrete systems, to establish a common vocabulary for scientific discussion, to facilitate the qualitative comparison of the systems, and to serve as the basis for defining a standardized API to make overlay networks interoperable

Entity Identification Problem in Big and Open Data

Big and Open Data provide great opportunities to businesses to enhance their competitive advantages if utilized properly. However, during past few years’ research in Big and Open Data process, we have encountered big challenge in entity identification reconciliation, when trying to establish accurate relationships between entities from different data sources. In this paper, we present our innovative Intelligent Reconciliation Platform and Virtual Graphs solution that addresses this issue. With this solution, we are able to efficiently extract Big and Open Data from heterogeneous source, and integrate them into a common analysable format. Further enhanced with the Virtual Graphs technology, entity identification reconciliation is processed dynamically to produce more accurate result at system runtime. Moreover, we believe that our technology can be applied to a wide diversity of entity identification problems in several domains, e.g., e- Health, cultural heritage, and company identities in financial world.Ministerio de Ciencia e Innovación TIN2013-46928-C3-3-

On Constructing Persistent Identifiers with Persistent Resolution Targets

Persistent Identifiers (PID) are the foundation referencing digital assets in scientific publications, books, and digital repositories. In its realization, PIDs contain metadata and resolving targets in form of URLs that point to data sets located on the network. In contrast to PIDs, the target URLs are typically changing over time; thus, PIDs need continuous maintenance -- an effort that is increasing tremendously with the advancement of e-Science and the advent of the Internet-of-Things (IoT). Nowadays, billions of sensors and data sets are subject of PID assignment. This paper presents a new approach of embedding location independent targets into PIDs that allows the creation of maintenance-free PIDs using content-centric network technology and overlay networks. For proving the validity of the presented approach, the Handle PID System is used in conjunction with Magnet Link access information encoding, state-of-the-art decentralized data distribution with BitTorrent, and Named Data Networking (NDN) as location-independent data access technology for networks. Contrasting existing approaches, no green-field implementation of PID or major modifications of the Handle System is required to enable location-independent data dissemination with maintenance-free PIDs.Comment: Published IEEE paper of the FedCSIS 2016 (SoFAST-WS'16) conference, 11.-14. September 2016, Gdansk, Poland. Also available online: http://ieeexplore.ieee.org/document/7733372