• Journal of the Korean Society for information Management
• /
• v.21 no.2
• /
• pp.189-210
• /
• 2004

The purpose of this study is to evaluate the performance of XML retrieval based on ORDBMSs(Object-Relational Database Management Systems) approach. This paper describes indexing and retrieval methods for XML documents and the methodologies of experiments at INEX(Initiative for the Evaluation of XML retrieval). Like any other traditional information retrieval experiment, the test collection was consists of documents, topics/queries, task, relevance assessments and evaluation. EXIMA$^{TM}$ Supply, a kind of native XML DB based on ORDBMS technologies, is used for this experiment. Although this approach has many benefits, for example, no delay in storing and searching XML documents. but it showed relatively disappointed retrieval performance at INEX 2002. This result may caused since the given topics had to be decomposed and modified to be processed by the XPath processor, and during this modification the original meaning of topics can be changed inevitably and some important information nay pass over.r.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.554-561
• /
• 2010

As a fundamental knowledge source in a global learning environment, it is feasible to apply the relational database management systems (RDBMS), object-oriented database management systems (OODBMS), and other traditional DBMS. However, the traditional DBMSs are not feasible in semantic knowledge/ontology representation and inference. One of the reasonable ways to overcome the limitations is the semantic web-based business support framework. Especially, in this study, we focused on the development of semantic web ontology and natural language (NL)-based inference framework. To validate the efficiency of the proposed framework, we considered a reasonable scenario for course recommendation in a university.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.780-793
• /
• 2022

Large-scale ontology management is one of the main issues when using ontology data practically. Although many approaches have been proposed in relational database management systems (RDBMSs) or object-oriented DBMSs (OODBMSs) to develop large-scale ontology management systems, they have several limitations because ontology data structures are intrinsically different from traditional data structures in RDBMSs or OODBMSs. In addition, users have difficulty using ontology data because many terminologies (ontology nodes) in large-scale ontology data match with a given string keyword. Therefore, in this study, we propose a (graph database-based ontology management system (GOMS) to efficiently manage large-scale ontology data. GOMS uses a graph DBMS and provides new query templates to help users find key concepts or instances. Furthermore, to run queries with multiple joins and path conditions efficiently, we propose GOMS encoding as a filtering tool and develop hash-based join processing algorithms in the graph DBMS. Finally, we experimentally show that GOMS can process various types of queries efficiently.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.47-56
• /
• 1999

We design and implement an ORDBMS-based geographic information system for sightseeing information of Chungbuk to verify the performance and applicability of GEUS/XTM ORDBMS. We Acquire the positional coordinates of the boundaries of administrative districts , roads, and railroads, determine the various kinds of information such as the locations of sightseeing sites, lodgings, and so on, design an object-relational schema using OMT, and implement the geographic information system including a database system. Through the examination of selective accessibility on the sightseeing inform ation database by the various queries, we conclude that the ORDBMS is more applicable than other DBMSs in modeling, storing, referring, and managing of non-fixed complex data such as sightseeing information. Therefore, ORDBMSs provide efficient and extensible implementations of databases and information services from various sources for the increasing demand on geographic information service on internet.

• 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 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 KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.209-215
• /
• 2005

Conventional ORDBMS vendors provide extension mechanisms for adding user-defined types and functions to their own DBMSs. Here, the extension mechanisms are implemented using a high-level interface. We call this technique loose-coupling. The advantage of loose-coupling is that it is easy to implement. However, it is not preferable for implementing new data types and operations in large databases when high Performance is required. In this paper, we propose to use the notion of tight-coupling to satisfy this requirement. In tight-coupling, new data types and operations are integrated into the core of the DBMS engine. Thus, they are supported in a consistent manner with high performance. This tight-coupling architecture is being used to incorporate information retrieval(IR) features and spatial database features into the Odysseus/IR ORDBMS that has been under development at KAIST/AITrc. In this paper, we introduce Odysseus/IR and explain its tightly-coupled IR features (U.S. patented). We then demonstrate a web search engine that is capable of managing 20 million web pages in a non-parallel configuration using Odysseus/IR.