• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.766-772
• /
• 2007

As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.252-257
• /
• 2001

In conventional boolean retrieval systems, document ranking is not supported and similarity coefficients cannot be computed between queries and documents. The MMM, Paice and P-norm models have been proposed in the past to support the ranking facility for boolean retrieval systems. They have common properties of interpreting boolean operators softly. In this paper we propose a new soft evaluation method for Information retrieval using query splitting relevance feedback model. We also show through performance comparison that query splitting relevance feedback(QSRF) is more efficient and effective than MMM, Paice and P-norm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.5
• /
• pp.451-457
• /
• 2005

In spite of the development of computers, the present state that a lot of electronic documents are overflowing makes it more difficult for us to get appropriate information. Therefore, it's more important to focus on getting meaningful information than processing the data quickly In this context, Semantic Web enables an intelligent processing by adding semantic metadata on yow web documents. Also, as the Semantic Web grows, the knowledge resources as well as web resources are getting more and more importance. In this paper, we propose an OWL storage system aiming at an intelligent Processing by adding semantic metadata on your web documents, plus a system aiming at an OWL-QL Query Processing.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.459-462
• /
• 2003

Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users with a preview of processing results. In this paper, we investigate the problem of selectivity estimation in the context of a spatial dataset. Although several techniques have been proposed in the literature to estimate spatial query result sizes, most of those techniques still have some drawback in the case that a large amount of memory is required to retain accurate selectivity. To eliminate the drawback of estimation techniques in previous works, we propose a new method called MW Histogram. Our method is based on two techniques: (a) MinSkew partitioning algorithm that processes skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. With the experimental result, we prove that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.98-104
• /
• 2012

In RFID Systems, collisions between multiple tags frequently arise due to simultaneous responses from multiple tags using the same communication channel. Most of anti-collision protocols such as QT regard these collisions as useless cycles, thereby wasting the channel bandwidth. In this paper, we propose a new anti-collision protocol, namely ASP (Adjustable splitting by patterns of collisions) protocol that utilizes the patterns collision for noticeable performance enhancements.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.121-125
• /
• 2008

It is essential to maintain hierarchical information properly for efficient XML query processing. Well known approach to represent hierarchical information of XML tree is assigning a specific node number to each node of XML tree. Insertion and deletion of XML node can occur at any position in a dynamic XML tree. A dynamic numbering scheme allows us to add nodes to or delete nodes from an XML tree without relabeling or with relabeling only a few existing nodes of XML tree while executing XML query efficiently. According to W3C XQuery update facility specifications a node can be added as first or last child of the existing node in XML tree. Generating new number for last child requires referencing the number of previous last child. Getting the number of last child is very costly with previous approaches. We have developed a new dynamic numbering scheme PSN which is very effective for insertion of a node as last child. Our approach reduces the time to find last child dramatically by removing sorting of children.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.244-246
• /
• 2002

The rapid increase of E-commerce market requires a solution to assist the buyer to find his or her interested items. The intelligent agent model is one of the approaches to help the buyers in purchasing items in outline market. In this paper, the user query processing model in the item recommendation agent is proposed. In the proposed model, the retrieval result is affected by the automatically generated queries from user preference information as well as the queries explicitly given by user. Therefore, the proposed model can provide the customized search results to each user.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.901-910
• /
• 2003

Generally, most commercial retrieval engines adopt boolean query as user's query type. Although boolean query is useful to retrieval engines that need fast retrieval, it is not easy for user to express his demands with boolean operators. So, many researches have been studied for decades about information retrieval systems using natural language query that is convenient for user. To retrieve documents that are suitable for user's demands, they have to express their demands correctly, So, this thesis proposes interactive query process agent using natural language. This agent expresses demands concrete through gradual interaction with user, When users input a natural language Query, this agent analyzes the query and generates boolean query by selecting proper keyword and feedbacks the state of the keyword selected. If the keyword is a synonymy or a polysemy, the agent expands or limits the keyword through interaction with user. It makes user express demands more concrete and improve system performance. So, this agent can improve the precision of Information Retrieval.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.285-291
• /
• 2001

This paper describes a natural language question answering system that can be used by students in getting as solution to their queries. Unlike AI question answering system that focus on the generation of new answers, the present system retrieves existing ones from question-answer files. Unlike information retrieval approaches that rely on a purely lexical metric of similarity between query and document, it uses a semantic knowledge base (WordNet) to improve its ability to match question. Paper describes the design and the current implementation of the system as an intelligent tutoring system. Main drawback of the existing tutoring systems is that the computer poses a question to the students and guides them in reaching the solution to the problem. In the present approach, a student asks any question related to the topic and gets a suitable reply. Based on his query, he can either get a direct answer to his question or a set of questions (to a maximum of 3 or 4) which bear the greatest resemblance to the user input. We further analyze-application fields for such kind of a system and discuss the scope for future research in this area.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.3
• /
• pp.218-227
• /
• 2000

In this paper, we present a new fuzzy information retrieval method based on thesaurus. In the proposed method th thesaurus is represented by a fuzzy linguistic matrix, where the elements in fuzzy linguistic matrix represent a qualitative linguistic values between terms. In the fuzzy linguistic matrix, there are three kinds of fuzzy relationships between terms, i.e., similar relation, hierarchical relation, and associative relation. The implicit fuzzy relationships between terms are inferred by the transitive closure of the fuzzy linguistic matrix based on fuzzy theory. And the proposed method has the capability to deal with a qualitative linguistic weights in a query and in indexing of information items to reflect qualitative measure of human based on vague and uncertain decisions rather than a quantitiative measure. Therefore the proposed method is more flexible than the ones presented in papers[1-3]. Moreover our method is more effectual of time than the ones presented in papers[1-3] because we use a fuzzy linguistic matrix and AON (Associate Ordinary Number) values in query evaluation process. As a result, the proposed method allows the users to perform fuzzy queries in a more flexible and more intelligent manner.