检索结果-内蒙古大学图书馆

Practically realizable efficient data allocation and replication strategies for distributed databases with buffer constraints

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed systemS 2006年第9期17卷 1001-1013页

作者： Gu, Xin Lin, Wujuan Veeravalli, Bharadwaj Siemens Ltd Beijing 100102 Peoples R China Data Storage Inst Singapore 117608 Singapore Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore

In this paper, we address the performance of distributed database systems with buffer constraints. Specifically, our objective is to design and analyze efficient data allocation and replication strategies to minimize the total servicing cost for an arbitrary read/write request sequence, under finite buffer constraints of the nodes in the system. When the available buffer space in a node is not enough to store a copy of an object, the decision has to be made on whether or not we should evict one or more objects in use to give room for the new object copy. In this paper, we design and analyze the data replication strategies with the model of Dynamic Window Mechanism (DWM) algorithm jointly implemented with different types of object replacement strategies ( No Replacement, LRU, and LFU) commonly found in practice. We consider situations wherein the object sizes are identical as well as heterogeneous. We will show the impact on the performance of the allocation and replication strategies due to the limited local database buffer capacities. We analyze and quantify theoretically ( using competitive analysis) the performances of all the proposed algorithms. Further, we perform rigorous simulation experiments to validate the findings with respect to several influencing parameters. Several useful conclusions are drawn based on the experimental results and we highlight the usefulness of the algorithms under different situations.

关键词： object allocation distributed database system competitiveness replacement algorithms caching communication cost

来源：评论

学校读者我要写书评

暂无评论

A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

引用

COMPUTERS & OPERATIONS RESEARCH 2006年第4期33卷 1056-1080页

作者： Allahverdi, A Al-Anzi, FS Kuwait Univ Dept Ind & Management Syst Engn Safat Kuwait Kuwait Univ Dept Comp Engn Safat Kuwait

The assembly flowshop scheduling problem has been addressed recently in the literature, There are many problems that can be modeled as assembly flowshop scheduling problems including queries scheduling on distributed database systems and computer manufacturing. The problem has been addressed with respect to either makespan or total completion time criterion in the literature. In this paper, we address the problem with respect to a due date-based performance measure, i.e., maximum lateness. We formulate the problem and obtain a dominance relation. Moreover, we propose three heuristics for the problem: particle swarm optimization (PSO), Tabu search. and EDD. PSO has been used in the areas of function optimization, artificial neural network training, and fuzzy system control in the literature. In this paper, we show how it can be used for scheduling problems. We have conducted extensive computational experiments to compare the three heuristics along with a random solution. The computational analysis indicates that Tabu outperforms the others for the case when the due dates range is relatively wide. It also indicates that the PSO significantly outperforms the others for difficult problems. i.e., tight due dates. Moreover, for difficult problems, the developed dominance relation helps reduce error by 65%. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： assembly flowshop distributed database system scheduling maximum lateness particle swarm optimization Tabu search heuristic

来源：评论

学校读者我要写书评

暂无评论

Investigating the effect of an attack on a distributed database

Investigating the effect of an attack on a distributed datab...

引用

7th Annual IEEE Information Assurance Workshop

作者： Samara, Rami Panda, Brajendra Univ Arkansas Dept Comp Sci & Comp Engn Fayetteville AR 72701 USA

ISBN: (纸本)9781424401291

After an attack on a database system, evaluation of damage must be performed as soon the attack is identified. Otherwise, the initial damage will spread to other parts of the database via valid transactions, consequently resulting in denial-of-service. Damage assessment in a distributed database system is a complicated task due to intricate transaction relationships among distributed sites. In these systems, when any sub-transaction reads a damaged data at any site, the entire transaction of which the sub-transaction is a part, is considered affected by the damage. Hence, the data items updated by that transaction irrespective of sites are also considered damaged. This research focuses on damage assessment procedure for distributed database systems and uses a two-pass algorithm to obtain the final fist of affected data items. The advantages of this method are: (1) the process is fully distributed in the sense that every site will execute the same algorithm, (2) the amount of data to be exchanged between the sites is minimized to the list of affected items at each site instead of the entire log, and (3) the local damage assessors can be executed in parallel at their respective sites.

关键词： distributed database system transaction dependency dependency graphs local logs malicious transactions affected transactions damaged data items

来源：评论

学校读者我要写书评

暂无评论

An enhanced probe-based deadlock resolution scheme in distributed database systems

引用

IEICE TRANSACTIONS ON INFORMATION AND systemS 2002年第12期E85D卷 1959-1961页

作者： Kim, MJ Eom, YI Sungkyunkwan Univ Sch Elect & Comp Engn Jangan Gu Suwon Kyonggi Do South Korea

We suggest a new probe message structure and an efficient probe-based deadlock detection and recovery algorithm that can be used in distributed database systems. We determine the characteristics of the probe messages ... 详细信息

关键词： distributed database system deadlock detection probe-based algorithm edge-chasing

来源：评论

学校读者我要写书评

暂无评论

Reliability-based mirroring of servers in distributed networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2002年第2期E85B卷 540-549页

作者： Nakaniwa, A Takahashi, J Ebara, H Okada, H Kansai Univ Fac Engn Suita Osaka 5648680 Japan

In this paper, we consider optimal mirror allocation problems for the purpose of load balancing in network servers. We focus on constructing high-reliability networks and propose the optimal mirror allocation model such that the system reliability is maximized subject to costs and delays, in view of the trade-off between the reliability and cost. This optimization model is capable of dealing with various kinds of network topologies, although for simplicity, we assume the read-only situation. We formulate this optimization problem into a 0 1 integer programming model, and we use an approximate method for numerical analysis in order to analyze more large-scale systems. Our objective is to find the optimal mirror allocation by solving this model, and to show quantitatively the general characteristics of the load balancing and the improvement of the system reliability by the distributed mirror allocation.

关键词： load balancing reliability mirroring distributed database system Internet

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of DB-MANα: Does database Migration Work Well in a Real Environment? 02

Design and Implementation of DB-MANα: Does Database Migrati...

引用

Australasian database Conference

作者： Toyokazu Akiyama Shinobu Sakai Akimichi Umigai Takahiro Hara Masahiko Tsukamoto Shojiro Nishio Applied Information Systems Division Cybermedia Center Osaka University 5-1 Mihogaoka Ibaraki Osaka 567-0047 Japan

ISBN: (纸本)0909925836

Due to the recent expansion of network bandwidth, the data propagation delay has become a significant factor which influences the system performance in place of the data transmission delay. Based on this fact, we have proposed a new technology to reduce the bad influence of propagation delay on the performance of distributed database system by relocating dynamically the database through networks, which we call database migration. Furthermore, we have proposed a database relocation method to choose the transaction processing method between the conventional database fixed method and the proposed database migration method by giving consideration to the transaction complexity. In this paper, we explain our distributed database system with database migration mechanism based on these proposals, and the implementation of the DB-MANα system as a prototype system. The DB-MANα system reduces the database migration time by using a main memory database technique, which induces us to add a backup management mechanism for migratory databases. Moreover, we show some measurement results for the performance evaluation of the DB-MANα system. The results show that the implemented system works well in a practical environment.

关键词： database migration distributed database system transaction processing database migration distributed database systems Propagation delay WELLS

来源：评论

学校读者我要写书评

暂无评论

Sensitivity analysis in optimal design for distributed file allocation systems

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2001年第6期E84B卷 1655-1663页

作者： Nakaniwa, A Onishi, M Ebara, H Okada, H Kansai Univ Fac Engn Suita Osaka 5648680 Japan

In distributed network systems, it is one of the most important problems how to assign the files to servers in view of cost and delay. It is obvious that there is a trading-off relationship between costs and delays in these systems. In order to evaluate the optimization that the total cost is minimized subject to the total delay, we have presented the Optimal File Allocation Model as 0-1 integer programming, and have investigated the general characteristics in distributed systems. In this model, we have introduced many cost and delay parameters to evaluate the total cost and delay in the system more exactly. In constructing practical systems, it is necessary to investigate the weight and the contribution of each parameter to the total cost. It is very useful to show how to estimate cost and delay parameters on the basis of this analysis. In this paper, we analyze the sensitivity of these parameters and make clear the influence between principal parameters.

关键词： distributed processing distributed database system file allocation sensitivity analysis multimedia information network

来源：评论

学校读者我要写书评

暂无评论

A web-based design for the mobile transaction management of a distributed database system 27

A web-based design for the mobile transaction management of ...

引用

Technology of Object-Oriented Languages International Conference (TOOLS 27)

作者： Zhong, JT Zhou, WL Deakin Univ Sch Comp & Math Geelong Vic 3217 Australia

ISBN: (纸本)0818690968

A mobile transaction management system enables users to receive transaction based services from both static and mobile hosts distributed in a large scale of network. The difficulty lies in the heterogeneity of computer systems and in the communication control to guarantee concurrency and consistency of transaction operations. The World Wide Web offers a uniformed vehicle to interface with users ubiquitously and an ideal architecture to implement mobile transaction systems. This paper reports a design using Java, JDBC and Web browser to implement a distributed database system, particularly a transaction management system covers mobile hosts and static workstations/PCs in which data and sewers are replicated.

关键词： transaction management World Wide Web distributed database system

来源：评论

学校读者我要写书评

暂无评论

Motion control system's integration into Intranet with distribution technology

Motion control system's integration into Intranet with distr...

引用

3rd World Congress on Intelligent Control and Automation

作者： Yuan, C Er, GH Wang, Z Zhao, JM Tsing Hua Univ Dept Automat Beijing 100084 Peoples R China

This thesis described the integration of the real-time motion control network with switch high-speed Ethernet technology and distributed database technology. An application is introduced at the end.

ISBN: (纸本)7312012035

This thesis described the integration of the real-time motion control network with switch high-speed Ethernet technology and distributed database technology. An application is introduced at the end.

关键词： fieldbus switch Ethernet Intranet control net programmable logic controller (PLC) distributed database system

来源：评论

学校读者我要写书评

暂无评论

Minimizing the response time of executing a join between fragmented relations in a distributed database system

引用

MATHEMATICAL AND COMPUTER MODELLING 1997年第1期25卷 59-75页

作者： Reid, DJ Information Technology Division Defence Science and Technology Organisation P.O. Box 1500 Salisbury SA 5108 Australia

The problem of describing minimal response time execution strategies in evaluating the join of several fragmented database relations, is considered. The consequential optimization problem assumes the convenient form of a min-max integer program. With further attention, various generalizations are realized that also include the performance objective of total execution cost. Tables of data logically conforming to the relational model of information are, at the physical level, frequently divided into numerous pieces. These fragments are found disseminated amongst the various sites of a distributed database system, with each one possibly replicated at any number of separate facilities. A submission demanding the amalgamation of many such relations is resolved by joining together their sets of component fragments in an appropriate manner, as defined by complicated patterns of overlapping attribute values. The final result is realized by then concatenating the products of these computations. This process is to be performed under the supervision of the database management system in such a way as to minimize the time taken, as perceived by the user who issued the request. These developments are based upon earlier investigations [1-5] that consider only the alternative optimization goal of minimal execution cost. With this in mind, several different different approaches may be taken to realize distinct hybrid models that give due regard to both measures of join query performance.

关键词： distributed database system integer program join query relational database

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：