• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.363-371
• /
• 2006

In spite of computer's development, the present state of a lot of electronic documents overflowed it's going to be more difficult to get appropriate information. Therefore it's more important to get meaningful information than to focus on the speed of processing. Semantic web enables and intelligent processing by adding semantic meta data on your web documents. Also as the semantic web grows, the knowledge resource is more important. In this paper, we propose a RDF storage system using relational database model aimed at intelligent processing by adding semantic meta data on your web documents, also a query processor aimed at query processing through the storage system. By using relational model, we could overcome a weakness of object or memory model.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3753-3761
• /
• 2000

There exist several versions of schema and instances created under different versions of the schema concurrently in the database in schema evolution environments. This paper proposes a mechanism for accessing instances regardless of versions in schema evolution environments in object relational databases. Access handling routines are used in accessing to the instances through the undefined attributes in the versions in which they were created. The change of semantic information of attributes is supported. Access handling routines are defined for each pair of semantics rather than defining backdate/update functions for each pair of versions of a class. A query language that accommodates version and semantic information is defined through the extension of the primitive SQL format.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.813-818
• /
• 2002

This paper describes how to convert the *.mdl design information generated from the UML editor into the corresponding XML data, which is arranged to be saved in the relational database system. Also, various design informations can be referred and modified to make teams collaborate with each other on the web through the web browser. In addition, we provide an environment in which all the project team members can share a lot of source codes and execution files as well as object files produced from a web-based collaborative development environment. This thesis is the study about a navigation tool system that aids software developers in managing their web-based searches for relationships of design information.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.831-837
• /
• 2009

This paper suggests the method for saving the digital map which was made through aerial photography to ORDBMS (Object Relational Database Management System) and analyze its efficiency through experiments. The digital map has been used by file units because of managing or providing it to others. But this way can not get sequential graphic entities and just use it which was included in only one map. In this paper, we saved the digital map to ORDBMS at a time after converted the digital map entities based on the tile to the things can be inserted to ORDBMS. And, we also proved the possible methods to extract the graphic entities what we need from entire blueprint through experiments.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1197-1206
• /
• 2016

Performing continuous skyline queries of dynamic data sets is now more challenging as the sizes of data sets increase and as they become more volatile due to the increase in dynamic updates. Although previous work proposed support for such queries, their efficiency was restricted to small data sets or uniformly distributed data sets. In a production database with many concurrent queries, the execution of continuous skyline queries impacts query performance due to update requirements to acquire exclusive locks, possibly blocking other query threads. Thus, the computational costs increase. In order to minimize computational requirements, we propose a method based on a multi-layer grid structure. First, relational data object, elements of an initial data set, are processed to obtain the corresponding multi-layer grid structure and the skyline influence regions over the data. Then, the dynamic data are processed only when they are identified within the skyline influence regions. Therefore, a large amount of computation can be pruned by adopting the proposed multi-layer grid structure. Using a variety of datasets, the performance evaluation confirms the efficiency of the proposed method.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.105-116
• /
• 2001

Moving objects are spatiotemporal data that location and shape of spatial objects are changed continuously over time. If spatiotemporal moving objects are managed by conventional database system, moving objects management systems have two problems as follows. First, update for location information changed over time is occurred frequently. Second, past and future information of moving objects are not provided by system because only current state of objects is stored in the system. Therefore, in this paper, we propose a spatiotemporal moving objects management system which is able to not only manage historical information of moving objects without frequent update, but also provide all location information about past, current, and near future. In the proposed system, information of moving objects are divided into location information for representing location and motion information for representing moving habits. Especially, we propose the method which can search location information all objects by use of changing process algorithms with minimum history information. Finally, we applied the proposed method to battlefield analysis system, as the result of experiment, we knew that past, current, and near future location information for moving objects are managed by relational database and GIS system.

• Journal of Korea Multimedia Society
• /
• v.3 no.1
• /
• pp.1-13
• /
• 2000

While various types of information can be mixed in a continuous video stream without any cleat boundary, the meaning of a video scene can be interpreted by multiple levels of abstraction, and its description can be varied among different users. Therefore, for the content-based retrieval in video data it is important for a user to be able to describe a scene flexibly while the description given by different users should be maintained consistently This paper proposes an effective way to represent the different types of video information in conventional database models such as the relational and object-oriented models. Flexibly defined attributes and their values are organized as tree-structured dictionaries while the description of video data is stored in a fixed database schema. We also introduce several browsing methods to assist a user. The dictionary browser simplifies the annotation process as well as the querying process of a user while the result browser can help a user analyze the results of a query in terms of various combinations of Query conditions.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.176-183
• /
• 2003

Various techniques including histograms, sampling and parametric techniques have been proposed to estimate query result sizes for the query optimization. Histogram-based techniques are the most widely used form for the selectivity estimation in relational database systems. However, in the spatio-temporal databases for the moving objects, the continual changes of the data distribution suffer the direct utilization of the state of the art histogram techniques. Specifically for the future queries, we need another methodology that considers the updated information and keeps the accuracy of the result. In this paper we propose a novel approach based upon the duality and the marginal distribution to construct a histogram with very little time since the spatio-temporal histogram requires the data distribution defined by query predicates. We use data synopsis method in the dual space to construct spatio-temporal histograms. Our method is robust to changing data distributions during a certain period of time while the objects keep the linear movements. An additional feature of our approach supports the dynamic update incrementally and maintains the accuracy of the estimated result.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.529-544
• /
• 2001

Prefetching is an effective method to minimize the number of roundtrips between the client and the server in database management systems. In this paper we propose new notions of the type-level access pattern and the type-level access locality and developed an efficient prefetchin policy based on the notions. The type-level access patterns is a sequence of attributes that are referenced in accessing the objects: the type-level access locality a phenomenon that regular and repetitive type-level access patterns exist. Existing prefetching methods are based on object-level or page-level access patterns, which consist of object0ids of page-ids of the objects accessed. However, the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly. In contrast, even though the same objects are not accessed repeatedly, our technique effectively prefetches objects if the same attributes are referenced repeatedly, i,e of there is type-level access locality. Many navigational applications in Object-Relational Database Management System(ORDBMs) have type-level access locality. Therefore our technique can be employed in ORDBMs to effectively reduce the number of roundtrips thereby significantly enhancing the performance. We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm. Experimental results using the 007 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in the roundtrips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching, which a state-of the art prefetching method. These results indicate that our approach significantly and is a practical method that can be implemented in commercial ORDMSs.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.1 s.3
• /
• pp.5-16
• /
• 2000

OGC(Open GIS Consortium) suggests the 'OpenGIS Simple Feature Specification for CORBA' which is the OpenGIS implementation specification for CORBA to specify standard interfaces for reuse and interoperation among distributed heterogeneous GIS resources in the CORBA distributed computing environment. An OpenGIS server that supports this implementation specification moat correctly implement all interfaces defined in the OpenGIS implementation specification to be interoperable with wrapped GISs efficiently. In this paper, we have designed and implemented an OpenGIS server based an object relational GIS, called GEUS that integrates GIS and database technologies to provide spatial data types and spatial operators from the DBMS engine level. In the CORBA distributed computing environment, clients can access geospatial data stored in GIS wrapped by the OpenGIS server through the standard interfaces defined in the OpenGIS implementation specification for CORBA. In addition, clients can use geospatial operation features provided by a back-end GIS and interoperate with other GISs.