• The Journal of Information Systems
• /
• v.19 no.4
• /
• pp.25-49
• /
• 2010

As companies introduced ERP (Enterprise Resource Planning) systems since the middle of 1990s, the databases of the companies has become centralized and gigantic. The companies are now developing data-mining based applications on those centralized and gigantic databases for knowledge management. Almost of them are using $Pro^*C$/C++, a embedded SQL programming language, and it's because the $Pro^*C$/C++ is independent of platforms and also fast. However, they suffer from difficulties in development and maintenance due to the characteristics of corporate databases which have intrinsically large number of tables and fields. The purpose of this research is to design and implement a methodology which makes it easier to develop and maintain embedded SQL applications based on relational databases. Firstly, this article analyzes the syntax of $Pro^*C$/C++ and addresses the concept of repetition and duplication which causes the difficulties in development and maintenance of corporate information systems. Then, this article suggests a management architecture of source codes and databases in which a preprocessor generates $Pro^*C$/C++ source codes by referring a DB table specification, which would solve the problem of repetition and duplication. Moreover, this article also suggests another architecture of DB administration in which the preprocessor generates DB administration commands by referring the same table specification, which would solve the problem of repetition and duplication again. The preprocessor, named $PrePro^*C$, has been developed under the UNIX command-line prompt environment to preprocess $Pro^*C$/C++ source codes and SQL administration commands, and is under update to be used in another DB interface environment like ODBC and JDBC, too.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.108-110
• /
• 2019

A Database is a collection of data that does not have redundancy, and it is essential to easily use and share information in an information society where the amount of information is increasing. A typical structure of a Database is a relational database and a tree-structure Database. This research studies the programming language MUMPS, which is a tree structure database. This language constructs the database by storing arrays in a dynamic or B-Tree format. Unlike SQL, which must be used in languages such as Java and C #, MUMPS supports language and database independently and can manage data, so the data porting rate is high. In fact, in U.S. hospitals, the MUMPS-based platform has a high market share.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2018

As data size increase, a single database is not enough to serve current volume of tasks. Since data is partitioned and stored into multiple databases, analysis should also support parallelism in order to increase efficiency. However, traditional analysis requires data to be transferred out of database into nodes where analytic service is performed and user is required to know both database and analytic framework. In this paper, we propose an efficient way to perform K-means clustering algorithm inside the distributed column-based database and relational database. We also suggest an efficient way to optimize K-means algorithm within relational database.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.113-116
• /
• 2001

XML (extensible Markup Language) is a flexible way to create common information formats and share both the format and the data on the World Wide Web, intranets, and elsewhere. A document type definition (DTD) is a specific definition of the rules of the Standard Generalized Markup Language. A relational database management system (RDBMS) is a program that lets you create, update, and administer a relational database. An RDBMS takes Structured Query Language (SQL) statements entered by a user or contained in an application program and creates, updates, or provides access to the database. This paper has been studied a method of mappings from XML DTD to RDB schemas based on object model.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.189-198
• /
• 2005

XML is rapidly becoming the standard for data representation and exchange, and XML documents are being adopted in various applications. Since the late 1990s, some native XML database management systems(DBMSs) have been developed. More recently, commercial relational DBMS vendors try to incorporate full functionalities of XML into their products, such as Oracle, MS SQL and IBM DB2. In this paper, we implement a well-known RDBMS-based XML data storage and indexing technique, called XPath Accelerator, and tune it in an industry-leading RDBMS. Our contributions are two-folds: 1) an in-depth implementation of the XPath Accelerator technique and 2) its tuning to exploit the advanced query processing techniques of an RDBMS.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2467-2478
• /
• 1998

The spatiotemporal databases support historical informations as well as spatial managements for the objects in the real world, and can be efficiently used to various applications such as geographic information system, urban plan system, car navigation system. Although there are so far several pioneering works in spatioemporal data modeling, it is little to study on spatiotemporal query language. So in this paper, we at first survey a modeling technique that makes spatiotemporal objects into databases, and then show some sighificant functions supported by query language. Also we suggest a new spatiotemporal database query language, entitled as STQL, which make users to enable to manage efficient historical information as well as spatial management function on the basis of relational query language, SQL. Also the proposed STQL, shows their operationsl in spatiotemporal daabases.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.432-443
• /
• 2004

As the XML data has been widely used in the Internet, it is necessary to store and retrieve the XML data by using DBMSs. However, relational DBMSs suffer from the model difference between graph structure of the XML data and table forms in relational databases. We propose an ORDBMS-based DTD-dependent XML data management system Xing. Xing stores XML data in a DTD-dependent form in an object database. Since the object database schema has a graph structure and supports multi-valued attributes, mapping from an XML data model and queries into an object data model and OQLs is a simple problem. For rapid storing of large quantities of the XML data, we use SAX parser with customized Xing-tree which requires a small memory space compared with the DOM-tree. Xing also returns the query result in an XML document form. We have implemented the Xing system on top of UniSQL object-relational DBMS for the validity checking and performance comparison. For XML genome data from GenBank, and experimental evaluation shows that Xing can provide significant performance improvement (maximum 10 times) compared with the relational approach.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.668-681
• /
• 2006

Due to its diverse advantages, XML has secured its position as a standard for data representation and exchange in the Internet. As a consequence, there has been much research on efficient storing and query processing of in data. Storing XML data in a relational database system warrants much benefit in data management and query processing; the system provides a strong query processing and data management function and can be applicable to XML data, its function being extended. In this paper, we design and implement a query translator that translates XQuery, a representative XML query language, into SQL:2003 query. SQL:2003, the latest SQL standard used as a substitute for SQL:1999, defines SQL/XML that supports XML. The main contribution of this paper is as follows: First, we look into the supporting features of XML, defined in the SQL:2003 standard, and propose a user-defined function for shortcoming sections. Second, we propose a way to translate XQuery into SQL that observes the latest SQL standard. Third, we describe in detail the design and the implementation of the translator to show its feasibility as a translator.

• Journal of Internet Computing and Services
• /
• v.2 no.5
• /
• pp.81-91
• /
• 2001

XML is a standard markup language for exchange and storage of formed or well-formed information in World Wide Web, Because the source data of XML message for exchange of information in World Woo Web Is stored in legacy database systems. it is necessary the easier connection between XML application and database systems, In Oracle8i. 9i. informix and SQL2000. DBMS vendors extend their DBMSs for XML. This approach for the connection between XML application and database system is Platform-dependent and DBMS-dependent. Therefore it is necessary the platform- and DBMS-independent approach for the connection between XML application and database system, In this paper. we modeled a set of middleware components for relational database design based on XML DTD is modeled, Those components are modeled on object-based algorithm for connection between XML application and database system.

• Journal of the Korea Society for Simulation
• /
• v.1 no.1
• /
• pp.37-47
• /
• 1992

This paper proposes an analysis method of petri nets(PNs) using the relational algebra(RA). More wpecifically, we represent PNs in relations of the relational model. Based on such representation, we first develop an algorithm for generating reachability trees of PNs. we then develop an algorithm for generating reachability trees of PNs. We then develop algorithms for analyzing properties of PNs, such as boundedness, conservation, coverability, reachability, and liveness. The advantage of this approach is as follows: First, the algorithms represented by RA can be easity converted to a query language such as SQL of the widely used, commerical relational database management systems(DBMSs). Second, we can alleviate the problem of state space explosion because relational DBMSs can handle large amounts of data efficiently. Finally, we can use the DBMS's query language to interpret the Petri nets and make simulation.