LISTSERV mailing list manager LISTSERV 16.5

Help for CODE4LIB Archives


CODE4LIB Archives

CODE4LIB Archives


CODE4LIB@LISTS.CLIR.ORG


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Monospaced Font

LISTSERV Archives

LISTSERV Archives

CODE4LIB Home

CODE4LIB Home

CODE4LIB  February 2015

CODE4LIB February 2015

Subject:

Re: linked data question

From:

Ross Singer <[log in to unmask]>

Reply-To:

Code for Libraries <[log in to unmask]>

Date:

Tue, 24 Feb 2015 22:51:59 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (169 lines)

We have taken a somewhat different approach to how we manage our RDF data:
after years of using a native triple store, we found that it was actually
extremely impractical for the way we actually used our data. Triple stores
are fine for ad-hoc queries over arbitrary data, but that didn't reflect
our usage. Our schema, while flexible, was still predefined and our joins
were always on the same properties.

We found it made a lot more sense to store all of our data about a given
subject (concise bounded descriptions) as a document in a document-style
database (we use MongoDB). This took care of our SPARQL DESCRIBE queries.

However, since majority of the data we use are the equivalent of a SPARQL
CONSTRUCT made up of fixed joins over these CBD graphs, we decided to cache
these joined documents as their own documents in a read-only cache
collection, which we refer to as views. Then, if any of the CBD graphs
change, we invalidate the view and rebuild the cache documents.

I think this usage pattern would also pretty closely reflect how a linked
library data system might work, as well. The data doesn't actually change
all that much, and there will likely be very few ad hoc queries.

This also addresses a problem in the suggestion that Jeff made regarding
using your own URIs with 3rd party data: it gets pretty complicated to
manage changes to the graph in this scenario. By storing the original CBDs
as is, and generating graphs with your URIs over the external data as a
view, it's far easier to isolate what gets changed with particular updates
(not to mention that large data updates from various sources in a native
triple store is painful).

You can take a look at what we wrote if you want more details:
https://github.com/talis/tripod-php

This still doesn't address how to deal with keeping your local copy of the
external data up to date, and I don't know that there are a lot of good or
standard answers to that yet. That said, I think it's a solvable problem:
we just haven't gotten to that scale yet.

-Ross.
On Tuesday, February 24, 2015, Mixter,Jeff <[log in to unmask]> wrote:

> There are a few issue here that might need to be parsed out. The first is
> indexing Linked Data. It seems to make sense from a performance perspective
> to have a local index for the URIs and their names. For example
>
> http://viaf.org/viaf/102333412 name: Austen, Jane
>
> Pretend 'name' is an index field and the URI is the index key or ID. If
> you are using a Lucene index, you can imagine having multiple names based
> on language variation, preferred label variation (i.e. 'Austen, Jane,
> 1775-1817') etc.
>
> Another issue has to do with what is cached in the index. I would argue
> that nothing other then the lookup values should be cached. The system
> should go off the the key/ID (i.e. the URI) and fetch the data from it.
> This is important because data can change all the time and you do not want
> to rely on having to download monthly data dumps to rebuild your index.
> Plus the idea of data dumps stands in opposition to the idea of Linked Data
> and the Web (i.e. its on the Web for a reason and that is to be accessed on
> the Web not downloaded and stored in a silo).
>
> The third issue has to do with using VIAF URIs or coining your own local
> URIs. This is a bit of a toss up but I would argue that it would be better
> if you could coin your own URI and simply use a sameAs link to other
> entities, such as VIAF, LCSH, FAST etc. This would allow you to have a
> localized world-view of the entity. Or, to explain it better, it would
> allow you to put a localized lens on the entity and show things like how
> does this entity relate to other things that I have, know about, vend to
> patrons, etc. There are also practice reasons for this. If I see a
> hot-link in my local Library OPAC for 'Jane Austen' I expect to stay within
> my local OPAC domain when I click on it. I do not want to be taken out to
> VIAF or another place. The reason for clicking it is to learn about it
> within the context of what I am doing on that website. Finally, coining
> your own URI allows you provide people with a bookmark-able URL. That is
> important for search engine visibility.
>
> The last issue would require the index example above to not have a VIAF
> URI but rather a local URI that could be retrieved from a local Triple
> Store. In the store you could provide sameAs links to VIAF as well as
> localized information about the entity such as what he/she has authored
> that you current have available.
>
> Thanks,
>
> Jeff Mixter
> Research Support Specialist
> OCLC Research
> 614-761-5159
> [log in to unmask] <javascript:;>
>
> ________________________________________
> From: Code for Libraries <[log in to unmask] <javascript:;>> on
> behalf of Esmé Cowles <[log in to unmask] <javascript:;>>
> Sent: Tuesday, February 24, 2015 3:09 PM
> To: [log in to unmask] <javascript:;>
> Subject: Re: [CODE4LIB] linked data question
>
> Yes, I would expect each organization to fetch linked data resources and
> maintain their own local indexes, and probably also cache the remote
> resources to make it easier and faster to work with them. I've heard
> discussions of caching strategies, shared indexing tools, etc., but haven't
> heard about anyone distributing pre-indexed content.
>
> Many vocabularies are available as RDF data dumps, which can sometimes be
> very large and unwieldy. So I could imagine being able to download, e.g.,
> a Solr index of the vocabulary instead of having to index it yourself. But
> I haven't heard of anybody doing that.
>
> -Esme
>
> > On 02/24/15, at 10:56 AM, Harper, Cynthia <[log in to unmask]
> <javascript:;>> wrote:
> >
> > Ann - I thought I'd refer part of your question to Code4lib.
> >
> > As far as having to click to get the linked data: systems that use
> linked data will be built to transit the link without the user being aware
> - it's the system that will follow that link and find the distributed data,
> then display it as it is programmed to do so.
> >
> > I think Code4libbers will know more about my question about distributed
> INDEXES? This is my rudimentary knowledge of linked data - that the
> indexing process will have to transit the links, and build a local index to
> the data, even if in displaying the individual "records", it goes again out
> to the source. But are there examples of distributed systems that have
> distributed INDEXES? Or Am I wrong in envisioning an index as a separate
> entity from the data in today's technology?
> >
> > Cindy Harper
> >
> > -----Original Message-----
> > From: Harper, Cynthia
> > Sent: Tuesday, February 24, 2015 1:20 PM
> > To: [log in to unmask] <javascript:;>; 'Williams, Ann'
> > Subject: RE: linked data question
> >
> > What I haven't read, but what I have wondered about, is whether so far,
> linked DATA is distributed, but the INDEXES are local? Is there any
> example of a system with distributed INDEXES?
> >
> > Cindy Harper
> > [log in to unmask] <javascript:;>
> >
> > -----Original Message-----
> > From: AUTOCAT [mailto:[log in to unmask] <javascript:;>] On
> Behalf Of Williams, Ann
> > Sent: Tuesday, February 24, 2015 10:26 AM
> > To: [log in to unmask] <javascript:;>
> > Subject: [ACAT] linked data question
> >
> > I was just wondering how linked data will affect OPAC searching and
> discovery vs. a record with text approach. For example, we have various 856
> links to publisher, summary and biographical information in our OPAC as
> well as ISBNs linking to ContentCafe. But none of that content is
> discoverable in the OPAC and it requires a further click on the part of
> patrons (many of whom won't click).
> >
> > Ann Williams
> > USJ
> > --
> > ***********************************************************************
> >
> > AUTOCAT quoting guide: http://www.cwu.edu/~dcc/Autocat/copyright.html
> > E-mail AUTOCAT listowners: [log in to unmask]
> <javascript:;>
> > Search AUTOCAT archives: http://listserv.syr.edu/archives/autocat.html
> > By posting messages to AUTOCAT, the author does not cede copyright
> >
> > ***********************************************************************
>

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003

ATOM RSS1 RSS2



LISTS.CLIR.ORG

CataList Email List Search Powered by the LISTSERV Email List Manager