LE 1182 TREE

TREE PMC3/97TREE PMC3/97

UI DevelopmentUI Development

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

P02 User InterfaceP02 User Interface

Design Approach Rapid prototyping Rapid User evaluation

Requirements Provide search interface to TREE dB Multilingual support Client side validation of search terms ?

User Profile WWW community

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

Simple Search InterfaceSimple Search Interface Advantages

Suggested by P01 User Trials Common WWW search interface (e.g. Alta Vista) Simple and obvious to use

Disadvantages Search process is opaque to users No client side validation of search terms

Possible Additions Support Boolean expressions in search string Provide additional refined or advanced

interface

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

Advanced/Refined Search Advanced/Refined Search Interface 1Interface 1

Advantages All schema slots and values presented Client side search term validation Familiar Windows style interface

User Evaluation Results Too complex Users disliked mixed ‘tab’ and ‘wizard’

dialogue box Users not expecting Windows style interface

on WWW Lengthy download time

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

Advanced Interface 2Advanced Interface 2

Advantages Users prompted for valid additional

search terms Easy and obvious to use

User Evaluation Results Generally positive Require realistic test data for full

evaluation Search process still opaque P02 User trials on multiple interfaces

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

Search EngineSearch Engine Basic Strategy

Identify vacancies in Schema dB which have one or more slot values which are siblings, cousins or children of a code associated with a search term.

Parsing Search String for simple search Individual Search Terms Extracted

Obtaining Terminology Codes Look up for every individual search term … and every possible sequential conjunction

of search terms.

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

Executing SearchExecuting Search Template SQL statement:

SELECT * FROM <table1>, [table2,] ..., [<tablen>]WHERE [<table1>.<slotName1> IN(SELECT child FROM term_hierarchy WHERE slot=<slotName1> AND child IN(SELECT child FROM term_hierarchySTART WITH parent=(SELECT parent FROM term_hierarchy WHERE child=<code1>)CONNECT BY PRIOR child=parent))] OR [<table2>.<slotName2> . . .]

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

Results RankingResults Ranking Case Based Reasoning Weighting

Exact match and children score highest Siblings and Parent Cousins

Conflict Resolution Search terms may identify non-related branches

in hierarchy Preference to codes associated with multiple

terms I.e. ‘chemical engineer’

Prompt user with options to specify single branch

LE 1182 TREE

TREE PMC3/97TREE PMC3/97

ImplementationImplementation

UI HTML 3.2 compliant Java (JDK 1.0.2)/ Java Script

Search Engine Oracle Web Server 2.1 Search engine written as WRB cartridge Search engine and CBR ranking - C/C++