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  May 2008

CODE4LIB May 2008

Subject:

Re: marc records sample set

From:

Jonathan Rochkind <[log in to unmask]>

Reply-To:

Code for Libraries <[log in to unmask]>

Date:

Fri, 9 May 2008 13:42:12 -0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (118 lines)

The Blacklight code is not currently using XML or XSLT. It's indexing
binary MARC files. I don't know it's speed, but I hear it's pretty fast.

But for the kind of test set I want, even waiting half an hour is too
long. I want a test set where I can make a change to my indexing
configuration and then see the results in a few minutes, if not seconds.

This has become apparent in my attempts to get the indexer _working_,
where I might not be actually changing the index mapping at all, I'm
just changing the indexer configuration until I know it's working. When
I get to actually messing with indexer mapping to try out new ideas, I
believe it will also be important, however.

Jonathan

Casey Durfee wrote:
> I strongly agree that we need something like this.  The LoC records that
> Casey donated are a great resource but far from ideal from this purpose.
> They're pretty homogeneous.  I do think it needs to be bigger than 10,000
> though.  100,000 would be a better target.  And I would like to see a
> UNIMARC/DANMARC-based one as well as a MARC21 based one (can one's parser
> handle DANMARC's "ø" subfield?).
>
> I don't know about Blacklight or VuFind, but using our MarcThing package +
> Solr we can index up to 1000 records a second.  I know using XSLT severely
> limits how fast you can index (I'll refrain from giving another rant about
> how wrong it is to use XSL to handle MARC -- the Society for Prevention of
> Cruelty to Dead Horses has my number as it is.)  But I'd still expect you
> can do a good 50-100 records a second.  That's only a half hour to an hour
> of work to index 100,000 records.  You could run it over your lunch break.
> Seems reasonable to me.
>
> In addition to a wide variety of languages, encodings, formats and so forth,
> it would definitely need to have records explicitly designed to break
> things.  Blank MARC tags, extraneous subfield markers, non-printing control
> characters, incorrect length fixed fields etc.  The kind of stuff that
> should never happen in theory, but happens frequently in real life (I'm
> looking at you, Horizon's MARC export utility).
>
> The legal aspect of this is the difficult part.  We (LibraryThing) could
> easily grab 200 random records from 500 different Z39.50 sources worldwide.
> Technically, it could be done in a couple of hours.  Legally, I don't think
> it could ever be done, sadly.
>
> --Casey
>
>
> On Fri, May 9, 2008 at 9:33 AM, Bess Sadler <[log in to unmask]> wrote:
>
>
>> Those of us involved in the Blacklight and VuFind projects are
>> spending lots of time recently thinking about marc records indexing.
>> We're about to start running some performance tests, and we want to
>> create unit tests for our marc to solr indexer, and also people
>> wanting to download and play with the software need to have easy
>> access to a small but representative set of marc records that they
>> can play with.
>>
>> According to the combined brainstorming of Jonathan Rochkind and
>> myself, the ideal record set should:
>>
>> 1. contain about 10k records, enough to really see the features, but
>> small enough that you could index it in a few minutes on a typical
>> desktop
>> 2. contain a distribution of kinds of records, e.g., books, CDs,
>> musical scores, DVDs, special collection items, etc.
>> 3. contain a distribution of languages, so we can test unicode handling
>> 4. contain holdings information in addition to bib records
>> 5. contain a distribution of typical errors one might encounter with
>> marc records in the wild
>>
>> It seems to me that the set that Casey donated to Open Library
>> (http://www.archive.org/details/marc_records_scriblio_net) would be a
>> good place from which to draw records, because although IANAL, this
>> seems to sidestep any legal hurdles. I'd also love to see the ability
>> for the community to contribute test cases. Assuming such a set
>> doesn't exist already (see my question below) this seems like the
>> ideal sort of project for code4lib to host, too.
>>
>> Since code4lib is my lazyweb, I'm asking you:
>>
>> 1. Does something like this exist already and I just don't know about
>> it?
>> 2. If not, do you have suggestions on how to go about making such a
>> data set? I have some ideas on how to do it bit by bit, and we have a
>> certain small set of records that we're already using for testing,
>> but maybe there's a better method that I don't know about?
>> 3. Are there features missing from the above list that would make
>> this more useful?
>>
>> Thoughts? Comments?
>>
>> Thanks!
>> Bess
>>
>>
>> Elizabeth (Bess) Sadler
>> Research and Development Librarian
>> Digital Scholarship Services
>> Box 400129
>> Alderman Library
>> University of Virginia
>> Charlottesville, VA 22904
>>
>> [log in to unmask]
>> (434) 243-2305
>>
>>
>
>

--
Jonathan Rochkind
Digital Services Software Engineer
The Sheridan Libraries
Johns Hopkins University
410.516.8886
rochkind (at) jhu.edu

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

December 2024
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