• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.209-222
• /
• 2008

The product information can be practically stored and managed, and also queried when we use a relational database. We need to develop a special indexing scheme in order to process the queries to ask for the semantic relationships of the product information. Such semantic relationships include ISA or taxonomy relationships that have the transitive properties. In this paper, we propose an index scheme to effectively process those queries with the transitive property. The proposed index scheme is based on a numbering scheme that has relatively low update cost.

• The Journal of the Korea Contents Association
• /
• v.19 no.4
• /
• pp.63-78
• /
• 2019

The objective of this study is to verify the effects of private banking(PB) relation marketing on relationship quality between bank and customer and long-term business intention and to verify the mediating effect of the relationship quality. The subjects of this study were 431 PB customers in Seoul. The questionnaire data were utilized for verification of hypotheses through structural equation model analysis. As a result of verification, PB relation marketing presented a statistically significant positive correlation with relationship quality between bank and customer. The PB relation marketing showed a significant positive effect on the long-term business intention with the mediating effect of the relation quality. Finally, the result of this study is meaningful in a point of view of PB relation marketing of bank on the relationship quality and long-term business intention. It is worthwhile to verify the mediation effect of the relationship quality.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.477-491
• /
• 2002

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.1-19
• /
• 2010

Recently, it is necessary to process real time sensor data, which is generated from ubiquitous environments. Data, which are written by XML, are small, but, large volumes of data. Therefore, weneed to use an efficient method for processing a large amount of it. An XQuery has two types for sensor data: one is to get sensor identification and value from sensor data; the other is restructuring for user's convenience. Existing XQuery engines don't have efficient method for batch processing of sensor data. This paper proposed the twig query processing over reverse path summary, and we developed and applied restructuring batch processing method for real time processing of a large amount of sensor data. Finally, we do performance evaluation using XMark and RFID EPC data, and comparison analysis with MonetDB/XQuery and Berkeley DB XML.

• The Journal of Society for e-Business Studies
• /
• v.11 no.1
• /
• pp.1-23
• /
• 2006

As data on the Web is more and more in XML due to proliferation of Web applications such as e-Commerce, it is strongly required to rapidly process XML queries. One of such techniques is XML query caching. For frequently submitted queries, their results could be cached in order to guarantee fast response for the same queries. In this paper, we propose techniques for XML query performance improvement whereby the set of node identifiers(NIS) for an XML query is cached. NIS is most commonly employed as a format of XML query result,, consisting of the identifiers of the XML elements that comprise the query result. With NIS, it is suitable to meet the Web applications data retrieval requirements because reconstruction and/or modification of query results and integration of multiple query results can be efficiently done. Incremental refresh of NIS against its source updates can also be efficiently done. When the query result is requested in XML, however, materialization of NIS is needed by retrieving the source XML elements through their identifiers. In this paper, we consider three different types of NISs. proposing the algorithms of their creation, materialization, and incremental refresh. All of them were implemented using an RDBMS. Through a detailed set of performance experiments, we showed the efficiency of the proposed XML query caching techniques.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.295-306
• /
• 2009

Query execution time minimization is an important objective in distributed database design. While total time minimization is an objective for On Line Transaction Processing (OLTP), response time minimization is for Decision Support queries. We formulate the sub-query allocation problem using analytical models and solve with genetic algorithm (GA). We show that query execution plans with total time minimization objective are inefficient from response time perspective and vice versa. The procedure is tested with simulation experiments for queries of up to 20 joins. Comparison with exhaustive enumeration indicates that GA produced optimal solutions in all cases in much less time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.3
• /
• pp.615-625
• /
• 2015

This paper proposes new methods and examples for improving fraud detection rules based on banking customer's transaction behaviors focused on anomaly detection method. This study investigates real example that FDS(Fraud Detection System) regards fraudulent transaction as legitimate transaction and figures out fraudulent types and transaction patterns. To understanding the cases that FDS regard legitimate transaction as fraudulent transaction, it investigates all transactions that requied additional authentications or outbound call. We infered additional facts to refine detection rules in progress of outbound calling and applied to existing detection rules to improve. The main results of this study is the following: (a) Type I error is decreased (b) Type II errors are also decreased. The major contribution of this paper is the improvement of effectiveness in detecting fraudulent transaction using transaction behaviors and providing a continuous method that elevate fraud detection rules.

• The Journal of Society for e-Business Studies
• /
• v.14 no.1
• /
• pp.81-92
• /
• 2009

In order to use a RDBMS as the repository for product information, it is essential that the ontological query be processed effectively and answered properly, satisfying the user's expectations for an ontological query process. To be well-processed ontological queries, the key point is whether the various semantic relationships among the concepts of the product information are likewise well-processed. For feasibly processing a semantic query, we need to consider how the product ontology data is designed and stored in RDBMS. In this paper, we present how a RDB schema for the product ontology could be designed and queried.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.251-268
• /
• 2007

We design and implement an efficient storage technique to improve query processing for a large RDF data set. The proposed techniques can minimize data redundancy compared to the existing techniques by splitting relation information and data information from triple formatted RDF data. Also, we can enhance query processing speed separating and connecting the entire query steps by relation and data based on the proposed storage technique. The proposed technique can be applied to the areas, such as e-Commerce, semantic web, and KMS to store and retrieve a large RDF data set.

• The Journal of Society for e-Business Studies
• /
• v.19 no.1
• /
• pp.131-143
• /
• 2014

A triple database consisting of a number of three-column tables require high cost of query processing, whereby building a shortcut is known as an effective way to reduce the cost. It is important to figure out what shortcuts needs to be selectively built. Most shortcut selection algorithms make use of a benefit model that considers the query frequency. However they work poor to reflect the database update. In this paper, we consider a benefit model for triple databases. The model considers not only the profit of query response times but also the building and maintenance costs of the shortcuts. We apply the model to design a benefit function which can be plugged in a greedy-based shortcut selection algorithm. We perform the empirical experiments on a real-world dataset and analyze the effect of each factor employed in the benefit function.