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:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CODE4LIB Home

CODE4LIB Home

CODE4LIB  April 2009

CODE4LIB April 2009

Subject:

Re: You got it!!!!! Re: [CODE4LIB] Something completely different

From:

Casey A Mullin <[log in to unmask]>

Reply-To:

Code for Libraries <[log in to unmask]>

Date:

Fri, 10 Apr 2009 10:33:05 -0700

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (105 lines)

(Attention: lurker emerging)

To me what it comes down to is neither simplicity nor complexity, but 
extensibility. In a perfect world, our data models should be capable of 
representing very sophisticated and robust relationships at a high level 
of granularity, while still accommodating ease of metadata production 
and contribution (especially by non-experts and those outside the 
library community).

I agree that none of our existing data structures/syntaxes are /a priori 
/fundamental or infallible. But what is promising to me about RDF is its 
intuitive mode of expression and extensibility (exactly the kind I 
advocate above).

Casey

Han, Yan wrote:
> Bill and Peter,
>
> Very nice posts. XML, RDF, MARC and DC are all different ways to present information in a way (of course, XML, RDF, and DC are easier to read/processed by machine). 
>
> However, down the fundamentals, I think that it can go deeper, basically data structure and algorithms making things works. RDF (with triples) is a directed graph. Graph is a powerful (the most powerful?) data structure that you can model everything. However, some of the graph theory/problems are NP-hard problems. In fundamental we are talking about Math. So a balance needs to be made. (between how complex the model is and how easy(or possible) to get it implemented). As computing power grows, complex data modeling and data mining are on the horizon.
>
> Yan
>
> -----Original Message-----
> From: Code for Libraries [mailto:[log in to unmask]] On Behalf Of Peter Schlumpf
> Sent: Thursday, April 09, 2009 10:09 PM
> To: [log in to unmask]
> Subject: [CODE4LIB] You got it!!!!! Re: [CODE4LIB] Something completely different
>
> Bill,
>
> You have hit the nail on the head!!!!!  This is EXACTLY what I am trying to do!  It's the underlying stuff that I am trying to get at.   Looking at RDF may yield some good ideas.  But I am not thinking in terms of RDF or XML, triples, or MARC, standards, or any of that stuff that gets thrown around here.  Even the Internet is not terribly necessary.  I am thinking in terms of data structures, pointers, sparse matrices, relationships between objects and yes, set theory too -- things like that.  The former is pretty much cruft that lies upon the latter, and it mostly just gets in the way.  Noise, as you put it, Bill!
>
> A big problem here is that Libraryland has a bad habit of getting itself lost in the details and going off on all kinds of tangents.  As I said before, the biggest prison is between the ears!!!!  Throw out all that junk in there and just start over!  When I begin programming this thing my only tools will be a programming language (C or Java) a text editor (vi) and my head.  But before I really start that, right now I am writing a paper that explains how this stuff works at a very low level.  It's mostly an effort to get my thoughts down clearly, but I will share a draft of it with y'all on here soon.
>
> Peter Schlumpf
>
>
> -----Original Message-----
>   
>> From: Bill Dueber <[log in to unmask]>
>> Sent: Apr 9, 2009 10:37 PM
>> To: [log in to unmask]
>> Subject: Re: [CODE4LIB] Something completely different
>>
>> On Thu, Apr 9, 2009 at 10:26 AM, Mike Taylor <[log in to unmask]> wrote:
>>
>>     
>>> I'm not sure what to make of this except to say that Yet Another XML
>>> Bibliographic Format is NOT the answer!
>>>
>>>       
>> I recognize that you're being flippant, and yet think there's an important
>> nugget in here.
>>
>> When you say it that way, it makes it sound as if folks are debating the
>> finer points of OAI-MARC vs MARC-XML -- that it's simply syntactic sugar
>> (although I'm certainly one to argue for the importance of syntactic sugar)
>> over the top of what we already have.
>>
>> What's actually being discussed, of course, is the underlying data model.
>> E-R pairs primarily analyzed by set theory, triples forming directed graphs,
>> whether or not links between data elements can themselves have attributes --
>> these are all possible characteristics of the fundamental underpinning of a
>> data model to describe the data we're concerned with.
>>
>> The fact that they all have common XML representations is noise, and
>> referencing the currently-most-common xml schema for these things is just
>> convenient shorthand in a community that understands the exemplars. The fact
>> that many in the library community don't understand that syntax is not the
>> same as a data model is how we ended up with RDA.  (Mike: I don't know your
>> stuff, but I seriously doubt you're among that group. I'm talkin' in
>> general, here.)
>>
>> Bibliographic data is astoundingly complex, and I believe wholeheartedly
>> that modeling it sufficiently is a very, very hard task. But no matter the
>> underlying model, we should still insist on starting with the basics that
>> computer science folks have been using for decades now: uids  (and, these
>> days, guids) for the important attributes, separation of data and display,
>> definition of sufficient data types and reuse of those types whenever
>> possible, separation of identity and value, full normalization of data, zero
>> ambiguity in the relationship diagram as a fundamental tenet, and a rigorous
>> mathematical model to describe how it all fits together.
>>
>> This is hard stuff. But it's worth doing right.
>>
>>
>>
>>
>> -- 
>> Bill Dueber
>> Library Systems Programmer
>> University of Michigan Library
>>     

-- 
Casey A. Mullin
Discovery Metadata Librarian
Metadata Development Unit
Stanford University Libraries
650-736-0849 
[log in to unmask]
http://www.caseymullin.com

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

November 2024
October 2024
September 2024
August 2024
July 2024
June 2024
May 2024
April 2024
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