De-duplication in KOBV

Please always quote using this URN: urn:nbn:de:0297-zib-3931
  • In KOBV we offer the user an efficient tool for searching regional and worldwide accessible library catalogues (KOBV search engine). Search is performed by a distributed Z39.50 retrieval and an index based quicksearch. Due to the number of catalogues, result sets may contain a significant amount of duplicate records. Therefore we integrate a de-duplication procedure into KOBV search engine. It is part of the distributed search and the KOBV quicksearch as well. Main goals are the presentation of uniform retrieval results, the preservation of retrieval quality and cutting off redundant information. At least we keep an eye on efficiency. De-duplication is fully parametrizable, so that settings can be changed easily on line.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Stefan Lohrum, Wolfram Schneider, Josef Willenborg.
Document Type:ZIB-Report
Tag:clustering; de-duplication method; distributed library system
CCS-Classification:H. Information Systems / H.3 INFORMATION STORAGE AND RETRIEVAL / H.3.3 Information Search and Retrieval
Date of first Publication:1999/02/26
Series (Serial Number):ZIB-Report (SC-99-05)