LISTSERV mailing list manager LISTSERV 16.0

Help for BIBFRAME Archives


BIBFRAME Archives

BIBFRAME Archives


BIBFRAME@LISTSERV.LOC.GOV


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

BIBFRAME Home

BIBFRAME Home

BIBFRAME  June 2015

BIBFRAME June 2015

Subject:

Re: Bibframe Mapping

From:

"Murray, Ronald" <[log in to unmask]>

Reply-To:

Bibliographic Framework Transition Initiative Forum <[log in to unmask]>

Date:

Wed, 10 Jun 2015 12:25:37 -0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (85 lines)

Establishing a sense of order in a graph-based resource description scheme
would require explicitly implementing succession relationships. The
simplest 
relationships would be recorded like this:

    Destination_ID succeeds Source_ID

which from a graph-theoretical perspective is **not** the same as adding
this to a graph¹s vertex/link list:

    Destination_ID is_preceeded_by Source_ID

    See: http://mathworld.wolfram.com/DirectedGraph.html for more
information

If the relationship is not recorded in the graph¹s vertex/link list, it
does not exist in the graph.

W3C doctrine seeks to ³economize² on graph construction operations by
suggesting that 
complementary links - e.g., for every ³succeeds" link there should be an
"is_preceded_by link² could be optional. See the above sentence.

While convenient at one level, this strategy masks the ³full² costs of
graph representation by declaring that a complementary link shall be
materialized as required by an inference computation. This graph data -
inference rules plus inference engine dependency (to create he virtual
vertex/link list) forecloses the application of well-established graph
operations that operate on graph data alone, e.g.:

     http://reference.wolfram.com/language/guide/ComputationOnGraphs.html
     NeighborhoodGraph is especially handy

Other ways to implement order in RDA could involve schemes that likewise
require inferential processing, e.g., alphabetical, numerical, date, etc.
orders.

Ron Murray

On 6/9/15, 5:13 PM, "Karen Coyle" <[log in to unmask]> wrote:

>Mac, there is no such thing as "order" in RDF. If there are two
>statements that use the same property (e.g. bf:note) there is no order
>implied between them and there's no "record" in RDF that would maintain
>an order between two or more properties. There is a function called
>"rdf:List" but that is not a highly used function, and I highly doubt
>that anyone is anticipating using rdf:List for notes. In general, what
>was done with order in the card/record world is done in RDF with the
>meaning of the data element.
>
>It seems to me that the problem is that there are many different
>"messages" that are currently being coded as bf:note. If there is any
>time when a specific note must be identified for some purpose, say as a
>particular display, then that note type has to be differentiated. This
>should be solved by having different types of notes, not by imposing an
>order on undifferentiated notes.
>
>My guess is that a clear statement of use cases for different types of
>notes would take this discussion further. What are the uses for
>different notes? Under what circumstances will notes be acted on
>(searched, displayed)? (Note that the answer to this may not entirely
>coincide with the note elements currently defined in MARC or ISBD. We
>should ask the question without prejudice and see what answers arise.)
>
>kc
>
>On 6/9/15 1:05 PM, J. McRee Elrod wrote:
>> http://faculty.washington.edu/kiegel/ld/rda-core-to-bibframe.pdf
>>
>> It concerns me that so many RDA specific notes (as well as MARC ones)
>> just map to <bf:note>, which means that if there is to be consistent
>> note order, it much be created by the cataloguer, not left to the
>> machine.
>>
>>
>>     __       __   J. McRee (Mac) Elrod ([log in to unmask])
>>    {__  |   /     Special Libraries Cataloguing   HTTP://www.slc.bc.ca/
>>    ___} |__ \__________________________________________________________
>
>-- 
>Karen Coyle
>[log in to unmask] http://kcoyle.net
>m: +1-510-435-8234
>skype: kcoylenet/+1-510-984-3600

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

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
July 2011
June 2011

ATOM RSS1 RSS2



LISTSERV.LOC.GOV

CataList Email List Search Powered by the LISTSERV Email List Manager