Search (99 results, page 2 of 5)

0.010828946 = product of:
  0.027072364 = sum of:
    0.009869335 = weight(_text_:a in 5271) [ClassicSimilarity], result of:
      0.009869335 = score(doc=5271,freq=14.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.20223314 = fieldWeight in 5271, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=5271)
    0.01720303 = product of:
      0.03440606 = sum of:
        0.03440606 = weight(_text_:22 in 5271) [ClassicSimilarity], result of:
          0.03440606 = score(doc=5271,freq=2.0), product of:
            0.14821209 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042324185 = queryNorm
            0.23214069 = fieldWeight in 5271, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=5271)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Federated search and distributed information retrieval systems provide a single user interface for searching multiple full-text search engines. They have been an active area of research for more than a decade, but in spite of their success as a research topic, they are still rare in operational environments. This article discusses a prototype federated search system developed for the U.S. government's FedStats Web portal, and the issues addressed in adapting research solutions to this operational environment. A series of experiments explore how well prior research results, parameter settings, and heuristics apply in the FedStats environment. The article concludes with a set of lessons learned from this technology transfer effort, including observations about search engine quality in the real world.

Date

22. 7.2006 16:02:07

Type

a

0.010489925 = product of:
  0.026224812 = sum of:
    0.006154612 = weight(_text_:a in 4866) [ClassicSimilarity], result of:
      0.006154612 = score(doc=4866,freq=4.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.12611452 = fieldWeight in 4866, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4866)
    0.0200702 = product of:
      0.0401404 = sum of:
        0.0401404 = weight(_text_:22 in 4866) [ClassicSimilarity], result of:
          0.0401404 = score(doc=4866,freq=2.0), product of:
            0.14821209 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042324185 = queryNorm
            0.2708308 = fieldWeight in 4866, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4866)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Information subject gateways provide targeted discovery services for their users, giving access to Web resources selected according to quality and subject coverage criteria. Information gateways recognise that they must collaborate on a wide range of issues relating to content to ensure continued success. This report is informed by discussion of content activities at the 1999 Imesh Workshop. The author considers the implications for subject based gateways of co-operation regarding coverage policy, creation of metadata, and provision of searching and browsing across services. Other possibilities for co-operation include working more closely with information providers, and diclosure of information in joint metadata registries

Date

22. 6.2002 19:38:54

Type

a

0.008991364 = product of:
  0.022478411 = sum of:
    0.0052753813 = weight(_text_:a in 5589) [ClassicSimilarity], result of:
      0.0052753813 = score(doc=5589,freq=4.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.10809815 = fieldWeight in 5589, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=5589)
    0.01720303 = product of:
      0.03440606 = sum of:
        0.03440606 = weight(_text_:22 in 5589) [ClassicSimilarity], result of:
          0.03440606 = score(doc=5589,freq=2.0), product of:
            0.14821209 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042324185 = queryNorm
            0.23214069 = fieldWeight in 5589, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=5589)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Der vollständige Projektname von Renardus lautet "Academic Subject Gateway Service Europe". Renardus wird von der Europäischen Union im 5. Rahmenprogramm mit dem Schwerpunktthema "Information Society Technologies" im zweiten Thematischen Programm "Benutzerfreundliche Informationsgesellschaft" ('Promoting a User-friendly Information Society') gefördert. Die Projektlaufzeit ist von Januar 2000 bis Juni 2002. Insgesamt zwölf Partner (Principal und Assistant Contractors) aus Finnland, Dänemark, Schweden, Großbritannien, den Niederlanden, Frankreich und Deutschland beteiligen sich an diesem Projekt. Die Europäische Union unterstützt das Projekt mit 1,7 Mio. EURO, die Gesamtkosten belaufen sich inklusive der Eigenbeteiligungen der Partner auf 2,3 Mio. EURO. Das Ziel des Projektes Renardus ist es, über eine Schnittstelle Zugriff auf verteilte Sammlungen von "High Quality" Internet Ressourcen in Europa zu ermöglichen. Diese Schnittstelle wird über den Renardus Broker realisiert, der das "Cross-Searchen" und "Cross-Browsen" über verteilte "Quality-Controlled Subject Gateways" ermöglicht. Ein weiteres Ziel von Renardus ist es, Möglichkeiten von "metadata sharing" zu evaluieren und in kleinen Experimenten zwischen z. B. Subject Gateways und Nationalbibliothek zu testen bzw. zu realisieren

Date

22. 6.2002 19:32:15

Type

a

0.0085147135 = product of:
  0.021286784 = sum of:
    0.0069509256 = weight(_text_:a in 6959) [ClassicSimilarity], result of:
      0.0069509256 = score(doc=6959,freq=10.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.14243183 = fieldWeight in 6959, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6959)
    0.014335858 = product of:
      0.028671715 = sum of:
        0.028671715 = weight(_text_:22 in 6959) [ClassicSimilarity], result of:
          0.028671715 = score(doc=6959,freq=2.0), product of:
            0.14821209 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042324185 = queryNorm
            0.19345059 = fieldWeight in 6959, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6959)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

The success of the World Wide Web Shows that we can access, search, and retrieve information from globally distributed databases. lf a database, such as a library catalog, has some sort of Web-based front end, we can type its URL into a Web browser and use its HTML-based forms to search for items in that database. Depending an how well the query conforms to the database content, how the search engine interprets the query, and how the server formats the results into HTML, we might actually find something usable. While the first two issues depend an ourselves and the server, an the Web the latter falls to the mercy of HTML, which we all know as a great destroyer of information because it codes for display but not for content description. When looking at an HTML-formatted display, we must depend an our own interpretation to recognize such entities as author names, titles, and subject identifiers. The Web browser can do nothing but display the information. lf we want some other view of the result, such as sorting the records by date (provided it offers such an option to begin with), the server must do it. This makes poor use of the computing power we have at the desktop (or even laptop), which, unless it involves retrieving more records, could easily do the result Set manipulation that we currently send back to the server. Despite having personal computers wich immense computational power, as far as information retrieval goes, we still essentially use them as dumb terminals.

Date

22. 9.1997 19:16:05

Type

a

0.006881212 = product of:
  0.03440606 = sum of:
    0.03440606 = product of:
      0.06881212 = sum of:
        0.06881212 = weight(_text_:22 in 4865) [ClassicSimilarity], result of:
          0.06881212 = score(doc=4865,freq=2.0), product of:
            0.14821209 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042324185 = queryNorm
            0.46428138 = fieldWeight in 4865, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=4865)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Date

22. 6.2002 19:41:59

0.0040745395 = product of:
  0.020372696 = sum of:
    0.020372696 = weight(_text_:w in 4097) [ClassicSimilarity], result of:
      0.020372696 = score(doc=4097,freq=2.0), product of:
        0.16128924 = queryWeight, product of:
          3.8108058 = idf(docFreq=2659, maxDocs=44218)
          0.042324185 = queryNorm
        0.12631156 = fieldWeight in 4097, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8108058 = idf(docFreq=2659, maxDocs=44218)
          0.0234375 = fieldNorm(doc=4097)
  0.2 = coord(1/5)

0.0025843985 = product of:
  0.012921993 = sum of:
    0.012921993 = weight(_text_:a in 4879) [ClassicSimilarity], result of:
      0.012921993 = score(doc=4879,freq=6.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.26478532 = fieldWeight in 4879, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.09375 = fieldNorm(doc=4879)
  0.2 = coord(1/5)

Type

a

0.0024365943 = product of:
  0.012182971 = sum of:
    0.012182971 = weight(_text_:a in 1503) [ClassicSimilarity], result of:
      0.012182971 = score(doc=1503,freq=12.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.24964198 = fieldWeight in 1503, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=1503)
  0.2 = coord(1/5)

Abstract

Managing information from over 375 separate parks is a challenge for the US National Parks Service (NPS). Describes the National Resource Bibliography Project initiated by the NPS, which so far includes more than 100.000 records from over 160 different US parks. The goal is to complete all of the units designated for the project by 1998. The result will be a virtual library comprising document collections from over 300 parks, forming a unique and valuable research tool, available to anyone interested

Type

a

0.0023028448 = product of:
  0.011514224 = sum of:
    0.011514224 = weight(_text_:a in 3194) [ClassicSimilarity], result of:
      0.011514224 = score(doc=3194,freq=14.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.23593865 = fieldWeight in 3194, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3194)
  0.2 = coord(1/5)

Abstract

The State Library of Iowa, USA, received a Higher Education Act title II grant from the US Dept. of Education in 1994 to create a demonstration project of new library information technologies. Describes 2 interlinked components of the project: Web-based union catalogue development and statewide deployment of the ANSI/NISO Z39.50 standard for database search and retrieval. Z39.50 was chosen because of its ability to searching multiple remote databases in a single session and its common interface across a variety of implementations. Use of a distributed Z39.50 search makes the need for maintaining large union catalogues unnecessary

Type

a

0.0022381549 = product of:
  0.011190774 = sum of:
    0.011190774 = weight(_text_:a in 38) [ClassicSimilarity], result of:
      0.011190774 = score(doc=38,freq=18.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.22931081 = fieldWeight in 38, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=38)
  0.2 = coord(1/5)

Abstract

Effective retrieval in a distributed environment is an important but difficult problem. Lack of effectiveness appears to have two major causes. First, existing collection selection algorithms do not work well on heterogeneous collections. Second, relevant documents are scattered over many collections and searching a few collections misses many relevant documents. We propose a topic-oriented approach to distributed retrieval. With this approach, we structure the document set of a distributed retrieval environment around a set of topics. Retrieval for a query involves first selecting the right topics for the query and then dispatching the search process to collections that contain such topics. The content of a topic is characterized by a language model. In environments where the labeling of documents by topics is unavailable, document clustering is employed for topic identification. Based on these ideas, three methods are proposed to suit different environments. We show that all three methods improve effectiveness of distributed retrieval

Type

a

0.0022381549 = product of:
  0.011190774 = sum of:
    0.011190774 = weight(_text_:a in 1230) [ClassicSimilarity], result of:
      0.011190774 = score(doc=1230,freq=18.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.22931081 = fieldWeight in 1230, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=1230)
  0.2 = coord(1/5)

Abstract

A Virtual union catalog is a possible alternative to the centralized database of distributed resources found in many library systems. Such a catalog would not be maintained in a single location but would be created in real time by searching each local campus or affiliate library's catalog through the Z39.50 protocol. This would eliminate the redundancy of record storage as well as the expense of loading and maintaining access to the central catalog. This article describes a test implementation of a virtual union catalog for the University of California system. It describes some of the differences between the virtual catalog and the existing, centralized union catalog (MELVYL). The research described in the paper suggests enhancements that must be made if the virtual union catalog is to become a reasonable service alternative to the MELVYL® catalog.

Type

a

0.002224296 = product of:
  0.011121481 = sum of:
    0.011121481 = weight(_text_:a in 8452) [ClassicSimilarity], result of:
      0.011121481 = score(doc=8452,freq=10.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.22789092 = fieldWeight in 8452, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=8452)
  0.2 = coord(1/5)

Abstract

OPAC Network in Europe (ONE) is a project aimed at providing users with better ways to access library OPACs and national catalogues and which will stimulate and facilitate internetworking between libraries in Europe. The project is based on SR/Z39.50 standards which enable users to search widely different computer systems across networks and offer end users the promise of greater ease of use through a solution to the proliferation of different user interfaces to library catalogues

Type

a

0.0021536655 = product of:
  0.010768328 = sum of:
    0.010768328 = weight(_text_:a in 1164) [ClassicSimilarity], result of:
      0.010768328 = score(doc=1164,freq=24.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.22065444 = fieldWeight in 1164, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1164)
  0.2 = coord(1/5)

Abstract

The objective of the European Library (TEL) project [TEL] was to set up a co-operative framework and specify a system for integrated access to the major collections of the European national libraries. This has been achieved by successfully applying a new approach for search and retrieval via URLs (SRU) [ZiNG] combined with a new metadata paradigm. One aim of the TEL approach is to have a low barrier of entry into TEL, and this has driven our choice for the technical solution described here. The solution comprises portal and client functionality running completely in the browser, resulting in a low implementation barrier and maximum scalability, as well as giving users control over the search interface and what collections to search. In this article we will describe, step by step, the development of both the search and retrieval architecture and the metadata infrastructure in the European Library project. We will show that SRU is a good alternative to the Z39.50 protocol and can be implemented without losing investments in current Z39.50 implementations. The metadata model being used by TEL is a Dublin Core Application Profile, and we have taken into account that functional requirements will change over time and therefore the metadata model will need to be able to evolve in a controlled way. We make this possible by means of a central metadata registry containing all characteristics of the metadata in TEL. Finally, we provide two scenarios to show how the TEL concept can be developed and extended, with applications capable of increasing their functionality by "learning" new metadata or protocol options.

Type

a

0.0021101525 = product of:
  0.0105507625 = sum of:
    0.0105507625 = weight(_text_:a in 4694) [ClassicSimilarity], result of:
      0.0105507625 = score(doc=4694,freq=4.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.2161963 = fieldWeight in 4694, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.09375 = fieldNorm(doc=4694)
  0.2 = coord(1/5)

Type

a

0.0019894708 = product of:
  0.009947354 = sum of:
    0.009947354 = weight(_text_:a in 1504) [ClassicSimilarity], result of:
      0.009947354 = score(doc=1504,freq=8.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.20383182 = fieldWeight in 1504, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=1504)
  0.2 = coord(1/5)

Abstract

The British Library is currently progressing several projects involving Z39.50 and SR standards. The Network OPAC trial service is being extended for a further year and the user base broadened. Future applications of Z39.50 currently being investigated include access from Z39.50 clients developed by other suppliers; a virtual database to cover all the library's diverse catalogues; and a national distributed bibliographic database

Type

a

0.0019660187 = product of:
  0.009830093 = sum of:
    0.009830093 = weight(_text_:a in 4951) [ClassicSimilarity], result of:
      0.009830093 = score(doc=4951,freq=20.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.20142901 = fieldWeight in 4951, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4951)
  0.2 = coord(1/5)

Abstract

Purpose - To describe the process and results of the business-planning workpackage of The European Library (TEL) project, in which eight national libraries collaborated on a joint approach to access to their digital libraries. Design/methodology/approach - The methodology was in three parts: first, a literature review and the mapping of the partners' existing and planned digital products and services, then a structured interview or survey to determine the partners' business requirements from TEL, then a harmonization process, and finally the results were then combined with normal business planning elements to produce a mission and final business plan. Findings - Business planning for digital libraries has hitherto not been widely reported. The methodology proved to be an effective method of achieving mutual agreement among partners with widely different aims and characteristics. Eleven harmonized service aspirations were agreed and five categories of business aims. Research limitations/implications - Focused on the business aims of national libraries, but the methodology can be relevant to other collaborative projects. Together with the few existing other reports, this can form the basis for a new field of work. Practical implications - The work described led directly to the creation of an operational service, which will be open to all European national libraries. Originality/value - As far as is known, the first reporting of a collaborative international planning process for a digital library, and maybe the first multi-partner business plan between national libraries.

Type

a

0.0017584605 = product of:
  0.008792303 = sum of:
    0.008792303 = weight(_text_:a in 1193) [ClassicSimilarity], result of:
      0.008792303 = score(doc=1193,freq=16.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.18016359 = fieldWeight in 1193, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1193)
  0.2 = coord(1/5)

Abstract

This article describes two approaches for searching heterogeneous resources, which are explained as they are used in two corresponding existing systems-RIRS (Resource Integration Retrieval System) and HRUSP (Heterogeneous Resource Union Search Platform). On analyzing the existing systems, a possible framework-the MUSP (Multimetadata-Based Union Search Platform) is presented. Libraries now face a dilemma. On one hand, libraries subscribe to many types of database retrieval systems that are produced by various providers. The libraries build their data and information systems independently. This results in highly heterogeneous and distributed systems at the technical level (e.g., different operating systems and user interfaces) and at the conceptual level (e.g., the same objects are named using different terms). On the other hand, end users want to access all these heterogeneous data via a union interface, without having to know the structure of each information system or the different retrieval methods used by the systems. Libraries must achieve a harmony between information providers and users. In order to bridge the gap between the service providers and the users, it would seem that all source databases would need to be rebuilt according to a uniform data structure and query language, but this seems impossible. Fortunately, however, libraries and information and technology providers are now making an effort to find a middle course that meets the requirements of both data providers and users. They are doing this through resource integration.

Type

a

0.0017407871 = product of:
  0.008703935 = sum of:
    0.008703935 = weight(_text_:a in 4517) [ClassicSimilarity], result of:
      0.008703935 = score(doc=4517,freq=2.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.17835285 = fieldWeight in 4517, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=4517)
  0.2 = coord(1/5)

Type

a

0.0017407871 = product of:
  0.008703935 = sum of:
    0.008703935 = weight(_text_:a in 3195) [ClassicSimilarity], result of:
      0.008703935 = score(doc=3195,freq=8.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.17835285 = fieldWeight in 3195, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3195)
  0.2 = coord(1/5)

Abstract

Examines the use of the Z39.50 Information Retrieval protocol for provision of access to its collections. Z39.50 offers a translation of different search engines developed by library systems suppliers and online database hosts. Traces its development and describes its abstraction and metalanguage, and the TCP/IP and OSI layer. It is being further developed in project ONE - OPAC Network in Europe, and European Union Library Plan project which began in Jan 95, of which the British Library is a partner. It aims to link national library catalogues in an open standards and telecommunications network, and to achieve interoperability by use of Z39.50. Describes the project so far, agreements made, and future developments

Footnote

Contribution to a special issue devoted in part to improving access to British library treasures

Type

a

0.0017407871 = product of:
  0.008703935 = sum of:
    0.008703935 = weight(_text_:a in 4098) [ClassicSimilarity], result of:
      0.008703935 = score(doc=4098,freq=2.0), product of:
        0.048801772 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.042324185 = queryNorm
        0.17835285 = fieldWeight in 4098, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=4098)
  0.2 = coord(1/5)

Type

a