Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartD
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 8D, Issue 6 - Oct 2001
Volume 8D, Issue 5 - Oct 2001
Volume 8D, Issue 4 - Aug 2001
Volume 8D, Issue 3 - Jun 2001
Volume 8D, Issue 2 - Apr 2001
Volume 8D, Issue 1 - Feb 2001
Selecting the target year
An Indexing Model for Efficient Structure Retrieval of XML Documents
Park, Jong-Gwan ; Son, Chung-Beom ; Gang, Hyeong-Il ; Yu, Jae-Su ; Lee, Byeong-Yeop ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 451~460
In this paper, we propose an indexing model for efficient structure retrieval of XML documents. The proposed indexing model consists of structured information that supports a wide range of queries such as content-based queries and structure-attribute queries at all levels of the document hierarchy and index organizations that are constructed based on the information. To support structured retrieval, a new representation method for structured information is presented. Using this structured information, we design content index, structure index, and attribute index for efficient retrieval. also, we explain processing procedures for mixed queries and evaluate the performance of proposed indexing model. It is shown that the proposed indexing model achieves better retrieval performance than the existing method.
XQL Query Processing Using XML Materialized Views
Kim, Su-Hui ; Mun, Chan-Ho ; Gang, Hyeon-Cheol ; Seo, Sang-Gu ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 461~472
Recently, much research on XML query processing considering the structural characteristics of XML documents is conducted, focusing primarily on the development and/or extension of XML query languages and on query optimization for effective retrieval of XML documents. In the XML repository, the XML views derived from the underlying XML documents could be stored materialized for effective retrieval of XML documents, and could be capitalized on for XML query processing In this paper, assuming that the XML views defined in XQL are materialized in the repository, we investigate XQL query processing that capitalizes on them. We describe the storage structure of the XML repository which supports the materialized views, and propose an algorithm that determines whether the given XQL query can be processed with the relevant materialized view adn accordingly transforms the original query into one against it.
Concurrency Control for Global Transaction Management in Integrated Heterogeneous Database System
Lee, Gyu-Ung ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 473~482
Integrated heterogeneous database systems provide the unified interface for users and applications today in order to access the underlying diverse data sources located in different sites. The multiple heterogeneous data sources have the different and specialized data structures and transaction processing capabilities. Because of local autonomy, the local system does not have the capability of cooperation to control the global transaction. Hence designing the global transaction manager with supporting the global serializability is difficult task. To resolve the well-known indirect conflict, we define the global transaction model by using the characteristics of global integrity constraints. And then we propose the site-locking operation and its protocol to manage the global transaction. The correctness and analysis of our site-locking protocol is proved and performance gain over the related other methods is also estimated in this paper.
Hypertext Retrieval System Using XLinks
Kim, Eun-Jeong ; Bae, Jong-Min ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 483~494
Most of hypertext retrieval models consider documents as independent entities. They ignore relationships between documents of link semantics. in an information retrieval system for hypertext documents, retrieval effectiveness can be improved when ling information is used. Previous link-based hypertext retrieval models ignore link information while indexing. They utilize link information to re-rank the retrieval results. Therefore they are limited that only the documents is result-set utilize link information. This paper utilizes link information when indexing. We present how to use term weighting and inLinks weighting for ranking the relevant documents. Experimental results show that recall and precision evaluation according to the link semantics and the comparison with previously link_based hypertext retrieval model.
An Efficient Technique for Storing XML Data Without DTD
Park, Gyeong-Hyeon ; Lee, Gyeong-Hyu ; Ryu, Geun-Ho ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 495~506
XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.
for Similarity Retrieval
O, Chang-Yun ; Im, Dong-Ju ; O, Gun-Seok ; Bae, Sang-Hyeon ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 507~512
Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The
is the most successful variant of the R-Tree. In this paper, we propose a SOM-based
as a new indexing method for high-dimensional feature vectors. The SOM-based
combines SOM and
to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based
with of an SOM and
using color feature vectors extracted from 40,000 images. The results show that the SOM-based
outperform both the SOM and
due to reduction of the number of nodes to build
and retrieval time cost.
A Termination Analyzer Including Execution Semantics of Active Rules
Sin, Ye-Ho ; Hwang, Jeong-Hui ; Ryu, Geun-Ho ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 513~522
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.
An Object Oriented Spatial Data Model Based on Geometric attributes and the Role of Spatial Relationships in Geo-objects and Geo-fields
Lee, Hong-Ro ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 516~572
Geographic Information System(CIS) deal with data which can potentially be useful for a wide range of applications. The information needed by each application can be vary, specially in resolution, detail level, application view, and representation style, as defined in the modeling phase of the geographic database design. To be able to deal with such diverse needs, GIS must offer features that allow multiple representation for each geographic entity of phenomenon. This paper addresses on the problem of formal definition of the objects and their relationships on the geographical information systems. The geographical data is divided into two main classes : geo-objects and geo-fields, which describe discrete and continuous representations of spatial reality. I studied the attributes and the relationship roles over geo-object and nongeo-object. Therefore, this paper contributed on the efficient design of geographical class hierarchy schema by means of formalizing attribute-domains of classes.
Non-Blocking Two Phase Commit Protocol Reducing the Blocking Problem
An, In-Sun ; Kim, Gyeong-Chang ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 523~532
An atomic commitment protocol ensures that distributed transcations terminate consistently at participating sites. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite of failure in the coordinator site and communication. It is well known that the famous two phase commit(2PC) is a blocking protocol, whereas the three phase commit(3PC) protocol is a non-blocking. In this paper, we propose a non-blocking two phase commit(NB-2PC) protocol reducing the blocking problem than propose non-blocking protocols. The NB-2PC protocol can be obtained through modifications of the 2PC protocol. After receiving Prepare message from coordinator in the NB-2PC protocol, participants respond to the coordinator and several participants in voting phase. While participants wait for decision message from the coordinator, the blocking occurs due to the failure of the coordinator site, participants elect new coordinator among several participants receive response message. Despite of the coordinator site failures, participants consult new coordinator and follow termination protocols and achieve non-blocking property. We propose a basic structure of NB-2PC protocol and termination protocol and new coordinator election protocol. The NB-2PC protocol has non-blocking property and reduces processing time of commit protocol than the 3PC protocol. Also, through simulation experiments, we propose the NB-2PC protocol exhibits better performance of processing time of commit protocol than 3PC protocol.
Scheduling Method of Real-Time Mobile Transaction Manager considering Value of Transactions and Validity of Real-Time Data
Jo, Suk-Gyeong ; Kim, Gyeong-Bae ; Lee, Sun-Jo ; Bae, Hae-Yeong ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 533~542
In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.
A Concurrency Control Technique Using Optimistic Atomic Broadcast In Replicated Database Systems
Choe, Hui-Yeong ; Hwang, Bu-Hyeon ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 543~552
To process transactions in fully replicated database, an atomic broadcast is mainly used. In this case of using atomic broadcast, transactions can be delayed because of the coordinating step among servers before processing the transaction. In this paper, we propose an algorithm to resolve the problem of transaction delay. In the proposed algorithm, the transactions are processed by using the optimistic method. The operations of a transaction are performed in the site that it is submitted and its write operations its updates atomically in all replicated sites. Since the serializability of transaction is ensured by checking the sequence number of transactions in the completion-inspection step.
Discovering Sequence Association Rules for Protein Structure Prediction
Kim, Jeong-Ja ; Lee, Do-Heon ; Baek, Yun-Ju ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 553~560
Bioinformatics is a discipline to support biological experiment projects by storing, managing data arising from genome research. In can also lead the experimental design for genome function prediction and regulation. Among various approaches of the genome research, the proteomics have been drawing increasing attention since it deals with the final product of genomes, i.e., proteins, directly. This paper proposes a data mining technique to predict the structural characteristics of a given protein group, one of dominant factors of the functions of them. After explains associations among amino acid subsequences in the primary structures of proteins, which can provide important clues for determining secondary or tertiary structures of them, it defines a sequence association rule to represent the inter-subsequences. It also provides support and confidence measures, newly designed to evaluate the usefulness of sequence association rules, After is proposes a method to discover useful sequence association rules from a given protein group, it evaluates the performance of the proposed method with protein sequence data from the SWISS-PROT protein database.
Extended High Dimensional Clustering using Iterative Two Dimensional Projection Filtering
Lee, Hye-Myeong ; Park, Yeong-Bae ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 573~580
The large amounts of high dimensional data contains a significant amount of noises by it own sparsity, which adds difficulties in high dimensional clustering. The CLIP is developed as a clustering algorithm to support characteristics of the high dimensional data. The CLIP is based on the incremental one dimensional projection on each axis and find product sets of the dimensional clusters. These product sets contain not only all high dimensional clusters but also they may contain noises. In this paper, we propose extended CLIP algorithm which refines the product sets that contain cluster. We remove high dimensional noises by applying two dimensional projections iteratively on the already found product sets by CLIP. To evaluate the performance of extended algorithm, we demonstrate its effectiveness through a series of experiments on synthetic data sets.
Improving Estimative Capability of Software Development Effort using Radial Basis Function Network
Lee, Sang-Un ; Park, Yeong-Mok ; Park, Jae-Hong ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 581~586
An increasingly important facet of software development is the ability to estimated the associated coast and effort of development early in the development life cycle. In spite of the most generally sued procedures for estimation of the software development effort and cost were linear regression analysis. As a result of the software complexity and various development environments, the software effort and cost estimates that are grossly inaccurate. The application of nonlinear methods hold the greatest promise for achieving this objects. Therefore this paper presents an RBF (radial basis function) network model that is able to represent the nonlinear relation for software development effort, The research describes appropriate RBF network modeling in the context of a case study for 24 software development projects. Also, this paper compared the RBF network model with a regression analysis model. The RBF network model is the most accuracy of all.
Component Implementation of Electronic Dictionary
Choe, Seong-Un ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 587~592
Many applications are being developed to automate office works, and the electronic dictionary(e-Dictionary) is one of the main components of the office suites. Several requirements are proposed for the efficient e-dictionaries :1) Fast searching time, 2) Data compatibility with other e-dictionaries to deal with words and obsolete word, and 3) Reusable components to develop new customized e-dictionaries with minimized development time and cost. We propose a data format with which any e-dictionary can change data with others. We also develop System Dictionary component and Customer Dictionary component to enable-and-play component reuse. Our e-dictionary achieves fast searching time by efficiently managing Trie and B-tree index structure for the dictionary components.
A Cache Consistency Control for B-Tree Indices in a Database Sharing System
On, Gyeong-O ; Jo, Haeng-Rae ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 593~604
A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.
A Study on the Distribution of Overload in Academic Affairs Management System Using Replication Server
Han, Gwang-Rok ; Lee, Seung-Won ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 605~612
In order to solve the overload of academic affairs management system, we propose a method builds a distributed Replication server and uses this server with the present centralized system. Normal query transactions which are not required for data modification are composed of almost all DML sentences. So we construct the distributed replication servers according to the data characteristics and make them perform the query transaction without modification. In this way, we can simultaneously distribute users and data, and cut down processing time for every transaction. Also Replication server has the advantages of implemental efficiency and economical because it uses resources of present centralized system without and additional configurations. Usually, to distribute the overload of server, they can use way, Client-side overload distribution that user program get present overload status then can choose a less overloaded server, and the other way, Server-side overload distribution that make use of Application Layer Scheduling Technique and IP Layer Scheduling Technique. Our Replication server can reduce the overload of centralized system by eliminating or complementing those defects of overload distribution, referred to in the forehead.
Design and Implementation of Dynamic Digital Rights Management System Based on Agent
Lee, Yong-Hyo ; Hwang, Dae-Jun ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 613~622
As logistic environment of digital resources is rapidly changing, protection of the intellectual property for digital resources has been recognized as one of important issues. Digital Rights Management (DRM) has taken much interests from ISP, authors and publishers of digital content as an integrated approach to create a reliable environment for access and the use of digital resource. In this paper we proposed a dynamic digital rights management system based on adaptive agent theory (ARPA : Adaptive Resource Protection Agent) to address problems facing contemporary DRM approaches : static rights management problem solving and strengthened monitoring/tracking system. We introduced a dynamic mission control scheme to realize dynamic digital rights management. We incorporated adaptive agent theory to implement on-and off-line tracking and protection. Through the implementation of protype system, the process, the process dynamic digital rights protection will be demonstrated.
Design and Implementation of Policy-oriented Matching Agent System for Electronic Commerce
Hwang, Byeong-Yeon ; Park, Seong-Cheol ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 623~630
Recently, Internet solution market is focused on competition in Electronic Commerce (EC) rather than necessity and effectiveness of EC. In this paper, we propose a policy-oriented matching agent system that makes EC market active. We can pursue diverse promotion since policies are objects, and we can formulate, carry out, pursue, and evaluated a policy consistently on the proposed solution since our solution is integrated into merits of rule-based system and operation space (release post). There are three important points of the implementation. It is component-based structure that fits to be a basic platform for EC. It is connected with other system easily, so it can help marketing. Marketing.
Design and Realization of Retrieval Engine On Demand Using a Dynamic Robot Agent
Kim, Seong ; Park, Cheol-U ; Lee, Chung-Seok ; Park, Gyu-Seok ;
The KIPS Transactions:PartD, volume 8D, issue 5, 2001, Pages 631~636
The technologies relevant to e-business have rapidly developed during very short period of time and recently it is expanding to the area of B2B. Keeping pace with this development in e-business, the information of comparison or analysis on commodities of a lot of sites is also required. Though the information on price comparison among internal shopping malls are now being offered, its not efficient for its renewing intervals are long and, due to some indiscreet collection of information for the purpose of fast renewal, much loads are being generated on the pertinent shopping malls. In this article, the retrieval engine on demand is designed and realized using a dynamci robot agent changing kinetically on the status of the pertinent shopping malls that can offer the customized service and presents the shopping malls with the lowest price for each commodity under e-business after the shortest time of collection and analysis while not giving loads to the pertinent shopping malls.