[ont.events] R. Sack-Davis: "Partial match retrieval based on superimposed coding".

phyllis@utcsrgv.UUCP (Phyllis Eve Bregman) (03/26/84)

[***]

      UofT Department of Computer Science Seminar Schedule for
		the week of March 26th, 1984

Thursday, March 29th, 4:00 P.M., GB244:  Dr. R.Sacks-Davis,
   Royal Melbourne Institute of Technology, Melbourne, Australia:
   "Partial match retrieval based on superimposed coding".

   ABSTRACT:  This talk describes a method for partial match
   retrieval on very large data files.  The method is based on
   superimposed coding techniques.  Associated with the data
   file is a descriptor file containing bit strings which describe
   the records.  In order to retrieve the records efficiently, a
   two level descriptor file is proposed.

   An analysis of the scheme indicates that retrieval is fast and
   that the method is efficient of storage compared to inverted
   file techniques.  The cost of answering a query is directly
   proportional to N, the number of records which satisfy the query
   and the cost is small when N is small.

   A prototype implementation of the method has been written in
   the C programming language on a UNIX system.  Test results will
   be presented for a database containing 25,000 library records
   where each record contains up to 27 attribute-values.
-- 
		Phyllis Eve Bregman
		CSRG, Univ. of Toronto
		{decvax,linus,ihnp4,uw-beaver,allegra,utzoo}!utcsrgv!phyllis
		CSNET:  phyllis@toronto
		(416) 978 6985