Search (2 results, page 1 of 1)

  • × author_ss:"Scholl, M."
  1. Amann, B.; Scholl, M.: Schema-based authoring and querying of large hypertexts (1995) 0.00 
    0.001757696 = product of:
  0.003515392 = sum of:
    0.003515392 = product of:
      0.007030784 = sum of:
        0.007030784 = weight(_text_:a in 4502) [ClassicSimilarity], result of:
          0.007030784 = score(doc=4502,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.13239266 = fieldWeight in 4502, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=4502)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Modern hypertext applications require new system support for hypertext authoring and user navigation through large sets of documents connected by links. This system support must be based on advanced, typed data models for describing the information structure in different application domains. Schema based structuring through strongly typed documents and links has already been proposed and put to practical use in a multitude of hypertext applications. Systems such as Multicard/O2 and MORE have moreover exploited conceptual schemas for querying the resulting hyperdocuments in a more structured way. Shows how hypertext schemas and query languages can be utilized for designing hypertext authoring and browsing environments for large hypertexts. Illustrates mechanisms using the Gram data model and describes their implementation on top of the Multicard hypermedia system connected to the O2 object oriented database management system
    Type
    a
  2. Christophides, V.; Plexousakis, D.; Scholl, M.; Tourtounis, S.: On labeling schemes for the Semantic Web (2003) 0.00 
    0.0010148063 = product of:
  0.0020296127 = sum of:
    0.0020296127 = product of:
      0.0040592253 = sum of:
        0.0040592253 = weight(_text_:a in 3393) [ClassicSimilarity], result of:
          0.0040592253 = score(doc=3393,freq=2.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.07643694 = fieldWeight in 3393, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3393)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We advocate for the use of labeling schemes for modeling these hierarchies in order to efficiently answer queries such as subsumption check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. We first give a qualitative comparison of three main families of schemes, namely bit vector, prefix and interval based schemes. We then show that two labeling schemes are good candidates for an efficient implementation of label querying using standard relational DBMS, namely, the Dewey Prefix scheme [6] and an Interval scheme by Agrawal, Borgida and Jagadish [1]. We compare their storage and query evaluation performance for the 16 ODP hierarchies using the PostgreSQL engine.

Authors

Years

Types

Themes