Search (1420 results, page 1 of 71)

  • × year_i:[1990 TO 2000}
  1. Gudes, E.: ¬A uniform indexing scheme for object-oriented databases (1997) 0.12 
    0.12193707 = product of:
  0.24387413 = sum of:
    0.24387413 = sum of:
      0.18973003 = weight(_text_:tree in 1694) [ClassicSimilarity], result of:
        0.18973003 = score(doc=1694,freq=2.0), product of:
          0.32745647 = queryWeight, product of:
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.049953517 = queryNorm
          0.57940537 = fieldWeight in 1694, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.0625 = fieldNorm(doc=1694)
      0.054144096 = weight(_text_:22 in 1694) [ClassicSimilarity], result of:
        0.054144096 = score(doc=1694,freq=2.0), product of:
          0.17492871 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049953517 = queryNorm
          0.30952093 = fieldWeight in 1694, 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=1694)
  0.5 = coord(1/2)
    Abstract
    Proposes an uniform indexing scheme for enhancing object-oriented databases performance. It is based on a single B-tree and combines both the hierarchical and nested indexing schemes. the uniformity of this scheme enables compact and optimised code for dealing with a large range of queries on the one hand, and flexibility in adding and removing indexed paths on the other hand. Discusses the performance and presents an extensive experimental analysis for the class-hierarchy case. The results show the advantages of the scheme for small range, clustered sets queries
    Source
    Information systems. 22(1997) no.4, S.199-221
  2. Bertelmann, R.; Rusch-Feja, D.: Informationsretrieval im Internet : Surfen, Browsen, Suchen - mit einem Überblick über strukturierte Informationsangebote (1997) 0.11 
    0.10669494 = product of:
  0.21338987 = sum of:
    0.21338987 = sum of:
      0.16601379 = weight(_text_:tree in 217) [ClassicSimilarity], result of:
        0.16601379 = score(doc=217,freq=2.0), product of:
          0.32745647 = queryWeight, product of:
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.049953517 = queryNorm
          0.5069797 = fieldWeight in 217, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.0546875 = fieldNorm(doc=217)
      0.047376085 = weight(_text_:22 in 217) [ClassicSimilarity], result of:
        0.047376085 = score(doc=217,freq=2.0), product of:
          0.17492871 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049953517 = queryNorm
          0.2708308 = fieldWeight in 217, 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=217)
  0.5 = coord(1/2)
    Abstract
    Das gezielte Suchen im Internet findet in erster Linie mit Hilfe der Suchmaschinen statt. Daneben gibt es aber bereits eine Fülle von strukturierten Informationsangeboten, aufbereiteten Listen und Sammelstellen, die als Clearinghouse, Subject Gateway, Subject Tree oder Resource Pages bezeichnet werden. Solche intellektuell erstellten Übersichten geben in der Regel bereits Hinweise zu Inhalt und fachlichem Niveau der Quelle. Da die Art und Weise der Aufbereitung bei den Sammelstellen sehr unterschiedlich funktioniert, ist die Kenntnis ihrer Erschließungskriterien für ein erfolgreiches Retrieval unverzichtbar
    Date
    9. 7.2000 11:31:22
  3. Walker, T.D.: Medieval faceted knowledge classification : Ramon Llull's trees of science (1996) 0.11 
    0.10669494 = product of:
  0.21338987 = sum of:
    0.21338987 = sum of:
      0.16601379 = weight(_text_:tree in 3232) [ClassicSimilarity], result of:
        0.16601379 = score(doc=3232,freq=2.0), product of:
          0.32745647 = queryWeight, product of:
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.049953517 = queryNorm
          0.5069797 = fieldWeight in 3232, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3232)
      0.047376085 = weight(_text_:22 in 3232) [ClassicSimilarity], result of:
        0.047376085 = score(doc=3232,freq=2.0), product of:
          0.17492871 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049953517 = queryNorm
          0.2708308 = fieldWeight in 3232, 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=3232)
  0.5 = coord(1/2)
    Abstract
    Ramon Llull [auch: Raimundus Lullus] (1232-1316) wrote many didactic and theoretical works that demonstrate an exhaustive and creative approach to the organization of knowledge. His encyclopedic 'Arbre de scìencia' (1296) was a multi-volume summation of human knowledge, organized according to a plan that could be applied to other works. Set against a background of Lull's other tree-based works, including the 'Libre del gentil e dels tres savis' (1274-1289) and the 'Arbre de filosofia desiderat' (1294), the 'Arbre de scìencia' is described and analyzed as a faceted classification system
    Date
    26. 9.2010 19:02:22
  4. French, J.C.; Brown, D.E.; Kim, N.-H.: ¬A classification approach to Boolean query reformulation (1997) 0.09 
    0.094120964 = product of:
  0.18824193 = sum of:
    0.18824193 = product of:
      0.37648386 = sum of:
        0.37648386 = weight(_text_:tree in 197) [ClassicSimilarity], result of:
          0.37648386 = score(doc=197,freq=14.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            1.1497219 = fieldWeight in 197, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=197)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    One of the difficulties in using current Boolean-based information retrieval systems is that it is hard for a user, especially a novice, to formulate an effective Boolean query. Query reformulation can be even more difficult and complex than formulation since users often have difficulty incorporating the new information gained from the previous search into the next query. In this article, query reformulation is viewed as a classification problem, that is, classifying documents as either relevant or non relevant. A new reformulation algorithm is proposed which builds a tree-structure classifier, called a query tree, at each reformulation from a set of feedback documents retrieved from the previous search. The query tree can easily be transformed into a Boolean query. The query tree is compared to two query reformulation algorithms on benchmark test sets (CACM, CISI, and Medlars). In most experiments, the query tree showed significant improvements in precision over the 2 algorithms compared in this study. We attribute this improved performance to the ability of the query tree algorithm to select good search terms and to represent the relationships among search terms into a tree structure
  5. Nicholson, D.; Steele, M.: CATRIONA: a distributed, locally-oriented. Z39.50 OPAC-based approach to cataloguing the Internet (1996) 0.09 
    0.09145281 = product of:
  0.18290561 = sum of:
    0.18290561 = sum of:
      0.14229754 = weight(_text_:tree in 6734) [ClassicSimilarity], result of:
        0.14229754 = score(doc=6734,freq=2.0), product of:
          0.32745647 = queryWeight, product of:
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.049953517 = queryNorm
          0.43455404 = fieldWeight in 6734, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.046875 = fieldNorm(doc=6734)
      0.04060807 = weight(_text_:22 in 6734) [ClassicSimilarity], result of:
        0.04060807 = score(doc=6734,freq=2.0), product of:
          0.17492871 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049953517 = queryNorm
          0.23214069 = fieldWeight in 6734, 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=6734)
  0.5 = coord(1/2)
    Abstract
    Describes the origins of the CATaloguing and Retrieval of Information Over Network Applications (CATRIONA) Study in the BUBL Subject Tree service and nots its aims: to investigate the requirements for developing procedures and applications for cataloguing and retrieval of networked resources (particularly via the Internet); and to explore the feasibility of a collaborative project to develop and integrate them with existing library systems. The project established that a distributed catalogue of networked resources integrated with standard Z39.50 library system OPAC interfaces with information on hard copy resources is already a practical proposition at a basic level. Notes that at least one Z30.50 OPAC client can searcg remote Z39.50 OPACs, retrieve USMARC records with URLs in MARC field 856
    Series
    Cataloging and classification quarterly; vol.22, nos.3/4
  6. Falquet, G.; Guyot, J.; Nerima, L.: Languages and tools to specify hypertext views on databases (1999) 0.09 
    0.09145281 = product of:
  0.18290561 = sum of:
    0.18290561 = sum of:
      0.14229754 = weight(_text_:tree in 3968) [ClassicSimilarity], result of:
        0.14229754 = score(doc=3968,freq=2.0), product of:
          0.32745647 = queryWeight, product of:
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.049953517 = queryNorm
          0.43455404 = fieldWeight in 3968, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            6.5552235 = idf(docFreq=170, maxDocs=44218)
            0.046875 = fieldNorm(doc=3968)
      0.04060807 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
        0.04060807 = score(doc=3968,freq=2.0), product of:
          0.17492871 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049953517 = queryNorm
          0.23214069 = fieldWeight in 3968, 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=3968)
  0.5 = coord(1/2)
    Abstract
    We present a declarative language for the construction of hypertext views on databases. The language is based on an object-oriented data model and a simple hypertext model with reference and inclusion links. A hypertext view specification consists in a collection of parameterized node schemes which specify how to construct node and links instances from the database contents. We show how this language can express different issues in hypertext view design. These include: the direct mapping of objects to nodes; the construction of complex nodes based on sets of objects; the representation of polymorphic sets of objects; and the representation of tree and graph structures. We have defined sublanguages corresponding to particular database models (relational, semantic, object-oriented) and implemented tools to generate Web views for these database models
    Date
    21.10.2000 15:01:22
  7. Koyama, M.: ¬A fast retrieving algorithm of hierarchical relationships using tree structures (1998) 0.08 
    0.083006896 = product of:
  0.16601379 = sum of:
    0.16601379 = product of:
      0.33202758 = sum of:
        0.33202758 = weight(_text_:tree in 6403) [ClassicSimilarity], result of:
          0.33202758 = score(doc=6403,freq=2.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            1.0139594 = fieldWeight in 6403, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.109375 = fieldNorm(doc=6403)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  8. Chang, R.: ¬The development of indexing technology (1993) 0.07 
    0.0670797 = product of:
  0.1341594 = sum of:
    0.1341594 = product of:
      0.2683188 = sum of:
        0.2683188 = weight(_text_:tree in 7024) [ClassicSimilarity], result of:
          0.2683188 = score(doc=7024,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.81940293 = fieldWeight in 7024, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0625 = fieldNorm(doc=7024)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Reviews the basic techniques of computerized indexing, including various file accessing methods such as: Sequential Access Method (SAM); Direct Access Method (DAM); Indexed Sequential Access Method (ISAM), and Virtual Indexed Sequential Access Method (VSAM); and various B-tree (balanced tree)structures. Illustrates how records are stored and accessed, and how B-trees are used to for improving the operations of information retrieval and maintenance
  9. Chang, R.: Keyword searching and indexing (1993) 0.07 
    0.0670797 = product of:
  0.1341594 = sum of:
    0.1341594 = product of:
      0.2683188 = sum of:
        0.2683188 = weight(_text_:tree in 7223) [ClassicSimilarity], result of:
          0.2683188 = score(doc=7223,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.81940293 = fieldWeight in 7223, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0625 = fieldNorm(doc=7223)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Explains how a computer indexing system works. Reviews fundamentals of how data are stored and retrieved by computers. Describes B-Tree and B+-Tree indexing structures. Gives basic keyword searching techniques that the user must apply to make use of the indexing programs. The demand for keyword retrieval is increasing and librarians should expect to see the keyword-indexing feature become commonly available
  10. Chiba, K.; Kyojima, M.: Document transformation based on syntax-directed free translation (1995) 0.07 
    0.0670797 = product of:
  0.1341594 = sum of:
    0.1341594 = product of:
      0.2683188 = sum of:
        0.2683188 = weight(_text_:tree in 4069) [ClassicSimilarity], result of:
          0.2683188 = score(doc=4069,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.81940293 = fieldWeight in 4069, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0625 = fieldNorm(doc=4069)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Presents a description system for the transformation of structured documents based on Context Free Grammars (CFGs). The system caters to transformations between different document class descriptions, and is presented mainly in Terms of logical structure transformation. Proposes 2 requirements for transformation; the output document class must be explicitly represented; and inconsistency must be avoided. Introducs a grammar for document class descriptions; tree-preserving Context Free Grammar, and gives Syntax-Directed Tree Translation (SDTT) for transformations of a document. The SDTT transformation is formal, concise and consistent with the above 2 requirements
  11. Sieverts, E.: Liever browsen dan zoeken (1998) 0.07 
    0.0670797 = product of:
  0.1341594 = sum of:
    0.1341594 = product of:
      0.2683188 = sum of:
        0.2683188 = weight(_text_:tree in 4722) [ClassicSimilarity], result of:
          0.2683188 = score(doc=4722,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.81940293 = fieldWeight in 4722, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0625 = fieldNorm(doc=4722)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Despite development of the WWW searchers still experience difficulties following links between sites and cannot be sure that a site contains the required information. 3 software programs developed to guide users through the maze of hyperlinks are: Dynamic diagrams, the Hyperbolic tree, and the Brain. in contrast to the other programs which operate on webservers and display hyperlinks in diagrammatic form the Brain is installed on individual PCs and can be customised to meet users' requirements
    Object
    Hyperbolic tree
  12. Weinberg, B.H.: ¬The hidden classification in Library of Congress Subject Headings for Judaica (1993) 0.06 
    0.06161664 = product of:
  0.12323328 = sum of:
    0.12323328 = product of:
      0.24646656 = sum of:
        0.24646656 = weight(_text_:tree in 6162) [ClassicSimilarity], result of:
          0.24646656 = score(doc=6162,freq=6.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.7526697 = fieldWeight in 6162, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=6162)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The syndetic structure of subject headings lists, in particular the broader/narrower term references, constitutes a hidden classification that may be converted to an explicit tree structure. Such a structure may be used to examine the hierarchy of LC subject headings (LCSH) and to compare them with that of Library of Congress Classification (LCC). Joseph Galron's compilation, 'Library of Congress Subject Headings in Jewish Studies (1991)', was analyzed for several features relating to the hierarchy of terms, and trees tructures were built for the deepest hierarchies: Jews, Judaism, Hebrew language, and Israel. These were compared with the corresponding LC classes. A hierarchy in LCSH may have more levels than the corresponding schedule in LCC. It is concluded that the conversion of the BT / NT references of subject headings lists into tree structures is a useful tool for examining the correctness of a hierarchy. Display of subject headings in tree-structure format can assist users in grasping the hierarchy of subject headings and in navigating online catalogs
  13. Kumar, H.P.; Plaisant, C.; Shneiderman, B.: Browsing hierarchical data with multi-level dynamic queries and pruning (1997) 0.06 
    0.06161664 = product of:
  0.12323328 = sum of:
    0.12323328 = product of:
      0.24646656 = sum of:
        0.24646656 = weight(_text_:tree in 750) [ClassicSimilarity], result of:
          0.24646656 = score(doc=750,freq=6.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.7526697 = fieldWeight in 750, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=750)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The PDQ Tree-browser (Pruning with Dynamic Queries) visualization tool was specified, designed and developed for browsing hierarchies with a large number of nodes. It presents trees in 2 tightly coupled views, one a detailed view and the other an overview. Users can use dynamic queries, a method for rapidly filtering data, to filter nodes at each level of the tree. The dynamic query panels are user-customisable. Sub-trees of unselected nodes are pruned out, leading to compact views of the relevant nodes. Usability testing of the PDQ Tree-browser, done with 8 subjects, helped assess strengths and identify possible improvements. It was used in Network Management (600 nodes) and UniversityFinder (1100 nodes) applications. A controlled experiment, with 24 subjects, showed that pruning significantly improved performance speed and subject user satisfaction
  14. Medical Subject Headings : tree structures (1993) 0.06 
    0.059290636 = product of:
  0.11858127 = sum of:
    0.11858127 = product of:
      0.23716255 = sum of:
        0.23716255 = weight(_text_:tree in 8876) [ClassicSimilarity], result of:
          0.23716255 = score(doc=8876,freq=2.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.7242567 = fieldWeight in 8876, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.078125 = fieldNorm(doc=8876)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  15. Narasimhamurthi, N.: Intelligent information retrieval : an introduction (1996) 0.06 
    0.059290636 = product of:
  0.11858127 = sum of:
    0.11858127 = product of:
      0.23716255 = sum of:
        0.23716255 = weight(_text_:tree in 6979) [ClassicSimilarity], result of:
          0.23716255 = score(doc=6979,freq=2.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.7242567 = fieldWeight in 6979, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.078125 = fieldNorm(doc=6979)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Overviews the field of artificial intelligence and its applicability to online information retrieval. Explains the proven technologies of rule-based expert systems and artificial neural networks. Discusses the speculative technology of the natural language encoding of information and identifies problems to be solved in the areas of concept description, sub-tree isomorphism, and semantics
  16. Cooper, L.K.D.; Tharp, A.L.: Multi-characters tries for text searching (1993) 0.06 
    0.05869474 = product of:
  0.11738948 = sum of:
    0.11738948 = product of:
      0.23477896 = sum of:
        0.23477896 = weight(_text_:tree in 4591) [ClassicSimilarity], result of:
          0.23477896 = score(doc=4591,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.7169776 = fieldWeight in 4591, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4591)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Full-text searching is likely to become an even more important activity in the future as the amount of information in computer-readable form increases and our demand for information grows. The CD-ROM provides a cost-effective medium for storing large quantities of information. Unfortunately, its physical characteristics limit its retrieval effectiveness. New storage structures, especially those uniquely suited to the CD-ROM need to be considered for improving retrieval times. Introduces the multi-character tree as an index structure for full-text retrieval on CD-ROMs. The structure offers several advantages when compared to other structures currently in use. Experimental results provide several comparison with the widely used B+ tree. Comparisons are also made with other structures used for full-text retrieval
  17. Ford, D.A.; Christodoukalis, S.: File organizations for optical disks (1992) 0.06 
    0.05869474 = product of:
  0.11738948 = sum of:
    0.11738948 = product of:
      0.23477896 = sum of:
        0.23477896 = weight(_text_:tree in 3501) [ClassicSimilarity], result of:
          0.23477896 = score(doc=3501,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.7169776 = fieldWeight in 3501, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3501)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Optical disk technology (CD-ROM etc.) is a new and secondary storage technology. Optical disks have immense capacities and very fast retrieval performance; they are also rugged and have very long storage lifetimes. These characteristics are making them a serious threat to the traditional dominance of magnetic disks. It is important to understand and study this young and significant technology and to design retrieval structures that best utilize characteristics. Presents 6 file systems (Write-Once B-Tree; Time Split B-Tree; Compact Disk File System; Optical File Cabinet; Buffered Hashing; BIM Trees
  18. Colby, L.S.; Saxton, L.V.; Gucht, D.V.: Concepts for modelling and querying list-structured data (1994) 0.05 
    0.050309774 = product of:
  0.10061955 = sum of:
    0.10061955 = product of:
      0.2012391 = sum of:
        0.2012391 = weight(_text_:tree in 8564) [ClassicSimilarity], result of:
          0.2012391 = score(doc=8564,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.6145522 = fieldWeight in 8564, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=8564)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Traditionally, data models and query languages have provided mechanisms for dealing with sets of objects. Many database applications, however, are list oriented (i.e. deal with collections or aggregates of objects in which ordering is important). Presents the list structured data model which has ordering as a fundamental feature. The model is based on atomic, aggregate, and list constructors and thus provides support for tree-structured and sequential representations of data. These constructors can be intermixed and allow the modelling of variable and recursive schemes. Such schemes occur naturally in list oriented data like tagged text and list processing applications is generalized to deal with the tree-structured representation and then incorporated in operations for searching, marking, updating, and restructuring list-structure instances. The operations form the core of a query language wherein users can succintly and naturally formulate complex problems typically encountered in list-oriented database applications
  19. Wheatley, A.; Armstrong, C.J.: Metadata, recall, and abstracts : can abstracts ever be reliable indicators of document value? (1997) 0.05 
    0.050309774 = product of:
  0.10061955 = sum of:
    0.10061955 = product of:
      0.2012391 = sum of:
        0.2012391 = weight(_text_:tree in 824) [ClassicSimilarity], result of:
          0.2012391 = score(doc=824,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.6145522 = fieldWeight in 824, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=824)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Abstracts from 7 Internet subject trees (Euroferret, Excite, Infoseek, Lycos Top 5%, Magellan, WebCrawler, Yahoo!), 5 Internet subject gateways (ADAM, EEVL, NetFirst, OMNI, SOSIG), and 3 online databases (ERIC, ISI, LISA) were examined for their subject content, treatment of various enriching features, physical properties such as overall length, anf their readability. Considerable differences were measured, and consistent similarities among abstracts from each type of source were demonstrated. Internet subject tree abstracts were generally the shortest, and online database abstracts the longest. Subject tree and online database abstracts were the most informative, but the level of coverage of document features such as tables, bibliographies, and geographical constraints were disappointingly poor. On balance, the Internet gateways appeared to be providing the most satisfactory abstracts. The authors discuss the continuing role in networked information retrieval of abstracts and their functional analoques such as metadata
  20. Advances in classification research. Vol.4 : proceedings of the 4th ASIS SIG/CR Classification Research Workshop (1995) 0.05 
    0.050309774 = product of:
  0.10061955 = sum of:
    0.10061955 = product of:
      0.2012391 = sum of:
        0.2012391 = weight(_text_:tree in 169) [ClassicSimilarity], result of:
          0.2012391 = score(doc=169,freq=4.0), product of:
            0.32745647 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.049953517 = queryNorm
            0.6145522 = fieldWeight in 169, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=169)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Content
    Enthält die Beiträge: ABAWAJY, J.H. u. M.A. SHEPHERD: Supporting a multi-hierarchical classification in the object-oriented paradigm; BOWKER; L.: Multidimensional classification of concepts for terminological purposes; COCHRANE, P.: Warrant for concepts in classification schemes; EUZENAT, J.: Brief overview of T-TREE: The TROPES Taxonomy Building Tool; HEMMASI, H. F. ROWLEY u. J.D. ANDERSON: Isolating and reorganizing core vocabulary from Library of Congress He... Music Thesaurus; JACOB, E.K.: Communication and category structure: the communicative process as a constant semantic representation of information; KIM, N-H., J.C. FRENCH u. D.E. BROWN: Boolean query reformulation with the Query Tree Classifier; KLEINBERG, I.: Programming knowledge: on indexing software for reuse and not indexing do...; LIN; X., MARCHIONINI, G. u. D. SOERGEL: Category-based and association-based map displays by human subjects; MINEAU, G.W.: The classification of structured knowledge objects; ZENG, L., D.K. GAPEN u. S. SCHMITT: Developing intellectual access and control mechanisms for discipline-based vi... future media integration

Authors

Languages

Types

  • a 1192
  • m 130
  • s 74
  • el 20
  • i 13
  • b 7
  • r 7
  • x 6
  • ? 5
  • d 3
  • p 2
  • au 1
  • h 1
  • n 1
  • More… Less…

Themes

Subjects

Classifications