• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.213-225
• /
• 2003

In multimedia database system, it is very important issue how to query multimedia data and present the result of query. Also, in order to reuse the query result in other applications, multimedia database system must be considered to provide the query result which is more generalized form. In this paper, I propose a presentation model for presenting query result in multimedia database system and MMSQL based on the developed model for processing multimedia database query. This paper includes the design and implementation of MMSQL query processor. MMSQL query processor provides the presentation of query result which is SMIL (Synchronized Multimedia Integration Language) document. Therefore, MMSQL query result in this paper can be use to variant multimedia applications.

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

Cooperative query answering provides neighborhood or associate information relevant to the initial query using the knowledge about the query and data. In this paper, we present an intelligent query answering system for suporting cooperative query answering system presented in this paper performs query relaxation process using hybrid knowledge base. The hybrid knowledge base which is used for relaxation of queries, composes of semantic list and rule based knowledge base for structural approach. Futhermore, this paper proposes the query relaxation algorithm for query reformulation using initial query on the basis of hybrid knowledge base.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.1-8
• /
• 2017

In this paper we present a spatial big data query processing system that can store spatial data in Hadoop and query the data with SQL-based query language. The system stores large-scale spatial data in HDFS-based storage system, and supports spatial queries expressed in SQL-based query language extended for spatial data processing. It supports standard spatial data types and functions defined in OGC simple feature model in the query language. This paper presents the development of core functions of the system including query language parsing, query validation, query planning, and connection with storage system. We compares the performance of the suggested system with an existing system, and our experiments show that the system shows about 58% performance improvement of query execution time over the existing system when executing region query for spatial data stored in Hadoop.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.715-718
• /
• 2009

Time series data is a sequence of data points, measured typically at successive, spaced at time intervals. Many devices for an efficient exploration is developed according as the items of time series data increase. Among these devices, there is a Timebox widget as a representative device of dynamic query for interactive data exploration. Timeboxes are rectangular query region of interest. The users can draw the region of interest using simple mouse manipulation and the query result sets is displayed. But there is a limitation to represent the concrete query region and Timeboxes visualize the query region inconsistent with the mental model of users. To resolve these problems, we propose a new device called DQB(Dynamic Query Band). DQB is a qeury region consisting of user defined polyline with a thickness on time series data. This device is possible to concretely specify the query region. Also, it provides a simple and convenient interface and a good conceptual model.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2007

When confronted with a query, question answering systems endeavor to extract the most exact answers possible by determining the answer type that fits with the key terms used in the query. However, the efficacy of such systems is limited by the fact that the terms used in a query may be in a syntactic form different to that of the same words in a document. In this paper, we present an efficient semantic query expansion methodology based on query patterns in a question category concept list comprised of terms that are semantically close to terms used in a query. The proposed system first constructs a concept list for each question type and then builds the concept list for each question category using a learning algorithm. The results of the present experiments suggest the promise of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.19-27
• /
• 2006

This paper presents a query processing model in a wrapper based on the XML view tree. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the XML views and the XML query is represented by the view tree. Since the view tree keeps the structure of a virtual XML document, it is easy to navigate the path expression. The view tree is also used as a template for schema generation and XML document generation as a query result. Moreover this conceptual uniform abstraction for the XML view and the user query makes it easy to support a multi-level XML view and to implement our composition mechanism.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.27-44
• /
• 1999

Case-Based Reasoning(CBR) offers a new approach for developing knowledge based systems. CBR has several research issues which can be divided into two categories : (1) static issues and (2) dynamic issues. The static issues are related to case representation scheme and case data model, that is, focus on casebase which is a repository of cases. The dynamic issues, on the other hand, are related to case retrieval procedure and problem solving process, i.e. case adaptation phase. This research is forcused on retrieval procedure Traditional query processing accepts precisely specified queries and only provides exact answers, thus requiring users to fully understand the problem domain and the casebase schema, but returning limited or even null information if the exact answer is not available. To remedy such a restriction, extending the classical notion of query answering to approximate query answering(AQA) has been explored. AQA can be achieved by neighborhood query answering or associative query answering. In this paper, neighborhood query answering technique is used for AQA. To reinforce the CBR process, a new retrieval procedure(cooperative CBR) using neighborhood query answering is proposed. An neighborhood query answering relaxes a query scope to enlarge the search range, or relaxes an answer scope to include additional information. Computer Aided Process Planning(CAPP) is selected as cooperative CBR application domain for test. CAPP is an essential key for achieving CIM. It is the bridge between CAD and CAM and translates the design information into manufacturing instructions. As a result of the test, it is approved that the problem solving ability of cooperative CBR is improved by relaxation technique.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.1-9
• /
• 1998

Temporal Databases store all of informations by time varying, so the temporal query processor has to process very large information. Therefore, we propose an efficient method of query processing by using the relevance checking algorithm of input query and view definition. The relevance checking algorithm of query investigates relevance between the input query of user about base relation and the execution tree of view definition stored in system catalog. And related input query with view definition have a process of the query translation to the execution tree of view. So temporal query processor is able to increase performance of query processor by reducing the number of tuple.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.805-817
• /
• 2017

Cross-lingual query expansion is usually based on the relationship among monolingual words. Bilingual comparable corpus contains relationships among bilingual words. Therefore, this paper proposes a method based on these relationships to conduct query expansion. First, the word vectors which characterize the bilingual words are trained using Chinese and Thai bilingual comparable corpus. Then, the correlation between Chinese query words and Thai words are computed based on these word vectors, followed with selecting the Thai candidate expansion terms via the correlative value. Then, multi-group Thai query expansion sentences are built by the Thai candidate expansion words based on Chinese query sentence. Finally, we can get the optimal sentence using the Chinese and Thai query expansion method, and perform the Thai query expansion. Experiment results show that the cross-lingual query expansion method we proposed can effectively improve the accuracy of Chinese and Thai cross-language information retrieval.

• Journal of Korea Multimedia Society
• /
• v.17 no.10
• /
• pp.1182-1188
• /
• 2014

Recently, the research on database outsourcing has been actively done with the popularity of cloud computing. However, because users' data may contain sensitive personal information, such as health, financial and location information, the data encryption methods have attracted much interest. Existing data encryption schemes process a query without decrypting the encrypted databases in order to support user privacy protection. On the other hand, to efficiently handle the large amount of data in cloud computing, it is necessary to study the distributed index structure. However, existing index structure and query processing algorithms have a limitation that they only consider single-column query processing. In this paper, we propose a grid-based multi column indexing scheme and an encrypted query processing algorithm. In order to support multi-column query processing, the multi-dimensional index keys are generated by using a space decomposition method, i.e. grid index. To support encrypted query processing over encrypted data, we adopt the Hilbert curve when generating a index key. Finally, we prove that the proposed scheme is more efficient than existing scheme for processing the exact and range query.