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 2010

CODE4LIB May 2010

Subject:

Re: Multi-server Search Engine response times: was - OASIS SRU and CQL, access to most-current drafts

From:

"Walker, David" <[log in to unmask]>

Reply-To:

Code for Libraries <[log in to unmask]>

Date:

Wed, 19 May 2010 13:17:50 -0700

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (138 lines)

> And if the majority of users are only looking at results 
> from one resource... why do a broadcast multi-server 
> search in the first place?

More than just a theoretical concern.  Consider this from an article by Nina McHale:

"[R]eference and instruction staff at Auraria were asked to draw up a list of ten or so resources that would be included in a general-focus “Quick Search” . . . [h]owever, in practice, the result was disappointing. The results returned from the fastest resource were the results on top of the pile, and of the twelve resources chosen, PsycINFO routinely returned results first. Reference and instruction staff rightly felt that this skewed the results for a general query." [1]

One library' perspective, and I'm pretty sure they were not using Muse.  But conceptually the concern would be the same.

--Dave

[1] http://webserviceslibrarian.blogspot.com/2009/01/why-reference-and-instruction.html

==================
David Walker
Library Web Services Manager
California State University
http://xerxes.calstate.edu
________________________________________
From: Code for Libraries [[log in to unmask]] On Behalf Of Jonathan Rochkind [[log in to unmask]]
Sent: Wednesday, May 19, 2010 12:45 PM
To: [log in to unmask]
Subject: Re: [CODE4LIB] Multi-server Search Engine response times: was - OASIS SRU and CQL, access to most-current drafts

Wait, but in the case you suspect is common, where you return results as
soon as the first resource is returned, and subsequent results are added
to the _end_ of the list....

I'm thinking that in most of these cases, the subsequent results will be
several pages "in", and the user will never even get there. And if the
majority of users are only looking at results from one resource... why
do a broadcast multi-server search in the first place?

Peter Noerr wrote:
> However things are a bit different now...  At the risk of opening the debate once more and lots of lengthy discussion let me say that our experience (as one of the handful of commercial providers of "multi-server search engines" (MSSEs? - it'll never stick, but I like it)) is:
>
> 1) Times are not slow for most installations as they are set by default to provide incremental results in the fashion Jakub suggests ("First In, First Displayed"). So users see results driven by the time of the fastest Source, not the slowest. <contentious statement>This means that, on average, getting the results from a MSSE can be faster than doing the same search on all of the native sites (just talking response times here, not the fact it is one search versus N). Do the maths - it's quite fun. </contentious statement>
>
> 2) The average "delay" for just processing the results through modern MSSEs is about 0.5 sec. Add to this say another 0.2 for two extra network hops and the additional response time to first display is about 3/4 of a second. This is a time shift all the way down the set of results - most of which the user isn't aware of as they are beyond the first 10 on screen, and the system allows interaction with those 10 while the rest are getting their act together. So, under 1 second is added to response times which average about 5 seconds. Of course, waiting for all the results adds this time to the slowest results.
>
> 3) Most users seem happy to get things back faster and not worry too much about relevance ranking. To combat the response time issue for users who require ranked results, the incremental return can be set to show interfiled results as the later records come in and rank within the ones displayed to the user. This can be disconcerting, but making sure the UI doesn't lose track of the user's focus is helpful. Another option is to show that "new results" are available, and let the user manually click to get them incorporated - less intrusive, but an extra click!
>
> General experience with the incremental displays shows that users are happiest with them when there is an obvious and clear reason for the new additions. The most accepted case is where the ranking criterion is price, and the user is always happy to see a cheaper item arrive. It really doesn't work well for titles sorted alphabetically - unless the user is looking for a specific title which should occur at the beginning of the list. And these examples illustrate the general point - that if the user is focused on specific items at the top of the list, then they are generally happy with an updating list, if they are more in "browse" mode, then the distraction of the updating list is just that - a distraction, if it is on screen.
>
> Overall our experience from our partner's users is that they would rather see things quickly than wait for relevance ranking. I suspect partly (can of worms coming) because the existing ranking schemes don't make a lot of difference (ducks quickly).
>
> Peter
>
> Peter Noerr
> CTO, Museglobal
> www.museglobal.com
>
>
>> -----Original Message-----
>> From: Code for Libraries [mailto:[log in to unmask]] On Behalf Of
>> Walker, David
>> Sent: Tuesday, May 18, 2010 12:44 PM
>> To: [log in to unmask]
>> Subject: Re: [CODE4LIB] OASIS SRU and CQL, access to most-current
>> drafts
>>
>>
>>> in order to provide decent user experience you need to be
>>> able to present some results "sooner" than others.
>>>
>> I would actually question whether this is really necessary.
>>
>> A few years back, I did a big literature review on metasearch, as well
>> as a looked at a good number of usability studies that libraries did
>> with metasearch systems.
>>
>> One thing that stood to me out was that the literature (written by
>> librarians and technologists) was very concerned about the slow search
>> times of metasearch, often seeing it as a deal-breaker.
>>
>> And yet, in the usability studies, actual students and faculty were far
>> less concerned about the search times -- within reason, of course.
>>
>> I thought the UC Santa Cruz study [1] summarized the point well: "Users
>> are willing to wait as long as they think that they will get useful
>> results. Their perceptions of time depend on this belief."
>>
>> Trying to return the results of a metasearch quickly just for the sake
>> of returning them quickly I think introduces other problems (in terms
>> of relevance ranking and presentation) that do far more to negatively
>> impact the user experience.  Just my opinion, of course.
>>
>> --Dave
>>
>> [1]
>> http://www.cdlib.org/services/d2d/metasearch/docs/core_ucsc_oct2004usab
>> ility.pdf
>>
>> ==================
>> David Walker
>> Library Web Services Manager
>> California State University
>> http://xerxes.calstate.edu
>> ________________________________________
>> From: Code for Libraries [[log in to unmask]] On Behalf Of Kuba
>> [[log in to unmask]]
>> Sent: Tuesday, May 18, 2010 9:57 AM
>> To: [log in to unmask]
>> Subject: Re: [CODE4LIB] OASIS SRU and CQL, access to most-current
>> drafts
>>
>> That is quite unfortunate, as we were looking at SRU 2.0 as a possible
>> candidate for the front-end protocol for Index Data's pazpar2. The
>> main problem with federate/broadcast/meta (however you want to call it
>> ;) searching is that the back-end databases are scattered in different
>> locations or simply slow in their response times and in order to
>> provide decent user experience you need to be able to present some
>> results "sooner" than others. Waiting for the slowest database to
>> respond is usually not an option.
>>
>> On Tue, May 18, 2010 at 5:24 PM, Ray Denenberg, Library of Congress
>> <[log in to unmask]> wrote:
>>
>>> On 18 May 2010 15:24, Ray Denenberg, Library of Congress
>>>
>> <[log in to unmask]>
>>
>>> wrote:
>>>
>>>> There is no synchronous operation in SRU.
>>>>
>>> Sorry, meant to say "no asynchronous .....
>>>
>>> --Ray
>>>
>>>
>>
>> --
>>
>> Cheers,
>> Jakub
>>

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