• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.52-63
• /
• 2003

Spatiotemporal moving objects are changing their Positions and/or shape over time in real world. As most of the indices of moving object are based on the R-tree. they have defects of the R-tree which are dead space and overlap. Some of the indices amplify the defects of the R-tree. In the paper, to solve the problems, we propose the MPR-tree(Moving Point R-tree) using Projection operation which has more effective search than existing moving point indices on time slice query and spatiotemporal range query. The MPR-tree connects positions of the same moving objects over time by using linked list, so it processes the combined query about trajectory effectively. The usefulness of the Projection operation is confirmed during processing moving object queries and in practical use of space from experimentation to compare MPR-tree with existing indices of moving objects. The proposed MPR-tree would be useful in the LBS, the car management using GPS, and the navigation system.

• Journal of Intelligence and Information Systems
• /
• v.9 no.2
• /
• pp.101-119
• /
• 2003

Achieving the beneficiary goal of recent discovery in human genome project still needs a way to retrieve and analyze the exponentially expanding bio-related information. Research on bio-related fields naturally applies knowledge discovered to the current problem and make inferences to extract new information where shared concepts and data containing information need to be defined and used in a coherent way. In such a professional domain, while the need to help users reduce their work and to improve search results has been emerged, methods for systematic retrieval and adequate exchange of relevant information are still in their infancy. The design of our system aims at improving the quality of information retrieval in a professional domain by utilizing both corpus-based and concept-based ontology. Meta-rules of helping users to make an adequate query are formed into an ontology in the domain. The integration of those knowledge permits the system to retrieve relevant information in a more semantic and systematic fashion. This work mainly describes the query models with details of GUI and a secondary query generation of the system.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.605-614
• /
• 2007

As a standard query language to search XML data, XQuery and XPath were proposed by W3C. By widely using XQuery and XPath languages, recent researches focus on the development of query processing algorithm and data structure for efficiently processing XML query with the enormous XML database system. Recently, when processing XML path expressions, the concept of the structural join which may determine the structural relationship between XML elements, e.g., ancestor-descendant or parent-child, has been one of the dominant XPath processing mechanisms. However, structural joins which frequently occur in XPath query processing require high cost. In this paper, we propose a new structural join algorithm, called SISJ, based on our structured index, called SI, in order to process XPath queries efficiently. Experimental results show that our algorithm performs marginally better than previous ones. However, in the case of high recursive documents, it performed more than 30% by the pruning feature of the proposed method.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.9
• /
• pp.3759-3765
• /
• 2015

Background: Approaches in disruption of MDM2-p53 interactions have now emerged as an important therapeutic strategy in resurrecting wild type p53 functional status. The present study highlights virtual screening strategies in identification of high affinity small molecule non-peptidic inhibitors. Nutlin3A and RG7112 belonging to compound class of Cis-imidazoline, MI219 of Spiro-oxindole class and Benzodiazepine derived TDP 665759 served as query small molecules for similarity search with a threshold of 95%. The query molecules and the similar molecules corresponding to each query were docked at the transactivation binding cleft of MDM2 protein. Aided by MolDock algorithm, high affinity compound against MDM2 was retrieved. Patch Dock supervised Protein-Protein interactions were established between MDM2 and ligand (query and similar) bound and free states of p53. Compounds with PubCid 68870345, 77819398, 71132874, and 11952782 respectively structurally similar to Nutlin3A, RG7112, Mi219 and TDP 665759 demonstrated higher affinity to MDM2 in comparison to their parent compounds. Evident from the protein-protein interaction studies, all the similar compounds except for 77819398 (similar to RG 7112) showed appreciable inhibitory potential. Of particular relevance, compound 68870345 akin to Nutlin 3A had highest inhibitory potential that respectively showed 1.3, 1.2, 1.16 and 1.26 folds higher inhibitory potential than Nutilin 3A, MI 219, RG 7112 and TDP 1665759. Compound 68870345 was further mapped for structure based pharamacophoric features. In the study, we report Cis-imidazoline derivative compound; Pubcid: 68870345 to have highest inhibitory potential in blocking MDM2-p53 interactions hitherto discovered.

• Journal of Digital Contents Society
• /
• v.17 no.1
• /
• pp.11-21
• /
• 2016

To provide more efficient and exact search result, internet systems will rely more and more on semantic web. Ontology is one of the important methods for implementation of semantic web. Ontology is used to implement an explicit formal vocabularies to share. However, important problems rise when dealing with ontology. Ontologies are typically subject to change because they are living. In order to handle ontology data change situation, a version handling system is needed to keep track of changes. For example, the queries subject to the previous ontology may become inconsistent and must be updated according to the newest version of ontology. Although many research was done in this area, there are still many problems to overcome. In this paper, we propose class and property transition graph for query transformation. The graph is created when ontology data is changed and applied to query transformation.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.585-595
• /
• 2004

A query processing is a critical issue in data warehouse environment since queries on data warehouses often involve hundreds of complex operations over large volumes of data. Data warehouses therefore build a large number of materialized views to increase the system performance. Which views to materialized is an important factor on the view maintenance cost as well as the query performance. The goal of materialized view selection problem is to select an optimal set of views that minimizes total query response time in addition to the view maintenance cost. In this paper, we present an efficient solution for the materialized view selection problem. Although the optimal selection of materialized views is NP-hard problem, we developed a feasible solution by utilizing the characteristics of relational operators such as join, selection, and grouping.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1771-1780
• /
• 2007

The necessity of Information integration has emphasized by advancement of internet and change of enterprise environment. In enterprises, it usually integrates the multi-database constructing by M&A. For this integration of information it must guarantee interpretation and integration which is stabilized with solving heterogeneous characteristic problem. In this paper, we propose the method that change the global XML query to local XML query for interpretation. It is based on XMDR(eXtended Meta-Data Registry) which expresses the connection between the standard and the local for solve the interoperability problem in heterogeneous environment. Thus, we propose the legacy model that can search and modify by one Query with creating global XML Query by XMDR. and for his, we use the 2PC technique which is the distributed transaction control technique of existing.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.756-771
• /
• 2003

Digital Video Library System which manages a large amount of multimedia information requires efficient and effective retrieval methods. In this paper, we propose and implement a new video search and retrieval algorithm that compares the query video shot with the video shots in the archives in terms of foreground object, background image, audio, and its context. The foreground object is the region of the video image that has been changed in the successive frames of the shot, the background image is the remaining region of the video image, and the context is the relationship between the low-level features of the adjacent shots. Comparing these features is a result of reflecting the process of filming a moving picture, and it helps the user to submit a query focused on the desired features of the target video clips easily by adjusting their weights in the comparing process. Although the proposed search and retrieval algorithm could not totally reflect the high level semantics of the submitted query video, it tries to reflect the users' requirements as much as possible by considering the context of video clips and by adjusting its weight in the comparing process.

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.135-145
• /
• 2019

Prolonged recession has caused the youth unemployment rate in Korea to remain at a high level of approximately 10% for years. Recently, the number of unemployed Koreans in their 30s and 40s has shown an upward trend. To expand the government's employment promotion and unemployment benefits from youth-centered policies to diverse age groups, including people in their 30s and 40s, prediction models for different age groups are required. Thus, we aimed to develop unemployment prediction models for specific age groups (30s and 40s) using available unemployment rates provided by Statistics Korea and Google search queries related to them. We first estimated multiple linear regressions (Model 1) using seasonal autoregressive integrated moving average approach with relevant unemployment rates. Then, we introduced Google search queries to obtain improved models (Model 2). For both groups, consequently, Model 2 additionally using web queries outperformed Model 1 during training and predictive periods. This result indicates that a web search query is still significant to improve the unemployment predictive models for Koreans. For practical application, this study needs to be furthered but will contribute to obtaining age-wise unemployment predictions.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2003.08a
• /
• pp.185-192
• /
• 2003

국내 인터넷 검색엔진의 성능을 질문의 유형별로 비교해보았다. 실험에는 30명의 대학생이 참여하여 탐색질문을 작성하고 직접 탐색하여 검색결과의 적합성을 판정하였다. 실험참가자마다 탐색어 1개, 2개, 3개짜리 질문을 하나씩 작성하도록 한 결과 총 90개의 질문이 실험에 사용되었다. 질문의 유형은 질문의 길이 이외에 주제의 최신성 여부와 고유명사의 포함 여부를 기준으로 나누었다. 실험 결과 전체적인 성능은 구글이 가장 뛰어났으나, 고유명사를 포함한 최신주제 질문에 대해서는 네이트와 엠파스가 구글보다 좋은 성능을 보였다.