login

Lattice model of browsable data spaces

Information SciencesPublished 1 December 1986
Robert Godin, Eugene Saunders, J. Gecsei
Citations72
SJR quartileQ1
SJR score1.80
SNIP1.98

TL;DR

A new approach to database access suitable for browsing is described, which consists of certain subsets of keywords and objects shown to form a lattice that grows linearly with the number of objects.

Abstract

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.

Keywords

Computer Science