2016 (314)
2015 (176)
2014 (107)
2013 (62)
2012 (33)
2011 (24)
2010 (19)
2009 (18)
2008 (7)
보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.6 No.1 2013.02 pp.1-12
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
Inconsistent data in database occurs due to increasing number of data. A suitable technique is needed to reduce inconsistent data from database. In this paper, fuzzy multi attribute decision making was chosen to reduce inconsistent data from database. This technique contains 5 steps which are deriving quality vector, scale the quality matrix, compute weighted Euclidean distance and select final alternative. An application was developed using java and oracle technology. Sample data was selected for experiments purposes. The result indicates fuzzy multi attribute decision making is a suitable technique in reducing inconsistent data from database. Algorithm in fuzzy multi attribute decision making is able to find out a correct object.
Improving the Performance of Aggregate Queries with Cached Tuples in MapReduce
보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.6 No.1 2013.02 pp.13-24
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
As an essential approach for extracting valuable summarized information from massive data set, aggregate query plays important roles for data-intensive applications in cloud computing. As a popular cloud computing platform, MapReduce is a promising paradigm for processing massive data. However, executing aggregate query over massive data sets is very time-consuming and it is also inefficient to run aggregate query directly on MapReduce platform. In order to process an aggregate query efficiently, this work proposes a cache-based approach for improving the performance of aggregate queries on MapReduce platform. This approach enhances the performance of processing aggregate queries on MapReduce platform by caching the pre-processing results before executing the aggregate query. The pre-process results are partitioned into different parts which are cached on different nodes in the cluster. Some strategies are presented to maintain the cached tuples when the original data changes. The experimental results demonstrate that the proposed approach has better performance compared with some existing cache managing approach, such as LRU and LFU.
Semantic Multi-granular Lock Model in Object Oriented Database Systems
보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.6 No.1 2013.02 pp.25-48
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
In this paper, a semantic based multi-granular lock model for object-oriented database systems is proposed. It addresses the concurrency control issues related to all types of transactions to an object: run time transactions and design time transactions. In the case of run time transactions, it ensures consistency while providing fine granularity. In the case of design time transactions, the proposed work has the following features: First, it provides separate lock modes for all types of design time operations. Second, it provides fine granularity for design time transactions. Third, it reduces deadlocks due to lock escalation. The proposed work shows how concurrency can be maximized while ensuring consistency for all types of transactions. A simulation model is constructed to evaluate the performance of the proposed work. This model is used to compare the proposed work with two existing techniques. The performance results show that proposed scheme is better than existing works.
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.