Relational Data Structures for Extensible Thesauri

8/21/98


Click here to start


Table of Contents

Relational Data Structures for Extensible Thesauri

Introduction

Problem Statement

Thesaurus is two structures

Tree of preferred terms

Tree as Nested Sets

Tree View -- Nested Set View

SQL and Tree Structures

SQL and Tree Structures

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

Visitation Model

VM Queries -- Find leaf

VM Queries -- Find leaf

VM Queries -- Find members of set defined by A2

VM Queries -- Find members of set defined by A2

VM Queries -- Fetch C1 in Context

VM Queries -- Fetch C1 in Context

Ancillary Relationship Network

Term_relation

Valid Term or Identity Row

Identity row

SQL Terminator

SQL Terminator

SQL Terminator

SQL Terminator

SQL Terminator

SQL Terminator

Conclusions

Conclusions

Conclusions

Java/CORBA applet using model

Questions?

Email: randy@socrates.berkeley.edu

Home Page: www.mip.berkeley.edu