The formal model of a pattern browsing technique
Jan Hidders, Cpm Cora Hoskens, Jan Paredaens · TU/e Research Portal · 1995
In this report we introduce a general browsing model that describes intuitive ideas about browsing. In this model it is assumed that the database scheme, as well as the instance of the database are represented by graphs. The most important browsing step in this model is the pattern step. It is based upon finding subgraphs in the instance matching a pattern and supplied with a browsing condition that links it to previous steps. This allows the user to visually specify a browsing step based upon the results of previous steps. Other browsing steps and operators in the model allow the user to randomly select some subgraphs found by a step, replace an old browsing step with a new one or undo some of the last browsing steps. After presenting the model we compare its expressive power with that of the relational algebra.