• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.46-50
• /
• 2006

According to the advancement of experimental techniques in molecular biology, genomic and protein sequence databases are increasing in size exponentially, and mean sequence lengths are also increasing. Because the sizes of these databases become larger, it is difficult to search similar sequences in biological databases with significant homologies to a query sequence. In this paper, we present the N-gram indexing method to retrieve similar sequences fast, precisely and comparably. This method regards a protein sequence as a text written in language of 20 amino acid codes, adapts N-gram tokens of fixed-length as its indexing scheme for sequence strings. After such tokens are indexed for all the sequences in the database, sequences can be searched with information retrieval algorithms. Using this new method, we have developed a protein sequence search system named as ProSeS (PROtein Sequence Search). ProSeS is a protein sequence analysis system which provides overall analysis results such as similar sequences with significant homologies, predicted subcellular locations of the query sequence, and major keywords extracted from annotations of similar sequences. We show experimentally that the N-gram indexing approach saves the retrieval time significantly, and that it is as accurate as current popular search tool BLAST.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.391-393
• /
• 2002

최근 가상교육에서 학습 기술의 상호 운용성을 기반으로 한 표준화의 필요성을 인식하고 여러 국제표준기관을 통해서 기반 환경과 컨텐트 명세 및 활용에 대한 표준화 작업이 이루어지고 있다. 이로 인해 e-learning 분야에서는 국제표준을 소개하고 체제적으로 AICC(Aviation Industry CBT Committee), IMS(Instructional Management Systems) Global Learning Consortium, ADL(Advanced Distributed Learning)을 중심으로 진행되어 오고 있다. 특히, 미래의 진보적인 e-learning 환경 개발로, 기능별 5계층으로 구성된 LTSA(Learning Technology Standard Architecture)를 제정하고 이를 통한 개발을 지원하고 있다. 하지만, 이는 시스템 구성요소를 정의한 계층 3의 경우 데이터 흐름 모델로 작성되어 현재 개발 수준과 일치하지 않는 문제점을 가지는 모델로 인정한다. 본 논문에서는 표준 모델링 언어인 UML(Unified Modeling Language)을 통해 모델을 재정의하고, 각 프로세스별 단계를 메타모델로 제시하여 개발과 아키텍처의 이해에 대한 문제점을 해결하고자 한다. 또한, 재정의된 모델을 기반으로 e-learning 지원을 위한 분석, 설계 프로세스를 정의하여 이에 대한 사례를 제시한다. 이는 아키텍처를 기반으로 한 메타모델과 프로세스를 통한 교육영역의 질의 응답 학습 도구인 QALT(Query-Answer Learning Tool)에 적용한다. 모델의 재정의로 아키텍처의 이해성 및 이를 기반으로 하는 교육용 애플리케이션 개발의 용이성의 증대를 기대할 수 있으며, 모델의 재사용성을 보장할 수 있다.

• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.513-523
• /
• 2015

A complex event processing system, becoming useful in real life domains, efficiently processes stream of continuous events like sensor data from IoT systems. However, those systems do not work well on some types of queries yet, so that programmers should be careful about that. For instance, they do not sufficiently provide detailed guide to choose efficient queries among the almost same meaning queries. In this paper, we propose an query preprocessing tool for event stream processing systems, which helps programmers by giving them the hints to improve performance whenever their queries fall in any possible bad formats in the performance sense. We expect that our proposed module would be a big help to increases productivity of writing programs where debugging, testing, and performance tuning are not straightforward.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.10
• /
• pp.217-224
• /
• 1999

Trouble shooting of modern machine tools equipped with sophisticated electronic as well as mechanical parts is so difficult that it is usually depends upon the experience and accumulated knowledge of the diagnosing persons. On the other hand, tool users are scattered in wide area, which makes it expensive for a machine tool maker to run a vast service network. An unmanned diagnosis system to which users can have access at all times could be an efficient alternative. For this purpose, a rule-based expert system for diagnosing machine tools is developed. This paper describes the structure of diagnostic knowledge, the rule firing mechanism, the diagnosis flow, and user query process. An example shows the feasibility of problem solving on site without help of a service expert from machine tool maker.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.185-198
• /
• 2000

Recently the technological advance in the hardware dealing with multimedia data as well as the explosive increase of the volume of multimedia data bring about new interest in the use of multimedia presentations in many application domains. To use multimedia presentations efficiently, the integration of multimedia presentations into DBMS is necessary. This paper presents a multimedia presentatation query language based on contents and query processing techniques. Presently, multimedia presentation authoring tools denote a multimedia presentation using a presentation graph which is a DAG. A Node in the graph is a same type of media stream and edges denote a play-out order and a synchronization way among nodes. The contents of presentations graphs are the information of each stream, the sequential order of the information inside each stream and the play-out order among the streams. GCalculus/S is a calculus-based query language and can deal with the contents of a presentation graph and physical characteristics of multimedia data. It expresses the sequential order of information inside each stream and the play-out order of streams of a presentation graph using temporal operators Next, Connected and Until. O-Algebra, which is object algebra, is extended to process GCalculus/S queries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1693-1713
• /
• 2018

An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

• Geomechanics and Engineering
• /
• v.7 no.1
• /
• pp.37-53
• /
• 2014

A Web-based pile load test (WBPLT) system was developed and implemented in this study. Object-oriented and concept-based software design techniques were adopted to integrate the pile load test database into the system. A total of 673 case histories of pile load test were included in the database. The data consisted of drilled shaft and driven precast concrete pile axial load tests in drained, undrained, and gravel loading conditions as well as pre-analyzed data and back-calculated design parameters. Unified modeling language, a standard software design tool, was utilized to design the WBPLT system architecture with five major concept-based components. These components provide the static structure and dynamic behavior of system message flows in a visualized manner. The open-source Apache Web server is the building block of the WBPLT system, and PHP Web programming language implements the operation of the WBPLT components, particularly the automatic translation of user query into structured query language. A simple search and inexpensive query can be implemented through the Internet browser. The pile load test database is helpful, and data can be easily retrieved and utilized worldwide for research and advanced applications.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.125-134
• /
• 2009

A biological data acquisition based on web has emerged as a powerful tool for allowing scientists to interactively view entries form different databases, and to navigate from one database to another molecular-biology database links. In this paper, the biological conceptual model is constructed hybrid biological data model to represent interesting entities in the data sources to applying navigation rule property for each biological data source based on four biological data integrating layers to control biological data. When some user's requests for application service are occurred, we can get the data from database and data source via web service. In this paper, we propose a query processing model and execution structure based on integrating data layers that can search information on biological data sources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2576-2590
• /
• 2020

The fundamental reason why most SQL injection detection methods are difficult to use in practice is the low reusability of the implementation code. This paper presents a reusable SQL injection detection method for Java Web applications based on AOP (Aspect-Oriented Programming) and dynamic taint analysis, which encapsulates the dynamic taint analysis processes into different aspects and establishes aspect library to realize the large-grained reuse of the code for detecting SQL injection attacks. A metamodel of aspect library is proposed, and a management tool for the aspect library is implemented. Experiments show that this method can effectively detect 7 known types of SQL injection attack such as tautologies, logically incorrect queries, union query, piggy-backed queries, stored procedures, inference query, alternate encodings and so on, and support the large-grained reuse of the code for detecting SQL injection attacks.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.780-793
• /
• 2022

Large-scale ontology management is one of the main issues when using ontology data practically. Although many approaches have been proposed in relational database management systems (RDBMSs) or object-oriented DBMSs (OODBMSs) to develop large-scale ontology management systems, they have several limitations because ontology data structures are intrinsically different from traditional data structures in RDBMSs or OODBMSs. In addition, users have difficulty using ontology data because many terminologies (ontology nodes) in large-scale ontology data match with a given string keyword. Therefore, in this study, we propose a (graph database-based ontology management system (GOMS) to efficiently manage large-scale ontology data. GOMS uses a graph DBMS and provides new query templates to help users find key concepts or instances. Furthermore, to run queries with multiple joins and path conditions efficiently, we propose GOMS encoding as a filtering tool and develop hash-based join processing algorithms in the graph DBMS. Finally, we experimentally show that GOMS can process various types of queries efficiently.