• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.337-340
• /
• 2000

Using the Information Retrieval systems on the Internet, the demand of exact and specific information has also been popularized. To offer exact information, there k3 been generalized demand of searching from the keyword of the shortened text and also of the full-text. This study is to suggest a scheme for full-text searches. It is to compare the existing scheme of information search and full-text information search with interMedia text. We suggest search methods for the full-text.

• Journal of information and communication convergence engineering
• /
• v.18 no.1
• /
• pp.33-38
• /
• 2020

Elasticsearch is an open source search and analytics engine that can search petabytes of data in near real time. It is designed as a distributed system horizontally scalable and highly available. It provides RESTful APIs, thereby making it programming-language agnostic. Full text search of multilingual text requires language-specific analyzers and field mappings appropriate for indexing and searching multilingual text. Additionally, a language detector can be used in conjunction with the analyzers to improve the multilingual text search. Elasticsearch provides more than 40 language analysis plugins that can process text and extract language-specific tokens and language detector plugins that can determine the language of the given text. This study investigates three different approaches to index and search Chinese, Japanese, and Korean (CJK) text (single analyzer, multi-fields, and language detector-based), and identifies the advantages of the language detector-based approach compared to the other two.

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.87-101
• /
• 1991

The primary purpose of this study was to investigate a robust search methodology that could be used in full-text information retrieval systems. A robust search methodology is one that can be easily used by a variety of users (particularly naive users) and it will give them comparable search performance regardless of their different expertise or interests In order to develop a possibly robust search methodology, a fully functional prototype of a fuzzy knowledge based information retrieval system was developed. Also, an experiment that used this prototype information retreival system was designed to investigate the performance of that search methodology over a small exploratory sample of user queries To probe the relatonships between the possibly robust search performance and the query organization using fuzzy inference logic, the search performance of a shallow query structure was analyzes. Consequently the following several noteworthy findings were obtained: 1) the hierachical(tree type) query structure might be a better query organization than the linear type query structure 2) comparing with the complex tree query structure, the simple tree query structure that has at most three levels of query might provide better search performance 3) the fuzzy search methodology that employs a proper levels of cut-off value might provide more efficient search performance than the boolean search methodology. Even though findings could not be statistically verified because the experiments were done using a single replication, it is worth noting however, that the research findings provided valuable information for developing a possibly robust search methodology in full-text information retrieval.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.405-415
• /
• 2020

With the increase in smartphone user, mobile forensics has become an essential element in modern digital forensic investigation. Mobile messenger data is very important data in mobile forensics because it can acquire information such as user's life pattern and mental state. In order to analyze messenger data, a decryption technique of an encrypted messenger data is required. Since most messengers provide a message deleting function, a technique for recovering deleted messages is required. WeChat Messenger, a messenger used by about 1 billion people around the world, uses IMEI (International Mobile Equipment Identity) information to encrypt data and provides message deletion function. In this paper, we propose a data decryption method in the absence of IMEI information and propose a method for recovering deleted messages using FTS (Full Text Search) database created for full-text search function of SQLite database.

• Journal of the Korean Society for Library and Information Science
• /
• v.30 no.2
• /
• pp.51-86
• /
• 1996

The primary purpose of this study is to verify the difference of behavioural characteristics between the subject specialists and professional searchers in searching full-text databases. The major findings and conclusions from this study are summarized as follows. Analyses of Search questions(the degree of understanding with search questions, the degree of difficulty in selecting terms, and the degree of expectation of search results), search processes(the number of search terms used, the number of Boolean operators and qualifiers used, the number of documents browsed and the search time(the connecting time, time to spend per one output document, time to spend per one relevant output document) and search results(the searching efficiency(the number of relevant documents, the ,recall ratio and the precision ratio), the search cost(the total search cost. the search cost per one output document and the search cost per one relevant output document) and the degree of satisfaction with search results) are significantly different between the subject specialists and professional searchers in searching full-text databases.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.521-523
• /
• 2006

This paper proposes an algorithm and its data structure to support real-time full-text search for the streamed or broadcasted multimedia data containing real-time stenograph text. Since the traditional indexing method used at information retrieval area uses the linguistic information, there is a heavy cost. Therefore, we propose the algorithm and its data structure based on suffix array, which is a simple data structure and has low space complexity. Suffix array is useful frequently to search for huge text. However, subtitle text of multimedia data is to get longer by time. Therefore, suffix array must be reconstructed because subtitle text is continually changed. We propose the data structure called prefix array and search algorithm using it.

• Journal of Information Management
• /
• v.32 no.1
• /
• pp.1-22
• /
• 2001

In traditional environment, user must search each journal OPAC, bibliographic DB, and full-text DB and E-Journal separately until user finds scientific and technology informations that he needs. The purpose of this study is to build one-click service system of Journals that supports integrating search. This system provides various functions, such as, journal browsing, journal search, article search, alert function, my library, document delivery service by integrating databases and electronic journals. Users search all information sources through journal OPAC and acquire journal full-text by single interface.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.41-49
• /
• 2000

Form the middle of 199os, most universities in Korea have requested their students to submit not only the original text books but also their Electronic Theses and Dissertations(ETD) for masters degree and doctorates degree. The ETD submitted by the students are usually developed by various kinds of word processors such as MS-Word, LaTex, and HWP. Since there is no standard format for ETD to merge various different formats yet, it is difficult to construct the integrated database that provides full-tex service. In this paper, we transform three different ETD formats into a unified one, construct a full-text database, and implement the full-text retrieval system for effective search in the Internet environment.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.9 no.1
• /
• pp.39-52
• /
• 1998

The purpose of this study is to design the solution for creating full-text database of Korean dissertaion, After considering file formats for text based and image based database, Viewer, Search, Copy Right, Abstracts and Indexes, situation of Korea University Library, decided the principles of creating database. And suggested the design to produce the database for Korea University Library, that is easy to get file format conversion in case of the introducing new technology for the future.

• Journal of the Korea Convergence Society
• /
• v.10 no.8
• /
• pp.245-253
• /
• 2019

Beach lifeguards in Korea are unprepared to perform the rescue and safety management for individuals with disabilities. There is no lifeguard training that offers information regarding the rescue of individuals with disabilities. The purpose of the study was to conduct literature review and determine significant issues related to beach lifeguard and provide suggestions for lifeguard training programs and water safety for individuals with disabilities. Databases (i.e., CINAHL Plus with Full Text, ERIC, MEDLINE, SPORTDiscus with Full Text) were used to search research articles and organizational documents. To find relevant documents, search terms such as water safety, lifeguard, drown prevention were used. Data were content analyzed to identify key issues. Based on the literature review, five critical issues regarding rescue of individuals with disabilities, drown prevention, and water safety were drawn and discussed in the article.