Lattice model of browsable data spaces (Q1099974): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inclusiveness of systems for retrieval documents indexed by unweighted descriptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic Road Maps for Literature Searchers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926079 / rank
 
Normal rank

Latest revision as of 16:30, 18 June 2024

scientific article
Language Label Description Also known as
English
Lattice model of browsable data spaces
scientific article

    Statements

    Lattice model of browsable data spaces (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    This article describes a new approach to database access suitable for browsing. The underlying data model consists of a number of objects, easily described by a variable number of keywords (simple or qualified). Navigation is performed in terms of certain subsets of keywords and objects (called contexts), which are shown to form a lattice. The complexity of the lattice grows linearly with the number of objects (and not exponentially, as would be the case if all possible keyword subsets were used). The method is illustrated by several practical examples.
    0 references
    0 references
    database access
    0 references
    browsing
    0 references
    data model
    0 references
    keywords
    0 references
    0 references