Patrick Hochstenbach

Patrick Hochstenbach

Auto-generated profile, based on publicly available information

Patrick Hochstenbach

Ghent University

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2003 in D-Lib Magazine
Verified
Journal Article
Closed access
JBJeroen Bekaert
Jeroen Bekaert
PHPatrick Hochstenbach
Patrick Hochstenbach
HSHerbert Van de Sompel
Herbert Van de Sompel

1 April 1999 in D-Lib Magazine
Verified
Journal Article
Closed access
HSHerbert Van de Sompel
Herbert Van de Sompel
PHPatrick Hochstenbach
Patrick Hochstenbach

8 January 2018 in Journal of Documentation
Verified
Journal Article
Closed access
MSMiel Vander Sande
Miel Vander Sande
RVRuben Verborgh
Ruben Verborgh
PHPatrick Hochstenbach
Patrick Hochstenbach
HSHerbert Van de Sompel
Herbert Van de Sompel
Purpose: The purpose of this paper is to detail a low-cost, low-maintenance publishing strategy aimed at unlocking the value of Linked Data collections held by libraries, archives and museums (LAMs).Design/methodology/approach: The shortcomings of commonly used Linked Data publishing approaches are identified, and the current lack of substantial collections of Linked Data exposed by LAMs is considered. To improve on the discussed status quo, a novel approach for publishing Linked Data is proposed and demonstrated by means of an archive of DBpedia versions, which is queried in combination with other Linked Data sources.Findings: The authors show that the approach makes publishing Linked Data archives easy and affordable, and supports distributed querying without causing untenable load on the Linked Data sources.Research limitations/implications: The proposed approach significantly lowers the barrier for publishing, maintaining, and making Linked Data collections queryable. As such, it offers the potential to substantially grow the distributed network of queryable Linked Data sources. Because the approach supports querying without causing unacceptable load on the sources, the queryable interfaces are expected to be more reliable, allowing them to become integral building blocks of robust applications that leverage distributed Linked Data sources.Originality/value: The novel publishing strategy significantly lowers the technical and financial barriers that LAMs face when attempting to publish Linked Data collections. The proposed approach yields Linked Data sources that can reliably be queried, paving the way for applications that leverage distributed Linked Data sources through federated querying.


1 October 1999 in D-Lib Magazine
Verified
Journal Article
Closed access
HSHerbert Van de Sompel
Herbert Van de Sompel
PHPatrick Hochstenbach
Patrick Hochstenbach

21 October 2008 in International Journal on Digital Libraries
Verified
Journal Article
Closed access
PDF file
HSHerbert Van de Sompel
Herbert Van de Sompel
RCRyan Chute
Ryan Chute
PHPatrick Hochstenbach
Patrick Hochstenbach