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 2006

CODE4LIB May 2006

Subject:

Re: Musings on using xISBN in our Horizon catalog

From:

Mike Rylander <[log in to unmask]>

Reply-To:

Code for Libraries <[log in to unmask]>

Date:

Mon, 22 May 2006 16:51:39 -0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (117 lines)

On 5/22/06, Houghton,Andrew <[log in to unmask]> wrote:
> > From: Code for Libraries [mailto:[log in to unmask]] On
> > Behalf Of Ross Singer
> > Sent: 22 May, 2006 11:58
> > To: [log in to unmask]
> > Subject: Re: [CODE4LIB] Musings on using xISBN in our Horizon catalog
> >
> > Er, how many records are we talking about?
> >
> > I don't really see this table getting too unmanageable.  He's
> > not frbrizing Worldcat this way, after all.
> >
>
> Lets say that the catalog we are talking about has 30,000 items.  Also,
> lets say that xISBN, on average, returns 4 related ISBN's per the given
> ISBN in the catalog for each of those 30,000 items.  Using the ISBN to
> ISBN relationship table, described in my previous message, we will have
> 16 rows * 30,000 items for a total of 480,000 rows in the database.
>
> While that may not be too unmanageable, depending upon hardware and SQL
> database being used, if we look at the FRBR to ISBN relationship table,
> described in my previous message, we will have 4 rows * 30,000 items for
> a total of 120,000 rows.  That is *roughly* 4 times less data that the
> SQL database has to index and search through per query.  Given the size
> of both datasets, we are still talking about a few seconds per query
> with most currently available SQL databases.  But what happens when the
> size of the catalog doubles, triples, quadruples, etc.?

Wait.  A few seconds? You're kidding, right?  An indexed look up of
the group id for the original ISBN, and then 1 subsequent look up by
that group id (should also be indexed) should be on the order of 1
millisecond /total/.  Equality index scans are fast in every database
worth using.

>
> The tradeoff is that the ISBN to ISBN relationship table uses more
> storage space which translates to longer database reindexing, backup,
> etc. times from an operational perspective.  It also means that during
> updates, you have 4 times the number of records to update which will
> impact performance.  Also, if we try to scale the ISBN to ISBN
> relationship table to a catalog with significantly more items, then
> it will become unmanageable.
>

Just so we're clear, we are talking about, at most, .5M rows that are
perhaps 50 bytes wide, with internal data.  That translates to ~25
megabytes for the table, and the indexes would be /maybe/ 5 megs each.

> When reading Ben's description of the problem he states: "we want to be
> able to display links to other versions of the same work (audiobooks,
> large print, possibly translations)."  From a database design, you
> probably want to track "audiobook", "large print", etc. with the item.
> Using the ISBN to ISBN relationship table design, because the data is
> unnormalized, we will continue to store duplicate information in the
> database as we extend the database design:
>
> Column 1        Column 2        Column 3
> --------        --------        --------
> ISBN-1  ISBN-1  book
> ISBN-1  ISBN-2  audiobook
> ISBN-1  ISBN-3  large print
> ISBN-1  ISBN-4  video
> ISBN-2  ISBN-1  book
> ISBN-2  ISBN-2  audiobook
> ISBN-2  ISBN-3  large print
> ISBN-2  ISBN-4  video
> ISBN-3  ISBN-1  book
> ISBN-3  ISBN-2  audiobook
> ISBN-3  ISBN-3  large print
> ISBN-3  ISBN-4  video
> ISBN-4  ISBN-1  book
> ISBN-4  ISBN-2  audiobook
> ISBN-4  ISBN-3  large print
> ISBN-4  ISBN-4  video
>
> we could mitigate this duplicate information in the database design
> by creating a "format" table and use the Foreign Key.  However, we
> still have 12 duplicate foreign keys because the original data was
> unnormalized.
>

Can you not search by ISBN and type in the main catalog?  (I'm not a
Horizon user, so I have no idea.)

> When looking at the FRBR to ISBN relationship table, you have
> normalized out the "work" and "item" levels and can attach information
> at either the "work" or "item" levels *without* duplicating information
> in the database.
>
> Column 1        Column 2        Column 3
> --------        --------        --------
> GROUP-1 ISBN-1  book
> GROUP-1 ISBN-2  audiobook
> GROUP-1 ISBN-3  large print
> GROUP-1 ISBN-4  video
>
> Again we could, and probably should, create a "format" table and use a
> foreign key for Column 3.
>
> You can see that as you start to extend the database designs, the ISBN
> to ISBN relationship table will become unmanageable from a design
> standpoint and will also cause additional duplicate information to be
> stored in the database, which will increase storage requirements, etc.
>
> A good database design will go a long way...
>
>
> Andy.
>


--
Mike Rylander
[log in to unmask]
GPLS -- PINES Development
Database Developer
http://open-ils.org

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