• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.183-186
• /
• 2012

To process continuous queries on a sensor network, it is required to transfer query predicates and build a query index on each sensor node. However, if we transfer query predicates to all sensor nodes, it makes the number of messages for query predicates increase. In this paper, we propose the scheme to construct the tree based relationship structure using data region of the sensor node and select the target nodes to transfer query predicates. we also implement the tree based relationship structure and measure the number of messages for sending predicates.

• 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.

• Asia pacific journal of information systems
• /
• v.11 no.2
• /
• pp.121-139
• /
• 2001

VOQL* query language, recently proposed, is a visual language for object-oriented databases. It is based on Ven Diagram and graph, so that the underlying schema structure can be naturally implied in query expressions. In VOQL*, structural relationship among the objects used in a query expression is represented graphically and thus it has formal semantics that can be inductively defined, as well as it can be used with ease. In this paper, we proposed revised VOQL* and introduced its query processor, InQs(Intelligent Querying System). While retaining the merit of VOQL* that it allows the structural relationship among the objects to be represented visually, the revised VOQL* has another merit that users can formulate a query interactively using various forms supplied by InQs. As a query processor that translates queries in revised VOQL into those in ODMG OQL, InQs provides an environment in which users express queries in revised VOQL* and then the system automatically translates them into those in ODMG OQL. Translation algorithm of InQs is much simpler and intuitive than other algorithms used in QUIVER and other systems, since it reflects the formal semantics of VOQL*, which is defined inductively.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.303-317
• /
• 2002

In this paper, we design and implement E-COIRS enabling users to query with concepts and image features used for further refining the concepts. For example, E-COIRS supports the query "retrieve images containing black home appliance to north of reception set. "The query includes two types of concepts: IS-A and composite. "home appliance"is an IS-A concept, and "reception set" is a composite concept. For evaluating such a query. E-COIRS includes three important components: a visual image indexer, thesauri and a query processor. Each pair of objects in an mage captured by the visual image indexer is converted into a triple. The triple consists of the two object identifiers (oids) and their spatial relationship. All the features of an object is referenced by its old. A composite concept is detected by the triple thesaurus and IS-A concept is recolonized by the fuzzy term thesaurus. The query processor obtains an image set by matching each triple in a user with an inverted file and CS-Tree. To support efficient storage use and fast retrieval on high-dimensional feature vectors, E-COIRS uses Cell-based Signature tree(CS-Tree). E-COIRS is a more advanced content-based image retrieval system than other systems which support only concepts or image features.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.11-20
• /
• 1993

In the new database applications such as office information systems, CAD/CAM, and AI, it is required to support not only fixed Is-A and Part-Of relationships but also various user-defined dynamic relationships including complicate constraints. However, existing object-oriented systems have many weaknesses in managing those complex relationships. This paper presents the Object-Oriented Relationship data Model (OORM) which is designed to provide facilities for modeling complex relationships into object oriented databases using abstraction concept. In the model, various integrity and consistency constraints related to the relationships can be also represented. And this paper presents a query language, ORSQL(Object Relationship SQL). ORSQL is a nonprocedural query language having similiar syntax to the standard SQL and supporting OORM's operations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2013

In this paper, we propose a keyword query processing technique based on semantic relationships for OWL data. The proposed keyword query processing technique can improve user's search satisfaction by performing two types of associative search. The first associative search uses information inferred by the relationships between classes or properties during keyword query processing. And it supports to search all information resources that are either directly or indirectly related with query keywords by semantic relationships between information resources. The second associative search returns not only information resources related with query keywords but also values of properties of them. We design a storage schema and index structures to support the proposed technique. And we propose evaluation functions to rank retrieved information resources according to three criteria. Finally, we evaluate the validity and accuracy of the proposed technique through experiments. The proposed technique can be utilized in a variety of fields, such as paper retrieval and multimedia retrieval.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1429-1432
• /
• 2003

This paper addresses the problem of finding a constrained nearest neighbor for moving query point(we call it CNNMP) The Nearest neighbor problem is classified by existence of a constrained region, the number of query result and movement of query point and target. The problem assumes that the query point is not static, as 1-nearest neighbor problem, but varies its position over time to the constrained region. The parameters as NC, NCMBR, CQR and QL for the algorithm are also presented. We suggest the query optimization algorithm in consideration of topological relationship among them

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.51-62
• /
• 2004

Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.35-40
• /
• 2005

Recently, the location based service for moving customers is becoming one of the most important service in mobile communication area and for moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries and to improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structure, which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.