• The Journal of Korean Association of Computer Education
• /
• v.5 no.3
• /
• pp.69-77
• /
• 2002

It has been important of a web programming education with the rapid development of the internet. The learning system for the web programming education needs that develops web programming and can check the results on the web. In this paper. I suggested the learning system that can confirm the editable script result on the web client-side languages as well as server-side languages. The reference scripts that refer the web elements to study the web language make a database with an hierarchical structure. The reference script database enhances the utility of the script as managing the database system. The reference scripts can verify the results with the editable state that the structure of the web documents is altered and the elements, attributes, attributes's values of web languages is changed. The reference script tests can ascertain the adaption of it with the frame test and the window test.

• The Journal of Information Technology and Database
• /
• v.7 no.2
• /
• pp.17-32
• /
• 2000

As XML emerging as the Internet electronic document language standard of the next generation, the number of XML documents which contain vast amount of Information is increasing substantially through the transformation of existing documents to XML documents or the appearance of new XML documents. Consequently, XML document retrieval system becomes extremely essential for searching through a large quantity of XML documents that are storied in and managed by DBMS. In this paper we describe the design and implementation of BADA-IV/XML query processor that supports content-based, structure-based and attribute-based retrieval. We design XML query language based upon XQL (XML Query Language) of W3C and tightly-coupled with OQL (a query language for object-oriented database). XML document is stored and maintained in BADA-IV, which is an object-oriented database management system developed by ETRI (Electronics and Telecommunications Research Institute) The storage data model is based on DOM (Document Object Model), therefore the retrieval of XML documents is executed basically using DOM tree traversal. We improve the search performance using Node ID which represents node's hierarchy information in an XML document. Assuming that DOW tree is a complete k-ary tree, we show that Node ID technique is superior to DOM tree traversal from the viewpoint of node fetch counts.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.597-610
• /
• 2011

In database application developments, data coexists in memory and disk spaces. To manipulate the memory data, the general programing languages are used and to manipulate the disk data, SQL is used. In particular, the procedural languages for the memory manipulation are difficult to create and manage than declarative languages such as SQL. Thus, this paper shows that a particular structure of memory data, tree structured, can be manipulated by SQL. Most of all, the model data of the user interfaces can be represented by a tree structure and thus, it can be processed by SQL except non set computations. The non set computations could be done by helper classes. The SQL memory data manipulation is more suited to the database application developments which have few complex computations.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.219-227
• /
• 2005

In this paper, we propose an efficient algorithm which generates frequent itemsets by only one database scanning. A frequent itemset is subset of an itemset which is accessed by a transaction. For each item, if informations about transactions accessing the item are exist, it is possible to generate frequent itemsets only by the extraction of items haying an identical transaction ID. Proposed method in this paper generates the data structure which stores transaction ID for each item by only one database scanning and generates 2-frequent itemsets by using the hash technique at the same time. k(k$\geq$3)-frequent itemsets are simply found by comparing previously generated data structure and transaction ID. Proposed algorithm can efficiently generate frequent itemsets by only one database scanning .

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.878-881
• /
• 2008

To index the object's trajectory is an important aspect in moving object database management. This paper implements an optimizing index structure named Rend 3D R-tree based on 3D R-Tree. This paper demonstrates the time period update method to reconstruct the MBR for the moving objects in order to decrease the dead space that is produced in the closed time dimension of the 3D R-tree, then a rend method is introduced for indexing both current data and history data. The result of experiments illustrates that given methods outperforms 3D R-Tree and LUR tree in query processes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1816-1821
• /
• 2016

Protein secondary structure is important for the study of protein evolution, structure and function of proteins which play crucial roles in most of biological processes. This paper try to effectively extract protein secondary structure information from the large protein structure database in order to predict the protein secondary structure of a query protein sequence. To find more remote homologous sequences of a query sequence in the protein database, we used PSI-BLAST which can perform gapped iterative searches and use profiles consisting of homologous protein sequences of a query protein. The secondary structures of the homologous sequences are weighed combined to the secondary structure prediction according to their relative degree of similarity to the query sequence. When homologous sequences with a neural network predictor were used, the accuracies were higher than those of current state-of-art techniques, achieving a Q3 accuracy of 92.28% and a Q8 accuracy of 88.79%.

• Journal of the Korean Society for information Management
• /
• v.5 no.1
• /
• pp.79-103
• /
• 1988

ETLARS- I1 system is a Hangeul information retrieval system, which can operate multiple bibliographic databases and process 2 byte Hangeul data as well as 1 byte English data. This paper describes the design of database structure and the implementation of online retrieval program.

• The Journal of Society for e-Business Studies
• /
• v.5 no.2
• /
• pp.61-79
• /
• 2000

For CALS environment, sharing information among business processes within the enterprise and between enterprises have been increased through common database. To support integrated data environment, data of the local legacy system must coincide with data of the global system to guarantee data integrity and transparency. This study is concerned with the implementation of this distributed database system under CALS environment. Based on existing IDEF methods, we developed a modified method which newly includes concepts of the enterprise structure, the integration of legacy databases, the distribution of data, and the distributed applications .

• Proceedings of the Korea Society of Design Studies Conference
• /
• 1999.10a
• /
• pp.50-51
• /
• 1999

웹 디자인 과정에 있어서 기존의 웹사이트들의 컨텐츠 정보뿐만 아니라 인터페이스를 기능적으로 이루고 있는 구조요소들에 관한 데이터 수집의 필요성이 요구된다. 그럼에도 불구하고 홈페이지 디자인에 있어 specification 수립을 위한 참고자료로써 또는 사용성 평가를 위한 자료로써 이런 종류의 데이터 베이스는 방대한 양의 인터넷 정보에 비해 미미한 편이다. (중략)

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.1
• /
• pp.81-95
• /
• 2009

The CDB(Constraint Database) model is a new paradigm for massive spatial data processing such as GIS(Geographic Information System). This paper will identify the limitation of the schema structure and query processing through prior spatial database research and suggest more efficient processing mechanism of constraint data model. We presented constraint model concept, presentation method, and the examples of query processing. Especially, we represented TIN (Triangulated Irregular Network) as a constraint data model which displays the height on a plane data and compared it with prior spatial data model. Finally, we identified that we were able to formalize spatial data in a simple and refined way through constraint data modeling.