140 likes | 149 Views
This project outlines the implementation of a front-end for IBM's RETAIN database, allowing customer service representatives to enter and manage call information efficiently. The focus is on creating an intuitive GUI with spell-checking capabilities.
E N D
Front-end for a RETAIN Function Melissa Chávez Client: IBM February 28th, 2004
Outline • RETAIN • Customer Call • Problem Specification • Existing Solutions • Requirements • Implementation • Future Work
RETAIN (1) • RETAIN Database • Record of IBM’s Operating Systems Problems • Corporate Customers • Customer Service Representative • Receive Calls • Enter information • Fixed according to severity
RETAIN (2) • Huge database • About 30 years old • Very reliable • Command line interface • Hard for new hires • Examples: • t • cs train • cr noch
Customer Call • Technical support representative • Operating system’s problems • PMR’s (Problem Management Record) • Creating APAR’s (Authorized Program Analysis Report) • IBM Fix • 8 windows
Problem Specification • Tasks for project • Front-end • Spell checker
Existing Solution • C tool written around 20 years ago • Operating system no longer exists • CC Win • MS Windows program that serves as a front-end for RETAIN, but it does not include the function of Creating an APAR.
Requirements • GUI Requirements • Creates APAR • Limits user not to enter unwanted information • Obliges user to enter required information • Spell checker requirements • Used when creating APAR • English only • Regular and custom dictionaries • Suggests words
Example • Example of problem description where the spell checker will be used: “Customer application abended with MESSAGE ABC123 due to no-rec-found code. VSAM error recovery module, IGDxxxx, entered a loop repeating the error message until the console buffers were depleted and the system went into a waitxxx requiring the system to be re-IPLed.”
Spell Checker Step # 1: Construct a list of all different words in the input field. Step # 2: Look up each word in the list in the dictionary. If word exists, delete from list. If word is not found, leave it in the list. Step # 3: Use approximate string matching algorithm to find suggestions for misspelled words.
Approximate String Matching Algorithm Ф H O U S E Ф H U S E Horizontal lines = insertion Vertical lines = deletion Diagonal lines = a substitution
Future Work • Synchronization • Allow users to switch back and forth between RETAIN and the front-end • English Dictionary • Merge both dictionaries into one