Search (30 results, page 1 of 2)

  • × theme_ss:"Verteilte bibliographische Datenbanken"
  1. Heery, R.: Information gateways : collaboration and content (2000) 0.02 
    0.020246917 = product of:
  0.06074075 = sum of:
    0.044185378 = weight(_text_:searching in 4866) [ClassicSimilarity], result of:
      0.044185378 = score(doc=4866,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.31286204 = fieldWeight in 4866, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4866)
    0.016555373 = product of:
      0.033110745 = sum of:
        0.033110745 = weight(_text_:22 in 4866) [ClassicSimilarity], result of:
          0.033110745 = score(doc=4866,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = 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.33333334 = coord(2/6)
    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
  2. Avrahami, T.T.; Yau, L.; Si, L.; Callan, J.P.: ¬The FedLemur project : Federated search in the real world (2006) 0.02 
    0.0173545 = product of:
  0.0520635 = sum of:
    0.03787318 = weight(_text_:searching in 5271) [ClassicSimilarity], result of:
      0.03787318 = score(doc=5271,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 5271, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=5271)
    0.014190319 = product of:
      0.028380638 = sum of:
        0.028380638 = weight(_text_:22 in 5271) [ClassicSimilarity], result of:
          0.028380638 = score(doc=5271,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = 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.33333334 = coord(2/6)
    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
  3. Lunau, C.D.; Turner, F.: vCuc pilot project : status report and preliminary identification (1997) 0.01 
    0.008416262 = product of:
  0.050497573 = sum of:
    0.050497573 = weight(_text_:searching in 133) [ClassicSimilarity], result of:
      0.050497573 = score(doc=133,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3575566 = fieldWeight in 133, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0625 = fieldNorm(doc=133)
  0.16666667 = coord(1/6)
    Abstract
    Describes the virtual Canadian union catalogue (vCuc) pilot project which aims to determine the long term feasibility of using Z39.50 for searching distributed individual library catalogues and union catalogues which together would emulate a centralized union catalogue. This 'virtual' catalogue will not replace the existing union catalogue at the National Library of Canada, but rather complement it. Describes progress to data with the project
  4. Park, S.: Usability, user preferences, effectiveness, and user behaviors when searching individual and integrated full-text databases : implications for digital libraries (2000) 0.01 
    0.007438996 = product of:
  0.044633973 = sum of:
    0.044633973 = weight(_text_:searching in 4591) [ClassicSimilarity], result of:
      0.044633973 = score(doc=4591,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3160384 = fieldWeight in 4591, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4591)
  0.16666667 = coord(1/6)
    Abstract
    This article addresses a crucial issue in the digital library environment: how to support effective interaction of users with heterogeneous and distributed information resources. In particular, this study compared usability, user preference, effectiveness, and searching behaviors in systems that implement interaction with multiple databases as if they were one (integrated interaction) in a experiment in the TREC environment. 28 volunteers were recruited from the graduate students of the School of Communication, Information & Library Studies at Rutgers University. Significantly more subjects preferred the common interface to the integrated interface, mainly because they could have more control over database selection. Subjects were also more satisfied with the results from the common interface, and performed better with the common interface than with the integrated interface. Overall, it appears that for this population, interacting with databases through a common interface is preferable on all grounds to interacting with databases through an integrated interface. These results suggest that: (1) the general assumption of the information retrieval (IR) literature that an integrated interaction is best needs to be revisited; (2) it is important to allow for more user control in the distributed environment; (3) for digital library purposes, it is important to characterize different databases to support user choice for integration; and (4) certain users prefer control over database selection while still opting for results to be merged
  5. Cousins, S.; Sanders, A.: Incorporating a virtual union catalogue into the wider information environment through the application of middleware: Interoperability issues in cross-database access (2006) 0.01 
    0.007438996 = product of:
  0.044633973 = sum of:
    0.044633973 = weight(_text_:searching in 5591) [ClassicSimilarity], result of:
      0.044633973 = score(doc=5591,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3160384 = fieldWeight in 5591, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5591)
  0.16666667 = coord(1/6)
    Abstract
    Purpose - To explore the use of middleware to provide access to a virtual catalogue via Z39.50, allowing its integration with other services. To consider issues arising from the cross-database search process and the problem of interoperability between systems. Design/methodology/approach - Middleware was used to establish a Z39.50 server for an existing virtual union catalogue, InforM25. The Copac physical union catalogue was used to carry out cross-database search tests, investigating the value of query transformation by the middleware and illustrating many of the issues associated with interoperability in cross-database searching. Findings - The test results demonstrate the viability and benefits of using middleware to allow the integration of virtual catalogues with other services. The results also illustrate the range of issues affecting the performance of the virtual catalogue, with supporting evidence from the use of the Copac physical union catalogue for cross-database searching via Z39.50. In particular the discussion highlights the issue of semantic interoperability, as well as emphasising the value of centralised virtual catalogue support. Research limitations/implications - The research was limited to work on a specific virtual union catalogue, that is InforM25, but the results highlight issues with general relevance in the development of any virtual catalogue. The need for more work on response times in the virtual union catalogue is apparent, along with the related issue of result set post processing. Originality/value - This paper provides a practical demonstration of the issues important to those involved in making their local catalogue accessible to services, and individuals, outside their own institution, as well as those working on virtual union catalogue development.
  6. Stark, T.: ¬The Net and Z39.50 : toward a virtual union catalog (1997) 0.01 
    0.0073642298 = product of:
  0.044185378 = sum of:
    0.044185378 = weight(_text_:searching in 3194) [ClassicSimilarity], result of:
      0.044185378 = score(doc=3194,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.31286204 = fieldWeight in 3194, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3194)
  0.16666667 = coord(1/6)
    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
  7. Callan, J.: Distributed information retrieval (2000) 0.01 
    0.0073642298 = product of:
  0.044185378 = sum of:
    0.044185378 = weight(_text_:searching in 31) [ClassicSimilarity], result of:
      0.044185378 = score(doc=31,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.31286204 = fieldWeight in 31, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0546875 = fieldNorm(doc=31)
  0.16666667 = coord(1/6)
    Abstract
    A multi-database model of distributed information retrieval is presented, in which people are assumed to have access to many searchable text databases. In such an environment, full-text information retrieval consists of discovering database contents, ranking databases by their expected ability to satisfy the query, searching a small number of databases, and merging results returned by different databases. This paper presents algorithms for each task. It also discusses how to reorganize conventional test collections into multi-database testbeds, and evaluation methodologies for multi-database experiments. A broad and diverse group of experimental results is presented to demonstrate that the algorithms are effective, efficient, robust, and scalable
  8. Barker, P.: ¬A study of the use of the X.500 directory for bibliographic querying (1995) 0.01 
    0.0063121966 = product of:
  0.03787318 = sum of:
    0.03787318 = weight(_text_:searching in 1505) [ClassicSimilarity], result of:
      0.03787318 = score(doc=1505,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 1505, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=1505)
  0.16666667 = coord(1/6)
    Abstract
    Reports on the work of the ABDUX project to investigate the use of the standardized protocol for the X.500 directory service for searching distributed bibliographic databases. It is a joint project between the Computer Science Department of the University College London, and the Library and Computer Service of Brunel University, UK. Gives a design overview and discusses the implementation phase of the project which involved: enhancements to an X.500 system; implementing user interfaces; and gathering test data for the system. Examines experiences with the system, and assesses why interest in the system has been less than hoped for. Puts forward a model for bibliographic querying which recognises the role of other protocols. Summarizes the main lessons to be drawn from the project
  9. Xu, J.; Croft, W.B.: Topic-based language models for distributed retrieval (2000) 0.01 
    0.0063121966 = product of:
  0.03787318 = sum of:
    0.03787318 = weight(_text_:searching in 38) [ClassicSimilarity], result of:
      0.03787318 = score(doc=38,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 38, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=38)
  0.16666667 = coord(1/6)
    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
  10. Nicholson, D.; Wake, S.: HILT: subject retrieval in a distributed environment (2003) 0.01 
    0.0063121966 = product of:
  0.03787318 = sum of:
    0.03787318 = weight(_text_:searching in 3810) [ClassicSimilarity], result of:
      0.03787318 = score(doc=3810,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 3810, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=3810)
  0.16666667 = coord(1/6)
    Abstract
    The HILT High Level Thesaurus Project aims to study and report an the problern of cross-searching and browsing by subject across a range of communities, services, and service or resource types in the UK given the wide range of subject schemes and associated practices in place in the communities in question (Libraries, Museums, Archives, and Internet Services) and taking the international context into consideration. The paper reports an progess to date, focusing particularly an the inter-community consensus reached at a recent Stakeholder Workshop.
  11. Coyle, K.: ¬The virtual union catalog : a comparative study (2000) 0.01 
    0.0063121966 = product of:
  0.03787318 = sum of:
    0.03787318 = weight(_text_:searching in 1230) [ClassicSimilarity], result of:
      0.03787318 = score(doc=1230,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 1230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=1230)
  0.16666667 = coord(1/6)
    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.
  12. Krause, J.: Konkretes zur These, die Standardisierung von der Heterogenität her zu denken (2004) 0.01 
    0.0056583136 = product of:
  0.03394988 = sum of:
    0.03394988 = product of:
      0.06789976 = sum of:
        0.06789976 = weight(_text_:etc in 2259) [ClassicSimilarity], result of:
          0.06789976 = score(doc=2259,freq=2.0), product of:
            0.18910104 = queryWeight, product of:
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.03491209 = queryNorm
            0.35906604 = fieldWeight in 2259, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.046875 = fieldNorm(doc=2259)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)
    Abstract
    Die Entwicklungsperspektive für den Bereich wissenschaftlicher Information sind innovative, integrierende Fachportale, die in einem Wissenschaftsportal zusammengefasst werden und die allgemeinen, fachübergreifenden Zugänge der Bibliotheken mit spezifischen Fachzugängen verbinden. In dieser Struktur kann der Kunde mit qualitativ hochwertigen Such- und Selektionsinstrumenten auf wissenschaftsrelevante Informationen (Literaturnachweise, Experten und Forschungsreferenzen, Volltexte, Materialien, Daten, Fakten, Linklisten etc.) zugreifen. Sowohl theoriegeleitete Analysen und Bestandsaufnahmen der wissenschaftlichen Informationslandschaft als auch die Ergebnisse der neueren Benutzerumfragen zum Informationsverhalten und zum -bedarf von Wissenschaftlern weisen auf die Wünschbarkeit solch einer Entwicklung hin. Heute ist ein weitgehender Konsens über das anzustrebende Ziel erreicht. Die Herausforderung für die Weiterentwicklung ist somit nicht die Akzeptanz der angestrebten Zielvorstellung, sondern die Frage, wie sie zu erreichen ist. Die im Folgenden diskutierte Entwicklung von bilateralen Transferkomponenten zur Behandlung semantischer Heterogenität zwischen Dokumentensammlungen mit unterschiedlicher Inhaltserschließung zeigt für einen wesentlichen Teil der Frage nach dem »Wie« der Zielerreichung eine tragfähige Lösungsstrategie auf. Sie wird theoretisch und praktisch konkretisiert, der Entwicklungsstand beschrieben und die konkreten Einsatzmöglichkeiten werden aufgezeigt.
  13. Severiens, T.; Hohlfeld, M.; Zimmermann, K.; Hilf, E.R.: PhysDoc - a distributed network of physics institutions documents : collecting, indexing, and searching high quality documents by using harvest (2000) 0.01 
    0.005260164 = product of:
  0.031560984 = sum of:
    0.031560984 = weight(_text_:searching in 6470) [ClassicSimilarity], result of:
      0.031560984 = score(doc=6470,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.22347288 = fieldWeight in 6470, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6470)
  0.16666667 = coord(1/6)
  14. Teets, M.; Murray, P.: Metasearch authentication and access management (2006) 0.01 
    0.005260164 = product of:
  0.031560984 = sum of:
    0.031560984 = weight(_text_:searching in 1154) [ClassicSimilarity], result of:
      0.031560984 = score(doc=1154,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.22347288 = fieldWeight in 1154, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1154)
  0.16666667 = coord(1/6)
    Abstract
    Metasearch - also called parallel search, federated search, broadcast search, and cross-database search - has become commonplace in the information community's vocabulary. All speak to a common theme of searching and retrieving from multiple databases, sources, platforms, protocols, and vendors at the point of the user's request. Metasearch services rely on a variety of approaches including open standards (such as NISO's Z39.50 and SRU/SRW), proprietary programming interfaces, and "screen scraping." However, the absence of widely supported standards, best practices, and tools makes the metasearch environment less efficient for the metasearch provider, the content provider, and ultimately the end-user. To spur the development of widely supported standards and best practices, the National Information Standards Organization (NISO) sponsored a Metasearch Initiative in 2003 to enable: * metasearch service providers to offer more effective and responsive services, * content providers to deliver enhanced content and protect their intellectual property, and * libraries to deliver a simple search (a.k.a. "Google") that covers the breadth of their vetted commercial and free resources. The Access Management Task Group was one of three groups chartered by NISO as part of the Metasearch Initiative. The focus of the group was on gathering requirements for Metasearch authentication and access needs, inventorying existing processes, developing a series of formal use cases describing the access needs, recommending best practices given today's processes, and recommending and pursing changes to current solutions to better support metasearch applications. In September 2005, the group issued their final report and recommendation. This article summarizes the group's work and final recommendation.
  15. Fang, L.: ¬A developing search service : heterogeneous resources integration and retrieval system (2004) 0.01 
    0.005260164 = product of:
  0.031560984 = sum of:
    0.031560984 = weight(_text_:searching in 1193) [ClassicSimilarity], result of:
      0.031560984 = score(doc=1193,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.22347288 = fieldWeight in 1193, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1193)
  0.16666667 = coord(1/6)
    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.
  16. Milanesi, C.: Möglichkeiten der Kooperation im Rahmen von Subject Gateways : das Euler-Projekt im Vergleich mit weiteren europäischen Projekten (2001) 0.00 
    0.0047301063 = product of:
  0.028380638 = sum of:
    0.028380638 = product of:
      0.056761276 = sum of:
        0.056761276 = weight(_text_:22 in 4865) [ClassicSimilarity], result of:
          0.056761276 = score(doc=4865,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = 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.16666667 = coord(1/6)
    Date
    22. 6.2002 19:41:59
  17. Neuroth, H.: Suche in verteilten "Quality-controlled Subject Gateways" : Entwicklung eines Metadatenprofils (2002) 0.00 
    0.004715261 = product of:
  0.028291566 = sum of:
    0.028291566 = product of:
      0.056583133 = sum of:
        0.056583133 = weight(_text_:etc in 2522) [ClassicSimilarity], result of:
          0.056583133 = score(doc=2522,freq=2.0), product of:
            0.18910104 = queryWeight, product of:
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.03491209 = queryNorm
            0.2992217 = fieldWeight in 2522, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2522)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)
    Abstract
    Die seit ca. 1996 rasche Entwicklung des Internet bzw. des World Wide Web (WWW) hat die Praxis der Veröffentlichung, Verbreitung und Nutzung wissenschaftlicher Informationen grundlegend verändert. Um diese Informationen suchbar und retrievalfähig zu gestalten, ist in den letzten Jahren international viel diskutiert worden. Ein vielversprechender Ansatz, diesen neuen Herausforderungen zu begegnen, liegt in der Entwicklung von Metadatenprofilen. Da durch das Internet verschiedene Datenbestände, die von unterschiedlichen Bereichen wie Museen, Bibliotheken, Archiven etc. vorgehalten werden, unter einer Oberfläche durchsucht werden können, können Metadaten auch in diesem Bereich dazu beitragen, ein einheitliches Konzept zur Beschreibung und zum Retrieval von Online-Ressourcen zu entwickeln. Um die verteilt liegenden Dokumente unter einer Oberfläche für eine qualitativ hochwertige Recherche ("Cross-Search`) anbieten zu können, ist die Verständigung auf ein Core-Set an Metadaten und daran anschließend verschiedene Mappingprozesse ("Cross-walk`) von den lokalen Metadatenformaten zu dem Format des Core-Set an Metadaten notwendig. Ziel des Artikels' ist es, die einzelnen Schritte, die für die Entwicklung eines Metadatenprofils für die gemeinsame Suche über verteilte Metadatensammlungen notwendig sind, aufzuzeigen.
  18. Roszkowski, M.; Lukas, C.: ¬A distributed architecture for resource discovery using metadata (1998) 0.00 
    0.004208131 = product of:
  0.025248786 = sum of:
    0.025248786 = weight(_text_:searching in 1256) [ClassicSimilarity], result of:
      0.025248786 = score(doc=1256,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.1787783 = fieldWeight in 1256, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03125 = fieldNorm(doc=1256)
  0.16666667 = coord(1/6)
    Abstract
    As well developed as both the Scout Reports and Signpost are, they cannot capture the wealth of high-quality content that is available on the Internet. An obvious next step toward increasing the usefulness of our own collection and its value to our customer base is to partner with other high-quality content providers who have developed similar collections and to develop a single, virtual collection. Project Isaac (working title) is the Internet Scout Project's latest resource discovery effort. Project Isaac involves the development of a research testbed that allows experimentation with protocols and algorithms for creating, maintaining, indexing and searching distributed collections of metadata. Project Isaac's infrastructure uses standard Internet protocols, such as the Lightweight Directory Access Protocol (LDAP) and the Common Indexing Protocol (CIP) to distribute queries, return results, and exchange index or centroid information. The overall goal is to support a single-search interface to geographically distributed and independently maintained metadata collections.
  19. Dupuis, P.; Lapointe, J.: Developpement d'un outil documentaire à Hydro-Quebec : le Thesaurus HQ (1997) 0.00 
    0.0031534042 = product of:
  0.018920425 = sum of:
    0.018920425 = product of:
      0.03784085 = sum of:
        0.03784085 = weight(_text_:22 in 3173) [ClassicSimilarity], result of:
          0.03784085 = score(doc=3173,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = queryNorm
            0.30952093 = fieldWeight in 3173, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=3173)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)
    Source
    Argus. 26(1997) no.3, S.16-22
  20. Dempsey, L.; Russell, R.; Kirriemur, J.W.: Towards distributed library systems : Z39.50 in a European context (1996) 0.00 
    0.0031534042 = product of:
  0.018920425 = sum of:
    0.018920425 = product of:
      0.03784085 = sum of:
        0.03784085 = weight(_text_:22 in 127) [ClassicSimilarity], result of:
          0.03784085 = score(doc=127,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = queryNorm
            0.30952093 = fieldWeight in 127, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=127)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)
    Source
    Program. 30(1996) no.1, S.1-22

Authors

Years

Languages

  • e 23
  • d 6
  • f 1
  • More… Less…

Types

  • a 27
  • el 5
  • m 2
  • s 1
  • x 1
  • More… Less…

Themes

Subjects

Classifications