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

database migration: A new architecture for transaction processing in broadband networks

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1998年第5期10卷 839-854页

作者： Hara, T Harumoto, K Tsukamoto, M Nishio, S Osaka Univ Grad Sch Engn Dept Informat Syst Engn Osaka 5650871 Japan

Due to recent developments in network technologies, broader channel bandwidth is becoming prevalent in worldwide networks. As one of the new technologies making good use of such broadband channels, dynamic relocation of databases through networks, which we call database migration, will soon be used in practice asa powerful and basic database operation. We propose two transaction processing methods to take advantage of database migration in broadband networks. These methods choose the most efficient transaction processing method between the conventional method, based on the two-phase commit protocol, and our method, using database migration. We also propose a concurrency control mechanism and a recovery mechanism for our proposed methods. Simulation results are presented comparing the performance of our proposed methods and the conventional transaction processing method based on the two-phase commit protocol. The results demonstrate that the effective use of database migration produces better performance than the conventional method.

关键词： database migration broadband network distributed database system transaction processing concurrency control

来源：评论

学校读者我要写书评

暂无评论

COMMUNICATION FACILITIES FOR distributed TRANSACTION-PROCESSING systemS

引用

COMPUTER 1991年第8期24卷 61-66页

作者： MAFLA, E BHARGAVA, B PURDUE UNIV DEPT COMP SCIW LAFAYETTEIN 47907 ESCUELA POLITEC NACL CASILLAECUADOR

The study of communication designs in the context of the Raid system, a robust and adaptable distributed database system for transaction processing, is discussed. Related research work on local interprocess communication, remote interprocess communication, and communication protocols for both local area and wide area networks is briefly summarized. A series of experiments on the performance of the facilities available for building the Raid communication software is described. Raid's communication software, called Raidcomm, has evolved as a result of the knowledge gained both from other systems and from the authors' experiments. Several communication services and mechanisms that can be used to make Raid efficient are identified

关键词： Raid communication software Raid system Raidcomm communication protocols communication services computer networks distributed database system distributed databases local area networks local interprocess communication protocols remote interprocess communication transaction processing transaction processing wide area networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

File allocation designs for distributed multimedia information networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1998年第8期E81B卷 1647-1655页

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

In this paper, we study the optimal allocation of multimedia files in distributed network systems. In these systems, the files are shared by users connected with different servers geographically separated, and each file must be stored in at least one of servers. Users can access any files stored in any servers connected with high-speed communication networks. Copies of the files accessed frequently are to be stored in several servers that have databases. So, it is one of the most important problems how to assign the files to servers in view of costs and delays. Considering these problems in heterogeneous network environments, we present a new system model that covers wide range of multimedia network applications like VOD, GALS, and so on. In these systems, it is obvious that there is trading-off relationship between costs and delays. Our objective is to find the optimal file allocation such that the total cost is minimized subject to the total delay. We introduce a 0-1 integer programming formulation for the optimization problem, and find the optimal file allocation by solving these formulae.

关键词： distributed processing distributed database system optimal file allocation video on demand multimedia information network heterogeneous network

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimising the distributed execution of join queries in polynomial time

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 1999年第3期37卷 105-126页

作者： Reid, DJ Def Sci & Technol Org Div Informat Technol Salisbury SA 5108 Australia

It is proposed that an optimal strategy for executing a join query in a distributed database system may be computed in a time which is bounded by a polynomial function of the number of relations and the size parameters of the network. The solution so unveiled considers both the transmission costs and the processing costs incurred in delivering the required result to the user that issued the query. The query specifies that several relational tables are to be coalesced and presented to the appropriate user. Undertaking this task demands the utilisation of limited system resources, so that a strategy for fulfilling the request that imposes minimal cost to the system should be devised. Both the processor sites, and the communications links that interconnect them, are utilised;an optimal strategy is one that minimises a weighted sum of processing and data transmission costs. An integer linear programming model of this problem was originally proposed in [Ij;however, no suggestion was given as to how this model might be efficiently solved. By extending the earlier analysis, the recursive nature of the join computation is revealed. Further investigations then produce a modified relationship amenable to algorithmic solution;the resultant procedure has polynomial time and space requirements. (C) 1999 Elsevier Science Ltd. All rights reserved.

关键词： distributed database system dynamic program information system integer linear program join query optimisation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Join query optimisation in the distributed databases using a hybrid harmony search and artificial bee colony algorithm

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2021年第3期17卷 189-198页

作者： Yazdani, Manizheh Navimipour, Nima Jafari Islamic Azad Univ Dept Comp Engn Tabriz Branch Tabriz Iran Natl Yunlin Univ Sci & Technol Future Technol Res Ctr 123 Univ RdSect 3 Touliu 64002 Yunlin Taiwan

The query optimiser is a vital part of any distributed database mechanism. Reducing the execution period of the query depends on reaching an ideal query execution plan. Due to this issue's NP-hard nature, a hybrid harmony search and an artificial bee colony algorithm can be useful. The harmony is used to call query plans and signify them by S-dimension real vectors. A harmony memory is a place for creating and storing a primary population of harmony vectors. Then, bees explore harmony memory as a food source. The production of a novel nominate harmony out of all query plans in the harmony memory requires a pitch adjustment principle, a memory consideration one, and a random re-initialisation. Lastly, the new candidate vector replaces the worst harmony vector when it works better. The simulation outcomes have indicated that the introduced method reduces the expenses of evaluating a query compared to the harmony search and bee colony optimisation algorithms. However, this method has a longer execution time.

关键词： distributed database system join query optimisation harmony search algorithm artificial bee colony

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL distributed EXECUTION OF JOIN QUERIES

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 1994年第11期27卷 27-40页

作者： REID, DJ Distributed Systems Technology Centre Department of Computer Science The University of Queensland St. Lucia Queensland 4072 Australia

It is proposed that the execution of a chain query in a distributed system can be usefully and appropriately modeled as an integer linear program. In response to a user request, information in the form of relational tables scattered across the network is to be combined and made available to the user. The formulation initially attained by considering the behavior of the distributed system in processing such a query is then reduced by removing redundant linear constraints, to produce a model of minimal transmission cost execution. In view of varying properties displayed by the possibly many optima of this problem, further attention is devoted to discriminating between them. By perturbing the objective function, those solutions requiring fewer network transmissions can be favored at the expense of equal-cost, but more complicated, strategies. This includes those strategies that may specify the transmission of a relation around a cycle;when the costs of transmission between sites forming the cycle are zero, such a solution might otherwise be optimal. Many different ways have been devised to solve programs having some number of variables restricted to taking only integer values in some interval, and virtually any of these might be used to solve the join query model. One possible method, using a tree-search approach, is discussed here.

关键词： distributed database system INTEGER LINEAR PROGRAM JOIN QUERY SIMPLEX METHODS TREE-SEARCH ALGORITHM

来源：评论

学校读者我要写书评

暂无评论

EXECUTING JOIN QUERIES IN AN UNCERTAIN distributed ENVIRONMENT

引用

MATHEMATICAL AND COMPUTER MODELLING 1995年第3期22卷 9-23页

作者： REID, DJ Distributed Systems Technology Centre Department of Computer Science The University of Queensland St. Lucia Queensland 4072 Australia

The uncertainty inherent in the distributed environment poses new challenges to the efficient utilization of system resources in managing database transactions. In response to this realization, the execution of a join query in a system with probabilistic resource and cost parameters is contemplated, leading to the development of stochastic programming models. Information in the form of relational tables and scattered amongst the sites of a distributed database system is to be collated and presented to the appropriate user, in response to an issued request. Performing this task demands the usage of limited resources;the ultimate goal is the determination of an execution strategy incurring minimal cost to the system. The actual state of any network component at the moment of its exploitation cannot be exactly ascertained in advance. Any interrogation of a distant element must be communicated by the network, and this involves a delay, as perceived by the questioner, during which the state of the system may change. Indeed, the time at which a task assigned to any particular component cannot itself be precisely predicted, even if the future state of the component could be known definitively. By considering the uncertain nature of the distributed environment, the earlier model of join query evaluation presented in [1] can be modified in different ways to account for system parameters known only in a stochastic sense. This new level of subjectivity is a revelation of the many different attitudes that may be taken towards the chance of infeasibility in the solution, for the major issue in dealing with uncertainty is the choice of an appropriate measure of risk.

关键词： distributed database system INTEGER PROGRAMMING JOIN QUERY RELATIONAL database STOCHASTIC PROGRAMMING

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：