| Summary: | 碩士 === 大葉大學 === 資訊工程學系碩士班 === 100 === The application of digital-content files offers different function of key-word searching. But as the quantity and types of file increase, the application needs to be restarted several times when doing searching job. The most applications only offer simple key-word searching, and users can’t add logic operators in searching strings. In our study, we implement a searching platform which combines with multiple modules of digital-content searching. Users can enter logic operators and searching strings by a universal interface to achieve multiple files and types of searching. To support the function of changing the weight of logic operators by adding parentheses in searching string, there will be a problem of dealing with key word sequence. Our approach is to transfer searching string to binary logical tree, then go through it by inorder traversal and postorder traversal to process logic operator and parentheses. At last, if the quantity and types of file are different, there will be several different format output results. Solving this problem, we design a wrapper which transfers all the results to XML format by standard Schema, and the application will read XML format and output it to user interface.
|
|---|
