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

CODE4LIB October 2008

Subject:

Re: marc4j 2.4 released

From:

Jonathan Rochkind <[log in to unmask]>

Reply-To:

Code for Libraries <[log in to unmask]>

Date:

Mon, 20 Oct 2008 15:21:59 -0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (123 lines)

To me, "de-duplication" means throwing out some records as duplicates. 
Are we talking about that, or are we talking about what I call "work set 
grouping" and others (erroneously in my opinion) call "FRBRization"?

If the latter, I don't think there is any mature open source software 
that addresses that yet. Or for that matter, any proprietary 
for-purchase software that you could use as a component in your own 
tools. Various proprietary software includes a work set grouping feature 
in it's "black box" (AquaBrowser, Primo, I believe the VTLS ILS).  But I 
don't know of anything available to do it for you in your own tool.

I've been just starting to give some thought to how to accomplish this, 
and it's a bit of a tricky problem on several grounds, including 
computationally (doing it in a way that performs efficiently). One 
choice is whether you group records at the indexing stage, or on-demand 
at the retrieval stage. Both have performance implications--we really 
don't want to slow down retrieval OR indexing.  Usually if you have the 
choice, you put the slow down at indexing since it only happens "once" 
in abstract theory. But in fact, with what we do, when indexing that's 
already been optmized and does not have this feature can take hours or 
even days with some of our corpuses, and when in fact we do re-index 
from time to time (including 'incremental' addition to the index of new 
and changed records)---we really don't want to slow down indexing either.

Jonathan

Bess Sadler wrote:
> Hi, Mike.
>
> I don't know of any off-the-shelf software that does de-duplication of 
> the kind you're describing, but it would be pretty useful. That would 
> be awesome if someone wanted to build something like that into marc4j. 
> Has anyone published any good algorithms for de-duping? As I 
> understand it, if you have two records that are 100% identical except 
> for holdings information, that's pretty easy. It gets harder when one 
> record is more complete than the other, and very hard when one record 
> has even slightly different information than the other, to tell 
> whether they are the same record and decide whose information to 
> privilege. Are there any good de-duping guidelines out there? When a 
> library contracts out the de-duping of their catalog, what kind of 
> specific guidelines are they expected to provide? Anyone know?
>
> I remember the open library folks were very interested in this 
> question. Any open library folks on this list? Did that effort to 
> de-dupe all those contributed marc records ever go anywhere?
>
> Bess
>
> On Oct 20, 2008, at 1:12 PM, Michael Beccaria wrote:
>
>> Very cool! I noticed that a feature, MarcDirStreamReader, is capable of
>> iterating over all marc record files in a given directory. Does anyone
>> know of any de-duplicating efforts done with marc4j? For example,
>> libraries that have similar holdings would have their records merged
>> into one record with a location tag somewhere. I know places do it
>> (consortia etc.) but I haven't been able to find a good open program
>> that handles stuff like that.
>>
>> Mike Beccaria
>> Systems Librarian
>> Head of Digital Initiatives
>> Paul Smith's College
>> 518.327.6376
>> [log in to unmask]
>>
>> ---
>> This message may contain confidential information and is intended only
>> for the individual named. If you are not the named addressee you should
>> not disseminate, distribute or copy this e-mail. Please notify the
>> sender immediately by e-mail if you have received this e-mail by mistake
>> and delete this e-mail from your system.
>>
>> -----Original Message-----
>> From: Code for Libraries [mailto:[log in to unmask]] On Behalf Of
>> Bess Sadler
>> Sent: Monday, October 20, 2008 11:12 AM
>> To: [log in to unmask]
>> Subject: [CODE4LIB] marc4j 2.4 released
>>
>> Dear Code4Libbers,
>>
>> I'm very pleased to announce that for the first time in almost two
>> years there has been a new release of marc4j. Release 2.4 is a minor
>> release in the sense that it shouldn't break any existing code, but
>> it's a major release in the sense that it represents an influx of new
>> people into the development of this project, and a significant
>> improvement in marc4j's ability to handle malformed or mis-encoded
>> marc records.
>>
>> Release notes are here: http://marc4j.tigris.org/files/documents/
>> 220/44060/changes.txt
>>
>> And the project website, including download links, is here: http://
>> marc4j.tigris.org/
>>
>> We've been using this new marc4j code in solrmarc since solrmarc
>> started, so if you're using Blacklight or VuFind, you're probably
>> using it already, just in an unreleased form.
>>
>> Bravo to Bob Haschart, Wayne Graham, and Bas Peters for making these
>> improvements to marc4j and getting this release out the door.
>>
>> 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

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