• Asia pacific journal of information systems
• /
• v.12 no.2
• /
• pp.99-118
• /
• 2002

In this paper, we propose a visual relational database query language, VRQL, by modifying and extending the recently proposed $VOQL^*$. Like $VOQL^*$, VRQL, based on ven Diagram and graph, naturally reflects the structure of schemas in queries and has recursive formal semantics. However, VRQL has relationally complete expressiveness, while $VOQL^*$ is only a conjunctive query language. In the logical definition part of VRQL, which is the relational version of $VOQL^*$, most features of $VOQL^*$ are retained, and the semantics of queries are based on the tuple relational calculus. In the procedural definition part of VRQL, by introducing the concept of VRQL view and set operations, the expressiveness of VRQL is increased to the level equivalent to that of the relational algebra. Due to the introduction of VRQL views, existing queries or temporary queries used in the process of creating queries can be represented with views, so that complex queries may be represented more conveniently. Set operations, used with VRQL views, enable us to represent various queries, beyond the expressiveness of conjunctive query languages.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.553-561
• /
• 1999

The facility of schema evolution is necessary in object-oriented database applications. There exist several versions of schema and instances created under different versions of the schema concurrently in the database. This base proposes a mechanism for supporting accessing instances regardless of versions of the schema in schema evolution environments in object oriented databases. There is trade-off between the flexibility of schema modification operations and the system overhead for supporting such schema modifications. Access handling routines are provided to the undefined attributes in each version of the class. Access handling routines are also defined for each pair of semantics rather than defining backdate/update functions for each pair of versions of a class. Thus, this mechanism supports the change of semantics with reduced user and system overhead.

• Genomics & Informatics
• /
• v.3 no.2
• /
• pp.47-51
• /
• 2005

Molecular mechanisms of biological processes are typically represented as 'pathways' that have a graph­analogical network structure. However, due to the diversity of topics that pathways cover, their constituent biological entities are highly diverse and the semantics is embedded implicitly. The kinds of interactions that connect biological entities are likewise diverse. Consequently, how to model or process pathway data is not a trivial issue. In this review article, we give an overview of the challenges in pathway database development by taking the INOH project as an example.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.1
• /
• pp.69-75
• /
• 2007

The information in physical planning field shows the socio-economic potentials of land resources while cadastral data does the physical and legal realities of the land. The two domains commonly deal with land information but have different views. Cadastre has to evolved to the multi-purpose ones which provide value-added information and support a wide spectrum of decision makers by mixing their own information with other spatial/non-spatial databases. In this context, the demands of data exchange between the two domains is growing up but this cannot be done without resolving the heterogeneity between the two information applications. Both of either discipline sees the reality within its own scope, which means each has a unique way to abstract real world phenomena to the database. The heterogeneity problem emerges when an GIS is autonomously and independently established. It causes considerable communication difficulties since heterogeneity of representations forms unique data semantics for each database. The semantic heterogeneity obviously creates an obstacle to data exchange but, at the same time, it can be a key to solve the problems too. Therefore, the study focuses on facilitating data sharing between the fields of cadastre and physical planning by resolving the semantic heterogeneity. The core job is developing a conversion mechanism of cadastral data into the information for the physical planning by DB coupling techniques.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.2-27
• /
• 2002

As pact of a long-ranged project that aims at establishing database-theoretic semantics as a model of computational semantics, this presentation focuses on the development of a syntactic component for processing strings of words or sentences to construct semantic data structures. For design arid modeling purposes, the present treatment will be restricted to the analysis of some problematic constructions of Korean involving semi-free word order, conjunction arid temporal anchoring, and adnominal modification and antecedent binding. The present work heavily relies on Hausser's (1999, 2000) SLIM theory for language that is based on surface compositionality, time-linearity arid two other conditions on natural language processing. Time-linear syntax for natural language has been shown to be conceptually simple and computationally efficient. The associated semantics is complex, however, because it must deal with situated language involving interactive multi-agents. Nevertheless, by processing input word strings in a time-linear mode, the syntax cart incrementally construct the necessary semantic structures for relevant queries and valid inferences. The fragment of Korean syntax will be implemented in Malaga, a C-type implementation language that was enriched for both programming and debugging purposes arid that was particluarly made suitable for implementing in Left-Associative Grammar. This presentation will show how the system of syntactic rules with constraining subrules processes Korean sentences in a step-by-step time-linear manner to incrementally construct semantic data structures that mainly specify relations with their argument, temporal, and binding structures.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.183-186
• /
• 1996

The relational database management systems sometimes require extremely long and complicated queries for a certain retreval. In this case, recursive retirevals are more efficient approach than the usual queries. Many researchers have tried to incorporate semantics in the traditional relational models using artificial intelligence techniques. This new concept becomes a deductive database and sometimes it is also called as a logic programming. However, the designer of a deductive database did not overcome the short of relational database. In this paper, we propose a new way of designing queries for the deductive database. We also provide relations for recursive retrieval in the deductive database. These approaches are applied for the material requirement planning.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.726-729
• /
• 2004

Spatiotemporal phenomena are ubiquitous aspects of real world. In the spatial and temporal databases, integrity constraints maintain the semantics of specific application domain and relationship between domains when proceed update in the database. Efficient maintenance of data integrity has become a critical problem, since testing the validity of a large number of constraints in a large database and after each transaction is an expensive task. Especially, in spatiotemporal domain, data is more complex than traditional domains and very active. Additionally, it is not considered that unified frameworks deal with both spatial and temporal properties to handle integrity constraints. Therefore, there need a model to maintain integrity constraints in the unified frameworks and enforcement and management techniques in order to preserve consistence.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.701-708
• /
• 2004

Existing contents-based video retrieval systems search by using a single method such as annotation-based or feature-based retrieval. Hence, it not only shows low search efficiency, but also requires many efforts to provide system administrator or annotator with a perfect automatic processing. Tn this paper, we propose an agent-based, and automatic and unified semantics-based video retrieval system, which support various semantics-retrieval of the massive video data by integrating the feature-based retrieval and the annotation-based retrieval. The indexing agent embodies the semantics about annotation of extracted key frames by analyzing a fundamental query of a user and by selecting a key-frame image that is ed by a query. Also, a key frame selected by user takes a query image of the feature-based retrieval and the indexing agent searches and displays the most similar key-frame images after comparing query images with key frames in the database by using the color-multiple-partition histogram techniques. Furthermore, it is shown that the performance of the proposed system can be significantly improved.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.87-94
• /
• 1996

In order to design an extended relational database management system supporting multilevel security, the standard relational data model is extended and new relational integrity constrains are proposed for the model. The extended relational model and proposed multilevel integrity constraniants maintain database in consistent state and produce a basis that can eliminat eambiguity of entity and relation ship representations bypoly instantiation. The proposed up dates emantics canincreases the efficiency of up date operations by supporting multilevel entry and up dates. The semantics also provides a basis for the implementation of decomposition of extended relations.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.513-522
• /
• 2001

Active database execute an action of active rule defined in advance which is triggered automatically, whenever an event with the matching event specifications occurs, its condition is evaluated. Because these rules may in turn trigger other rules, the set of rules may be triggered each other indefinitely, Therefore, we propose a termination analysis method to guarantee termination. This proposed method considers composite event as well as rule execution time. Above all, the method not only uses deactivation graph combined to trigger graph for exact analysis, but also improves the complexity of analysis. Also the proposed method enhances accuracy of analysis result.