• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.261-270
• /
• 2006

Positional data of moving objects can be regularly sampled in order to minimize the cost of data collection in LBS. Since position data which are regularly sampled cannot include the changes of position occurred between sampling periods, sampled position data differ from the data predicted by a time parameterized linear function. Uncertain position data caused by these differences make the accuracy of the range queries for present positions diminish in the TPR tree. In this paper, we propose the uncertainty region to handle the range queries for uncertain position data. The uncertainty region is defined by the position data predicted by the time parameterized linear function and the estimated uncertainty error. We also present the weighted recent uncertainty error policy and the kalman filter policy to estimate the uncertainty error. For performance test, the query processor based by the uncertainty region is implemented in the TPR tree. The experiments show that the Proposed query processing methods are more accurate than the existing method by 15%.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.463-475
• /
• 2006

In applications such as a traffic management system, analysis using a spatial hierarchy of a spatial data warehouse and a simple aggregation is required. Over the past few years, several studies have been made on solution using a spatial index. Many studies have focused on using extended R-tree. But, because it just provides either the current aggregation or the total aggregation, decision support of traffic policy required historical analysis can not be provided. This paper proposes hybrid index based on extended aR-tree for the spatio-temporal aggregation. The proposed method supports a spatial hierarchy and the current aggregation by the R-tree. The sorted hash table using the time structure of the extended aR-tree provides a temporal hierarchy and a historical aggregation. Therefore, the proposed method supports an efficient decision support with spatio-temporal analysis and is Possible currently traffic analysis and determination of a traffic policy with historical analysis.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.359-366
• /
• 2013

In this paper, we studied how the data obesity can affect in which the response speed of database gradually slows down. Our research is performed by analyzing how the game data infrastructure is well-formed. Although there are a variety of ways to evaluate to measure the level of infrastructure, we performed with real information system. We analyzed data obesity by comparing the entity-relationship models between the products of real game information system and newly modeled databases. We could find data obesity is over 60% among overall average of game information system. It shows that 45% higher than standard obesity which is 15%. In this paper, data redundancy rate after performing the procedure of the data modeling was 41% resulting in an improvement of 23% compared to 64% of an existing model.

• Journal of Preventive Medicine and Public Health
• /
• v.55 no.6
• /
• pp.539-548
• /
• 2022

Objectives: The purpose of this study was to assess the organizational effectiveness of the introduction of a healthcare information system (electronic medical records and databases) in healthcare in Kazakhstan. Methods: The authors used a combination of 2 methods: expert assessment and strengths, weaknesses, opportunities, and threats (SWOT) analysis. SWOT analysis is a necessary element of research, constituting a mandatory preliminary stage both when drawing up strategic plans and for taking corrective measures in the future. The expert survey was conducted using 2 questionnaires. Results: The study involved 40 experts drawn from specialists in primary healthcare in Aktobe: 15 representatives of administrative and managerial personnel (chief doctors and their deputies, heads of medical statistics offices, organizational and methodological offices, and internal audit services) and 25 general practitioners. Conclusions: The following functional indicators of the medical and organizational effectiveness of the introduction of information systems in polyclinics were highlighted: first, improvement of administrative control, followed in descending order by registration and movement of medical documentation, statistical reporting and process results, and the cost of employees' working time. There has been no reduction in financial costs, namely in terms of the costs of copying, delivery of information in paper form, technical equipment, and paper.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.59-69
• /
• 2007

The trajectory of a tag in RFID system is represented as a interval that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. Whole trajectories of a tag are represented as a set of unconnected interval because the location of the tag which left the vicinity of a reader is unknown until it enters the vicinity of another reader. The problems are that trajectories of a tag are not connected. It takes a long time to find trajectories of a tag because it leads to searching the whole index. To solve this problem, we propose a technique that links two intervals of the tag and an index scheme called SLR-tree. We also propose a sharing technique of link information between two intervals which enhances space utilization of nodes, and propose a split policy that preserves shared-link information. And finally, we evaluate the performance of the proposed index and prove that the index processes history queries efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1250-1256
• /
• 2004

The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.20 no.4
• /
• pp.67-84
• /
• 2009

Cyber Textbook Museum is created by the Korean Educational Development Institute in part of the project to manage the knowledge and information of Korea to promote understanding of Korean education and its history. The original and full text of textbooks dating from the 1890s to the present have been digitized and arranged for easy access over internet. An exclusive portal site dealing with Korean textbooks and curriculum materials was made to provide not only the directory service of textbooks and curriculums in diverse data classifications, school levels, years/periods and subjects but also the keyword search by searching engine. Users can search the necessary materials easily and systematically over the screen and use all the functions except save, capture and print. The management system for textbook image(DjVu format), search system and DRM(Digital Rights Management) system were developed. Finally, four suggestions are proposed which are related in the aspects of policy, technical, systematic aspects for active and tremendous use of the site.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of the Korean Dietetic Association
• /
• v.10 no.3
• /
• pp.272-283
• /
• 2004

This study was conducted to develop menugen program: Korean recommended menu planning and search based on internet to promote self sufficiency of food in Korea. This program manipulate menu and search 432 Korean recommended menus which have been developed in combination of population characteristics of 9 age level, 3 residential areas, 3 income groups, four seasons and male or female. Clients can select the high self sufficiency recommended menu by inputting their age, residental area, income, season and sex in using Menugen program. MenuGen can analyze nutrients and compare with Korean Recommended Allowance about clients' menu based on their age and sex. It can access the food, dish and menu databases. And also client can use MenuGen program for menu planning and analysis nutrients. Client's menu data can be store, delete, modify and print through MenuGen too. It will be able to read the nutrition analysis data of the foods, the dishes and the menu. Therefore it provides convenient user interface to not only users but also dietitians and nutritionists, who take charge of making a menu, and experts in the field of food and nutrition. MenuGen will help the nutrition policy accomplishment and the food self-supply rate improvement of the nation with use of menu drawing up program of internet base.