JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for DC-GENERAL Archives


DC-GENERAL Archives

DC-GENERAL Archives


DC-GENERAL@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Monospaced Font

LISTSERV Archives

LISTSERV Archives

DC-GENERAL Home

DC-GENERAL Home

DC-GENERAL  November 1998

DC-GENERAL November 1998

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

[long] Re: Inheriting metadata and searching it

From:

Alex Satrapa <[log in to unmask]>

Reply-To:

dc-general

Date:

Thu, 05 Nov 1998 08:32:18 +1100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (97 lines)

I'm a programmer supporting a number of installations of Verity Search 97
Information server - a full text search engine that supports "field based"
searching too.

SHORT:

1) The meta data of the child is the meta data of the child. Treat it as a
pure document in its own right. The relation field should take care of the
linkage problem.

2) Combined full text and meta data search is already possible with the Verity
Search 97 Information Server. I expect other commercial products would be
similar. At the very least, you could combine a "non-smart" meta data searcher
(say, an mSQL database) with a "non-smart" full text searcher (say, Netscape's
Compass Server) and be clever about how you merge the results. Well... the
next step down the ladder is to write your whole system from scratch[1].

LONG:

>From my point of view, both as a user interface programmer and as a search
engine maintainer, the "obvious" way to go is to assign to a document only the
metadata that relates to that document. The combined document
"http://x/report/index.html" might be edited by a group of people, published
by a particular organisation, etc. Each section may have been prepared by a
specific team.

If the DC.Relation meta data is set up correctly, then the "easiest" way to
allocate metadata is to put the section contributors into the DC.Contributor
(the three fields or the one field variety, who cares) for each section. The
people who contributed to the report as a whole (editors, printers, binders,
floor sweepers) will be listed in the meta data for the document as a whole.
The distinction between "section contributor" and "whole contributor" is
arbitrary and meaningless. Eventually, all the meta data will appear. It's up
to the entity entering the meta data to decide where each piece of meta data
"belongs"[2].

It's not really that "slow" for a "smart" search engine to go fetch the extra
data. Besides, most search engines these days are going to be harvesters[3].
If you don't have the meta data for a document linked to one you're currently
presenting to the user as a "search result", then the engine might go out and
collect the meta data for those new documents (ie: pre-fetch the details). I
won't go into a discussion of search network architecture... but I'd like
to[4]

Regards,
Alex Satrapa

[1] mSQL (http://www.hughes.com.au) licences start at $AU250 and come down
from there. Netscape licences are $US1250 for Compass by itself, or $US7000 as
part of Netscape SuiteSpot. Verity (http://www.verity.com) Search 97 is in the
tens of thousands (and needs a web server like Netscape, IIS or Apache).

[2] Deciding where a particular piece of meta data "belongs" can often be like
deciding which order the knives, forks and spoons will be stored in the
cutlery drawer. It doesn't really matter whether you have K-F-S or S-K-F or
F-S-K. What does matter is that every time you put a fork into the cutlery
drawer, you put it in the same slot as you put all the other forks.

[3] Search engines must collect the data somehow. The data is either collected
at document creation/publication time (eg: in a document management system),
or by "crawling" web sites (eg: Alta Vista, Webcrawler). There are other
methods, but these are the two I'm most familiar (and comfortable) with.

[4] By search network architecture, I mean the software/network architecture
behind your meta data search engine. It could be stand-alone, distributed or
brokered. But that's another story.

Marianne Peereboom wrote:

> On Wed, 4 Nov 1998, Kent Fitch wrote:
>
> > I'm part of a team about to embark on a metadata crusade
> > and an issue has come up which maybe others have resolved.
> ...
> >
> > 1) I'm not clear how any metadata entered against a "child" meshes
> > or mixes with metadata of the "parent". ...
> >
> > 2) It would often be useful to perform a combined metadata field
> > and free text search ...
> >
> > A possible solution is to maintain replicated metadata in the child
> > documents; another is use a very smart (and slow?) search engine
> > that understands the DC relation semantics.
>
> In the DONOR project (http://www.konbib.nl/donor/index-en.html)
> we propose to let children inherit the metadata of the parent, but only
> when the child itself doesn't have any metadata (except the relation
> element of course). ...
>
> We are still in the planning stages, and I must say that we hadn't
> thought yet about the second problem you mention (combined full text and
> metadata search). I'll forward your mail to our project-techies, see what
> they think.


Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

February 2024
May 2022
April 2022
March 2022
March 2020
February 2019
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 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
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
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998
August 1998
July 1998
June 1998
May 1998
April 1998
March 1998
February 1998
January 1998
December 1997
November 1997
October 1997
September 1997
August 1997
July 1997
June 1997
May 1997
April 1997
March 1997
February 1997
January 1997
December 1996
November 1996
October 1996
September 1996
August 1996
July 1996
June 1996
May 1996
April 1996
March 1996


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager