Search (35 results, page 1 of 2)

  • × theme_ss:"Verteilte bibliographische Datenbanken"
  • × type_ss:"a"
  • × year_i:[2000 TO 2010}
  1. Lopatenko, A.; Asserson, A.; Jeffery, K.G.: CERIF - Information retrieval of research information in a distributed heterogeneous environment (2002) 0.09 
    0.08844386 = product of:
  0.14740643 = sum of:
    0.03970641 = weight(_text_:retrieval in 3597) [ClassicSimilarity], result of:
      0.03970641 = score(doc=3597,freq=4.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.2835858 = fieldWeight in 3597, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3597)
    0.075019486 = weight(_text_:semantic in 3597) [ClassicSimilarity], result of:
      0.075019486 = score(doc=3597,freq=4.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.38979942 = fieldWeight in 3597, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.046875 = fieldNorm(doc=3597)
    0.03268054 = product of:
      0.06536108 = sum of:
        0.06536108 = weight(_text_:web in 3597) [ClassicSimilarity], result of:
          0.06536108 = score(doc=3597,freq=8.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.43268442 = fieldWeight in 3597, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=3597)
      0.5 = coord(1/2)
  0.6 = coord(3/5)
    Abstract
    User demands to have access to complete and actual information about research may require integration of data from different CRISs. CRISs are rarely homogenous systems and problems of CRISs integration must be addressed from technological point of view. Implementation of CRIS providing access to heterogeneous data distributed among a number of CRISs is described. A few technologies - distributed databases, web services, semantic web are used for distributed CRIS to address different user requirements. Distributed databases serve to implement very efficient integration of homogenous systems, web services - to provide open access to research information, semantic web - to solve problems of integration semantically and structurally heterogeneous data sources and provide intelligent data retrieval interfaces. The problems of data completeness in distributed systems are addressed and CRIS-adequate solution for data completeness is suggested.
  2. Polleres, A.; Lausen, H.; Lara, R.: Semantische Beschreibung von Web Services (2006) 0.06 
    0.055184163 = product of:
  0.1379604 = sum of:
    0.08752273 = weight(_text_:semantic in 5813) [ClassicSimilarity], result of:
      0.08752273 = score(doc=5813,freq=4.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.45476598 = fieldWeight in 5813, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5813)
    0.05043768 = product of:
      0.10087536 = sum of:
        0.10087536 = weight(_text_:web in 5813) [ClassicSimilarity], result of:
          0.10087536 = score(doc=5813,freq=14.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.6677857 = fieldWeight in 5813, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5813)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    In diesem Kapitel werden Anwendungsgebiete und Ansätze für die semantische Beschreibung von Web Services behandelt. Bestehende Web Service Technologien leisten einen entscheidenden Beitrag zur Entwicklung verteilter Anwendungen dadurch, dass weithin akzeptierte Standards vorliegen, die die Kommunikation zwischen Anwendungen bestimmen und womit deren Kombination zu komplexeren Einheiten ermöglicht wird. Automatisierte Mechanismen zum Auffinden geeigneter Web Services und deren Komposition dagegen werden von bestehenden Technologien in vergleichsweise geringem Maß unterstützt. Ähnlich wie bei der Annotation statischer Daten im "Semantic Web" setzen Forschung und Industrie große Hoffnungen in die semantische Beschreibung von Web Services zur weitgehenden Automatisierung dieser Aufgaben.
    Source
    Semantic Web: Wege zur vernetzten Wissensgesellschaft. Hrsg.: T. Pellegrini, u. A. Blumauer
  3. Johnson, E.H.: Objects for distributed heterogeneous information retrieval (2000) 0.05 
    0.050136723 = product of:
  0.1253418 = sum of:
    0.033088673 = weight(_text_:retrieval in 6959) [ClassicSimilarity], result of:
      0.033088673 = score(doc=6959,freq=4.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.23632148 = fieldWeight in 6959, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6959)
    0.09225313 = sum of:
      0.060896598 = weight(_text_:web in 6959) [ClassicSimilarity], result of:
        0.060896598 = score(doc=6959,freq=10.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.40312994 = fieldWeight in 6959, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=6959)
      0.031356532 = weight(_text_:22 in 6959) [ClassicSimilarity], result of:
        0.031356532 = score(doc=6959,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = 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.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
  4. Avrahami, T.T.; Yau, L.; Si, L.; Callan, J.P.: ¬The FedLemur project : Federated search in the real world (2006) 0.04 
    0.039354023 = product of:
  0.09838505 = sum of:
    0.028076671 = weight(_text_:retrieval in 5271) [ClassicSimilarity], result of:
      0.028076671 = score(doc=5271,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.20052543 = fieldWeight in 5271, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5271)
    0.07030838 = sum of:
      0.03268054 = weight(_text_:web in 5271) [ClassicSimilarity], result of:
        0.03268054 = score(doc=5271,freq=2.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.21634221 = fieldWeight in 5271, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.046875 = fieldNorm(doc=5271)
      0.03762784 = weight(_text_:22 in 5271) [ClassicSimilarity], result of:
        0.03762784 = score(doc=5271,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = 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.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
  5. Croft, W.B.: Combining approaches to information retrieval (2000) 0.04 
    0.038301237 = product of:
  0.09575309 = sum of:
    0.07941282 = weight(_text_:retrieval in 6862) [ClassicSimilarity], result of:
      0.07941282 = score(doc=6862,freq=16.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.5671716 = fieldWeight in 6862, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=6862)
    0.01634027 = product of:
      0.03268054 = sum of:
        0.03268054 = weight(_text_:web in 6862) [ClassicSimilarity], result of:
          0.03268054 = score(doc=6862,freq=2.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.21634221 = fieldWeight in 6862, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=6862)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    The combination of different text representations and search strategies has become a standard technique for improving the effectiveness of information retrieval. Combination, for example, has been studied extensively in the TREC evaluations and is the basis of the "meta-search" engines used on the Web. This paper examines the development of this technique, including both experimental results and the retrieval models that have been proposed as formal frameworks for combination. We show that combining approaches for information retrieval can be modeled as combining the outputs of multiple classifiers based on one or more representations, and that this simple model can provide explanations for many of the experimental results. We also show that this view of combination is very similar to the inference net model, and that a new approach to retrieval based on language models supports combination and can be integrated with the inference net model
    Series
    The Kluwer international series on information retrieval; 7
    Source
    Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
  6. Arch-Int, N.; Sophatsathit, P.: ¬A semantic information gathering approach for heterogeneous information sources on WWW (2003) 0.02 
    0.021218713 = product of:
  0.10609356 = sum of:
    0.10609356 = weight(_text_:semantic in 4694) [ClassicSimilarity], result of:
      0.10609356 = score(doc=4694,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.5512596 = fieldWeight in 4694, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.09375 = fieldNorm(doc=4694)
  0.2 = coord(1/5)
  7. Meiert, M.: Elektronische Publikationen an Hochschulen : Modellierung des elektronischen Publikationsprozesses am Beispiel der Universität Hildesheim (2006) 0.02 
    0.018756237 = product of:
  0.04689059 = sum of:
    0.028076671 = weight(_text_:retrieval in 5974) [ClassicSimilarity], result of:
      0.028076671 = score(doc=5974,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.20052543 = fieldWeight in 5974, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5974)
    0.01881392 = product of:
      0.03762784 = sum of:
        0.03762784 = weight(_text_:22 in 5974) [ClassicSimilarity], result of:
          0.03762784 = score(doc=5974,freq=2.0), product of:
            0.16209066 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04628742 = queryNorm
            0.23214069 = fieldWeight in 5974, 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=5974)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Date
    1. 9.2006 13:22:15
    Source
    Effektive Information Retrieval Verfahren in Theorie und Praxis: ausgewählte und erweiterte Beiträge des Vierten Hildesheimer Evaluierungs- und Retrievalworkshop (HIER 2005), Hildesheim, 20.7.2005. Hrsg.: T. Mandl u. C. Womser-Hacker
  8. Xu, J.; Croft, W.B.: Topic-based language models for distributed retrieval (2000) 0.02 
    0.016846003 = product of:
  0.08423001 = sum of:
    0.08423001 = weight(_text_:retrieval in 38) [ClassicSimilarity], result of:
      0.08423001 = score(doc=38,freq=18.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.60157627 = fieldWeight in 38, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.024915 = idf(docFreq=5836, 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
    Series
    The Kluwer international series on information retrieval; 7
    Source
    Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
  9. Heery, R.: Information gateways : collaboration and content (2000) 0.02 
    0.01640529 = product of:
  0.08202645 = sum of:
    0.08202645 = sum of:
      0.038127303 = weight(_text_:web in 4866) [ClassicSimilarity], result of:
        0.038127303 = score(doc=4866,freq=2.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.25239927 = fieldWeight in 4866, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4866)
      0.043899145 = weight(_text_:22 in 4866) [ClassicSimilarity], result of:
        0.043899145 = score(doc=4866,freq=2.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = 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.2 = coord(1/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
  10. Callan, J.: Distributed information retrieval (2000) 0.02 
    0.016047154 = product of:
  0.080235764 = sum of:
    0.080235764 = weight(_text_:retrieval in 31) [ClassicSimilarity], result of:
      0.080235764 = score(doc=31,freq=12.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.5730491 = fieldWeight in 31, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=31)
  0.2 = coord(1/5)
    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
    Series
    The Kluwer international series on information retrieval; 7
    Source
    Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
  11. Crestani, F.; Wu, S.: Testing the cluster hypothesis in distributed information retrieval (2006) 0.02 
    0.015519964 = product of:
  0.077599816 = sum of:
    0.077599816 = weight(_text_:retrieval in 984) [ClassicSimilarity], result of:
      0.077599816 = score(doc=984,freq=22.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.554223 = fieldWeight in 984, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=984)
  0.2 = coord(1/5)
    Abstract
    How to merge and organise query results retrieved from different resources is one of the key issues in distributed information retrieval. Some previous research and experiments suggest that cluster-based document browsing is more effective than a single merged list. Cluster-based retrieval results presentation is based on the cluster hypothesis, which states that documents that cluster together have a similar relevance to a given query. However, while this hypothesis has been demonstrated to hold in classical information retrieval environments, it has never been fully tested in heterogeneous distributed information retrieval environments. Heterogeneous document representations, the presence of document duplicates, and disparate qualities of retrieval results, are major features of an heterogeneous distributed information retrieval environment that might disrupt the effectiveness of the cluster hypothesis. In this paper we report on an experimental investigation into the validity and effectiveness of the cluster hypothesis in highly heterogeneous distributed information retrieval environments. The results show that although clustering is affected by different retrieval results representations and quality, the cluster hypothesis still holds and that generating hierarchical clusters in highly heterogeneous distributed information retrieval environments is still a very effective way of presenting retrieval results to users.
  12. Neuroth, H.: Suche in verteilten "Quality-controlled Subject Gateways" : Entwicklung eines Metadatenprofils (2002) 0.01 
    0.014805648 = product of:
  0.03701412 = sum of:
    0.023397226 = weight(_text_:retrieval in 2522) [ClassicSimilarity], result of:
      0.023397226 = score(doc=2522,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.16710453 = fieldWeight in 2522, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2522)
    0.013616893 = product of:
      0.027233787 = sum of:
        0.027233787 = weight(_text_:web in 2522) [ClassicSimilarity], result of:
          0.027233787 = score(doc=2522,freq=2.0), product of:
            0.15105948 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.04628742 = queryNorm
            0.18028519 = fieldWeight in 2522, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2522)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    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.
  13. Kaizik, A.; Gödert, W.; Milanesi, C.: Erfahrungen und Ergebnisse aus der Evaluierung des EU-Projektes EULER im Rahmen des an der FH Köln angesiedelten Projektes EJECT (Evaluation von Subject Gateways des World Wide Web (2001) 0.01 
    0.014315724 = product of:
  0.07157862 = sum of:
    0.07157862 = sum of:
      0.027233787 = weight(_text_:web in 5801) [ClassicSimilarity], result of:
        0.027233787 = score(doc=5801,freq=2.0), product of:
          0.15105948 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.04628742 = queryNorm
          0.18028519 = fieldWeight in 5801, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5801)
      0.04434483 = weight(_text_:22 in 5801) [ClassicSimilarity], result of:
        0.04434483 = score(doc=5801,freq=4.0), product of:
          0.16209066 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04628742 = queryNorm
          0.27358043 = fieldWeight in 5801, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5801)
  0.2 = coord(1/5)
    Date
    22. 6.2002 19:42:22
  14. Kunz, M.: Subject retrieval in distributed resources : a short review of recent developments (2003) 0.01 
    0.011347052 = product of:
  0.05673526 = sum of:
    0.05673526 = weight(_text_:retrieval in 1624) [ClassicSimilarity], result of:
      0.05673526 = score(doc=1624,freq=6.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.40520695 = fieldWeight in 1624, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1624)
  0.2 = coord(1/5)
    Abstract
    Subject-based retrieval in distributed resources is a current problem in online searches for bibliographic references. Building portals to similar resources is only the ferst step, the subsequent navigation via different search interfaces presents certain difficulties. To make retrieval easier it is necessary to adapt these different resources. Potential approaches (standardisation as opposed to "cross-walks") and methods (automated as opposed to intellectual effort) will be discussed. This includes a Brief appraisal of the future of work with multilingual terminology: - The "classical" approach (Multilingual Thesauri), - The "Internet" approach (linking) Recent developments in mono- and multilingual environments will be presented (MACS, CARMEN, Economics Crosswalk).
  15. Fang, L.: ¬A developing search service : heterogeneous resources integration and retrieval system (2004) 0.01 
    0.00935889 = product of:
  0.04679445 = sum of:
    0.04679445 = weight(_text_:retrieval in 1193) [ClassicSimilarity], result of:
      0.04679445 = score(doc=1193,freq=8.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.33420905 = fieldWeight in 1193, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, 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.
  16. Friedrich, M.; Schimkat, R.-D.; Küchlin, W.: Information retrieval in distributed environments based on context-aware, proactive documents (2002) 0.01 
    0.009264829 = product of:
  0.04632414 = sum of:
    0.04632414 = weight(_text_:retrieval in 3608) [ClassicSimilarity], result of:
      0.04632414 = score(doc=3608,freq=4.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.33085006 = fieldWeight in 3608, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3608)
  0.2 = coord(1/5)
    Abstract
    In this position paper we propose a document-centric middleware component called Living Documents to support context-aware information retrieval in distributed communities. A Living Document acts as a micro server for a document which contains computational services, a semi-structured knowledge repository to uniformly store and access context-related information, and finally the document's digital content. Our initial prototype of Living Documents is based an the concept of mobile agents and implemented in Java and XML.
  17. 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.00884113 = product of:
  0.04420565 = sum of:
    0.04420565 = weight(_text_:semantic in 5591) [ClassicSimilarity], result of:
      0.04420565 = score(doc=5591,freq=2.0), product of:
        0.19245663 = queryWeight, product of:
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.04628742 = queryNorm
        0.22969149 = fieldWeight in 5591, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1578603 = idf(docFreq=1879, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5591)
  0.2 = coord(1/5)
    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.
  18. Veen, T. van; Oldroyd, B.: Search and retrieval in The European Library : a new approach (2004) 0.01 
    0.008105038 = product of:
  0.040525187 = sum of:
    0.040525187 = weight(_text_:retrieval in 1164) [ClassicSimilarity], result of:
      0.040525187 = score(doc=1164,freq=6.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.28943354 = fieldWeight in 1164, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, 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.
  19. Nicholson, D.; Wake, S.: HILT: subject retrieval in a distributed environment (2003) 0.01 
    0.007941282 = product of:
  0.03970641 = sum of:
    0.03970641 = weight(_text_:retrieval in 3810) [ClassicSimilarity], result of:
      0.03970641 = score(doc=3810,freq=4.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.2835858 = fieldWeight in 3810, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3810)
  0.2 = coord(1/5)
    Source
    Subject retrieval in a networked environment: Proceedings of the IFLA Satellite Meeting held in Dublin, OH, 14-16 August 2001 and sponsored by the IFLA Classification and Indexing Section, the IFLA Information Technology Section and OCLC. Ed.: I.C. McIlwaine
  20. Klas, C.-P.; Kriewel, S.; Schaefer, A.; Fischer, G.: ¬Das DAFFODIL System : strategische Literaturrecherche in Digitalen Bibliotheken (2006) 0.01 
    0.007487112 = product of:
  0.03743556 = sum of:
    0.03743556 = weight(_text_:retrieval in 5014) [ClassicSimilarity], result of:
      0.03743556 = score(doc=5014,freq=2.0), product of:
        0.14001551 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04628742 = queryNorm
        0.26736724 = fieldWeight in 5014, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=5014)
  0.2 = coord(1/5)
    Source
    Effektive Information Retrieval Verfahren in Theorie und Praxis: ausgewählte und erweiterte Beiträge des Vierten Hildesheimer Evaluierungs- und Retrievalworkshop (HIER 2005), Hildesheim, 20.7.2005. Hrsg.: T. Mandl u. C. Womser-Hacker

Authors

Languages

  • e 21
  • d 14

Themes