• Journal of Industrial Technology
• /
• v.16
• /
• pp.247-256
• /
• 1996

The multilevel grid file(MLGF) is a dynamic multidimensional file organization supporting multi-attribute accesses efficiently. The paper proposes new method for batch-constructing MLGFs. Our method consists of two phases. The first phase begins by relocating all the objects in order that logically adjacent objects in multidimensional domain space are clustered in one dimensional physical space. For this, our method employs the Z-ordering scheme, which effectively maps multidimensional space into one dimensional space preserving proximity. The second phase paginates the relocated objects and creates leaf level directory entries, each of which corresponds to a object page. Simultaneously, it performs same actions on the directory entries recursively in a bottom-up fashion until the root directory fits in a page. For performance evaluation, we analyze our method in terms of the number of page accesses. The result shows the optimality of our method.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1097-1104
• /
• 2002

Recently, with a drop in memory chip price and rapid development of mass storage memory chip technology, research on client-server Database Management Systems has gained wide attention. This Paper discusses the recovery technique in a page-server OODBMS environment. Although most researchers have studied client-server systems, the recovery technique has been a poor researches. In this paper, client transfers only the completed log records to the server and resolves the problems in the current recovery techniques. In addition, the server manages only the execution of completed log records suggesting a simple recover algorithm, Client uses system concurrency, fully, by acting to abort actions and it suggests a page unit recovery technique to reduce time that is required in the whole database.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2008

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and at the same time places each data object that has different size into different shared pages. Consequently data objects that have the different call-site and different object size prohibited from being allocated to the same shared page. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.549-561
• /
• 2000

In database management systems(DBMSs), partial rollback is a useful facility that cancels part of the executed operations upon user's requests without a total rollback. Many relational DBMSs(RDBMSs) provide this facility, However, object-orientccd DBMSs (OODBMSs) cannot utilize the previous recovery scl18lne of partial rollback usccd in (RDBMSs) since, unlike RDBMSs, they use a dual buffer consisting of an object buffer and a page buffer. Therefore, a new recovery scheme is required that rolls back the data efficiently in the dual buffer. We propose four partial rollback schemes in OODBMSs that use a dual buffer. We classify the proposed schemes into the single buffer based partial rollback scheme and the dual buffer based partial rollback scheme according to the number of buffers used for partial rollback processing. We further classify them into Uthe page buffer based partial rollback scheme, 2)the object buffccr based partial rollback scheme, 3)the dual buffer based partial rollback scheme using soft log, and 4)the dual buffer based partial rollback scheme using shadows. We evaluate the performance by mathematical analysis and experiments. The results show that the dual buffer based partial rollback scheme using shadows provides the best performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.461-469
• /
• 2000

In the paper, the design and the implementation of the netscape plug-in and the speech synthesis enginegenerating the speech sounds from the text information of the web pages are described. The steps of the generating speech sound from an web pages are the speech synthesis plug-in is activated when the netscape finds the audio/xesp MIME data type embedded in the browsed web page; the HTML file referenced in the EMBED MTML tag is down loaded from the referenced URL to send to the commander object located in the said plug-in; The speech synthesis engine control tags and the text characters are extracted from the down loaded HTML document by the commander object the synthesized speech sounds are generated by the speech synthesis engine. The speech synthesis engine interprets the command streams from the commander objects to call the member functions for the processing of the speech segment data in the data banks. The commander object and the speech synthesis engine are designed as an independent object to enhancethe flexitility and the portability.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1182-1195
• /
• 1997

When we present some information, we can use application programs through multinedia-based authoring tools. Especially.many programers proposed to improve its intergration time and reduce programming speed and easy to use. However, multimedia based authoring tools have not all of programming methodolgies and do not supply special functions from user's request. Therefore, we have to apply effective functions through high-level programming languages.In this paper, we propose to use small appkication prograns through linking methods, So we reduce overhead from memory loading In authoring tools, we can use MCI(media control interface) call functions for playback audio files.we development ATS(Auto Transition System) for several functions-close MCI call audio files, get object status, page-to page trancition.We evidently show that an optimal configuration of presentation obtained by ATS algorithm.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.3
• /
• pp.61-67
• /
• 2020

This paper is to propose a hybrid memory adaptor using next-generation nonvolatile memory devices such as phase-change memory to improve the performance limitations of OpenStack-based object storage systems. The proposed system aims to improve the performance of the account and container servers for object metadata management. For this, the proposed system consists of locality-based dynamic page buffer, write buffer, and nonvolatile memory modules. Experimental results show that the proposed system improves the hit rate by 5.5% compared to the conventional system.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.69-82
• /
• 2004

A moving object has a special feature that it's spatial location, shape and size are changed as time goes. These changes of the object accompany the continuous movement that is called the trajectory. In this paper, we propose an index structure that users can retrieve the trajectory of a moving object with the access of a page. We also propose the multi-complex query that is a new query type for trajectory retrieval. In order to prove the excellence of our method, we compare and analyze the performance for query time and storage space through experiments in various environments. It is shown that our method outperforms the existing index structures when processing spatio-temporal trajectory queries on moving objects.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.333-335
• /
• 2006

In this page, we developed the inspection system for automobile parts using the laser vision sensor. Laser vision sensor has gotten 2 dimensions information and third dimension information of laser vision camera using the vision camera. Used JIG and ROBOT for inspection position transfer. Also, computer integration system developed that control system component pal1s and manage data measurement information. Compare sensor measurement result with CAD Data and verified measurement result effectiveness taking advantage of CAD to get information of measurement object.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2000

Many object oriented database systems manage object buffers to provide fast access to objects. Traditional buffer replacement algorithms based on fixed length pages simply assume that the cost incurred by operating a buffer is propertional to the number of buffer faults. However, this assumption no longer holds in an objects buffer where objects are of variable length and the cost of replacing an object varies for each object. In this paper, we propose a cost based replacement algorithm for object buffers. The proposed algorithm replaces the have minimum costs per unit time and unit space. The cost model extends the previous page based one to include the replacement costs and the sizes of objects. The performance tests show that proposed algorithm is almost always superior to the LRU-2 algorithm and in some cases is more than twice as fast. The idea of cost based replacement can be applied to any buffer management architectures that adopt earlier algorithms. It is especially useful in object oriented database systems where there is significant variation in replacement costs.