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

IEEE International Conference on Recent Advances and Innovations in Engineering (ICRAIE)

作者： Chauhan, Ganpat Singh Gupta, Mukesh Kumar Khunteta, Ajay PCE Comp Engn Jaipur Rajasthan India SKIT Comp Engn Jaipur Jaipur Rajasthan India

ISBN: (纸本)9781479940400

Atomic Commit Protocols (ACP) are used to maintain atomicity in distributed systems. There are protocols available to minimize the overhead between the coordinator and participants, some are to minimize blocking while some to release the locks acquire by different participants. Optimized Two phase Commit (O-2PC) Protocol has been proposed to optimize the performance of 2PC based of deferred and immediately consistency constraints by overlapping the voting phase where initiation of protocol is done from participant side. But no simulator is currently available. This paper Implementation of Optimized Commit Protocol (IOCP) is an effort to allow simulating the performance of O-2PC empirically to consider the indirect costs that is not possible to calculate analytically. The simulator is developed using Java Network Programming. This simulation tool also provides facility to compare different commit protocols based on some performance parameters.

关键词： distributed database system Two Phase Commit Protocol (2PC) Optimized Two Phase Commit Protocol (O-2PC) Three Phase Commit Protocol (3PC) Non-Blocking Commit Protocol Deferred and Immediate consistency constraints

来源：评论

学校读者我要写书评

暂无评论

Applying Read-Only Optimization in Commit Processing of Pure Main Memory database systems

Applying Read-Only Optimization in Commit Processing of Pure...

引用

21st Iranian Conference on Electrical Engineering (ICEE)

作者： Firoozandeh, Sadegh Staff Pooya Co Inc Tehran Iran

ISBN: (纸本)9781467356343

This paper applies the traditional read-only optimization in the one and two phase protocols of commit processing in the context of pure main memory database systems. Thereby there is no need for logging log records to backup node in read-only transactions. Through this optimization, the response time will be decreased in these transactions. Furthermore, the message complexity will be decreased which leads to the decrease of communicative traffic overhead during commit processing in distributed systems. This decrease in multi-level distributed transactions which are the most common types of transactions is more observable. Also, a new read-only optimization is proposed about two phase protocols that remove both the commit processing phases for read-only transactions and also removes all the logging activities to backup node for partially read-only transactions. As a result, response times, the message and log complexity, and transactions concurrency level in comparison to traditional read-only optimization will be improved more.

关键词： distributed database system Main memory database Transaction processing Commit processing Primary-backup system

来源：评论

学校读者我要写书评

暂无评论

An Efficient Nested Query Processing for distributed database systems

An Efficient Nested Query Processing for Distributed Databas...

引用

5th International Conference on Convergence and Hybrid Information Technology (ICHIT)

作者： Kang, Yu-Jin Choi, Chi-Hawn Yang, Kyung-En Kim, Hun-Gi Choi, Wan-Sup Chungbuk Natl Univ Dept Management Informat Syst U BIZ BK21 Cheongju South Korea Chungbuk Natl Univ Dept Bio Informat Technol Cheongju South Korea

ISBN: (纸本)9783642241055;9783642241062

Performance of OLAP queries becomes a critical issue as the amount of data in the data warehouses increases rapidly. To solve this performance issue, we proposed a high performance database cluster system called HyperDB in which many PCs can be mobilized for excellent performance. In HyperDB, an OLAP query can be decomposed into sub-queries, and each of the sub-queries can be processed independently on a PC in a short time. But if an OLAP query has nested form (i.e., nested SQL), it could not be decomposed into sub-queries. In this paper, we propose a parallel distributed query processing algorithm for nested queries in HyperDB system. Traditionally, parallel distributed processing of nested queries is known as a difficult problem in the database area.

关键词： distributed database system Data Warehouse OLAP Query Parallel distributed Processing Nested Query

来源：评论

学校读者我要写书评

暂无评论

Vertical partitioning method for secret sharing distributed database system

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年第11期E89A卷 3244-3249页

作者： Miyamoto, Toshiyuki Morita, Yasuhiro Kumagai, Sadatoshi Osaka Univ Grad Sch Engn Suita Osaka 5650871 Japan

Secret sharing is a method for distributing a secret among a party of participants. Each of them is allocated a share of the secret, and the secret can only be reconstructed when the shares are combined together. We have been proposing a secret sharing distributed database system (SSDDB) that uses a secret sharing scheme to improve confidentiality and robustness of distributed database systems. This paper proposes a vertical partitioning algorithm for the SSDDB, and evaluates the algorithm by computational experiments.

关键词： distributed database system multi-agent systems secret sharing scheme vertical partitioning

来源：评论

学校读者我要写书评

暂无评论

Large Scale distributed database systems Based On Semantic P2P networks

Large Scale Distributed Database Systems Based On Semantic P...

引用

The First International Conference on Networking and distributed Computing(第一届网络与分布式计算国际会议 ICNDC 2010)

作者： Lican Huang Institute of Networking & Distributed Computing Zhejiang Sci-Tech University HangZhou P.R.China 310018 Hangzhou Virtual Zone Information Technology Co. Ltd. Hangzhou P.R.China 310018

There are the trends that the users hope to retrieve information among lots of individual database systems distributed in lots of virtual organizations. To connect all these individual database systems into a virtual database system is a significant issue. This paper presents VIRGO_DDBMS, a framework of distributed database system based on virtual hierarchical tree Grid organizationsfVIRGO) P2P network. The table space are classified as hierarchical domains like DNS. The servers hosting database systems joins several groups of VIRGO network according to the owned tables' domains. VIRGO_DDBMS is effective for data update and retrieve by using distributed SQL statements. We use the policies which cache the host machines' addresses of database systems to avoid the overload of traffic of root nodes in tree structure. The proposal presented here can construct a virtual distributed database system which can manages huge volumes of data by connecting all database systems together which are owned by the individual virtual organizations.

关键词： distributed database system semantic P2P networks distributed SQL

来源：评论

学校读者我要写书评

暂无评论

A New Method of Genetic Algorithm for Data Allocation in distributed database systems

A New Method of Genetic Algorithm for Data Allocation in Dis...

引用

1st International Workshop on Education Technology and Computer Science

作者： Rahmani, Soheila Torkzaban, Vahid Haghighat, Abolfazl T. Islamic Azad University of Qazvin Iran Dept. of Elec. and Comp. Eng. Shahid-Beheshti University Tehran Iran Dept. of Elec. Comp. and IT Qazvin Azad University Qazvin Iran

ISBN: (纸本)9780769535579

The important problem of distributed database systems (DDBs) is "data allocation". There are many methods for this problem and there are two measures for compare these models: Minimal cost and Performance. In this paper we use a new method for using genetic algorithm. At first we generate clusters based on the communication cost between the sites, then perform genetic algorithm on these clusters to rind which one is the best situation for allocate data, at last allocate data to their sites in the same way. We improve performance of DDB with reduce number of communication cost, data redundancy, and minimize total data transfer cost by using genetic algorithm and grouping sites. We compare our results with another model;our proposal model has a higher performance.

关键词： Genetic Algorithm distributed database system Data allocation clustering reduce redundancy

来源：评论

学校读者我要写书评

暂无评论

A new ant colony optimization based algorithm for data allocation problem in distributed databases

引用

KNOWLEDGE AND INFORMATION systemS 2009年第3期20卷 349-373页

作者： Adl, Rosa Karimi Rankoohi, Seyed Mohammad Taghi Rouhani Shahid Beheshti Univ Dept Elect & Comp Engn Tehran Iran

The Performance and the efficiency of a distributed database system depend highly on the way data are allocated to the sites. The NP-completeness of the data allocation problem and the large size of its real occurrence, call for employing a fast and scalable heuristic algorithm. In this paper, we address the data allocation problem in terms of minimizing two different types of data transmission across the network, i.e., data transmissions due to site-fragment dependencies and those caused by inter-fragment dependencies. We propose a new heuristic algorithm which is based on the ant colony optimization meta-heuristic, with regards to the applied strategies for query optimization and integrity enforcement. The goal is to design an efficient data allocation scheme to minimize the total transaction response time under memory capacity constraints of the sites. Experimental tests indicate that our algorithm is capable of producing near- optimal solutions within a reasonable time. The results also reveal the flexibility and scalability of the proposed algorithm.

关键词： distributed database system Non-replicated data allocation Site-fragment dependency Inter-fragment dependency Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A coordinated planning model for the design of a distributed database system

引用

INFORMATION SCIENCES 2004年第1-4期164卷 229-245页

作者： Amiri, A Oklahoma State Univ Dept MSIS Coll Business 210 Stillwater OK 74078 USA

Motivated by a problem faced by a multimedia entertainment retailer, we explore the problem of planning the design of a distributed database system. The problem consists of planning the design/expansion of the distributed database system by introducing new database servers and retiring possibly some existing ones in order to reduce telecommunication costs for processing user queries and server acquisition, operations and maintenance cost in a multiperiod environment where user processing demand varies over time. We develop a mathematical programming model and an effective solution approach to determine the best decisions regarding acquisition and retirement of database servers and assignment of user processing demand to the servers over time. Through a computational study, we investigate the impact of important parameters such as length of the planning horizon and demand growth on the solution quality and utilization of server capacity and examine the effectiveness of the solution approach in comparison with the commercial package LINDO. We also discuss some extensions to the problem as directions for future research. (C) 2003 Elsevier Inc. All rights reserved.

关键词： planning distributed database system database servers mathematical programming heuristic

来源：评论

学校读者我要写书评

暂无评论

A 3-tiered client-server distributed database system component-based 04

A 3-tiered client-server distributed database system compone...

引用

Proceedings of the winter international synposium on Information and communication technologies

作者： Francisco Álvarez Cavazos Juan Carlos Lavariega Jarquín Instituto Tecnológico y de Estudios Superiores de Monterrey Monterrey México

The administration of distributed data is a need that nowadays many enterprises strive to fulfill. However, it is often difficult for these enterprises to find a software product capable of providing the solution they require. This is due to the inherent complexity to distributed data access, which has caused the majority of database applications to provide distributed access to a centralized database as a simpler alternative to distributed database systems. This article demonstrates that it is possible to design a component-based reference architecture of a distributed database systems (D-DBS) with a 3-tiered client-server structure from the solution given to the data distribution problem through the implementation of a global conceptual schema. Therefore, this proposal reduces the design complexity of a D-DBS.

关键词： 3-tiered client-server system component software architecture component-based system data distribution data integration middleware distributed database system

来源：评论

学校读者我要写书评

暂无评论

Secure transaction management protocols for MLS/DDBMS

引用

3rd International Conference on Information system Security (ICISS 2007)

作者： Kaur, Navdeep Singh, Rajwinder Misra, Manoj Sarje, A. K. Indian Inst Technol Dept Elect & Comp Engn Roorkee Uttar Pradesh India

ISBN: (纸本)9783540770855

Majority of the research in multilevel secure database management systems (MLS/DBMS) focuses primarily on centralized database systems. However, with the demand for higher performance and higher availability, database systems have moved from centralized to distributed architectures, and the research in multilevel secure distributed database management systems (MLS/DDBMS) is gaining more and more prominence. Traditional transaction management protocols (i.e., concurrency control and commit protocols) are important components of database systems. The most important issues for these protocols in MLS database system are the covert channel problem [2] and starvation of high security level transactions [10]. To address these problems, first we propose new correctness criteria for multilevel secure multiversion concurrency control protocol, called read-down conflict serializability. It is the extended definition of one-copy serial (or1-serial) that allows a transaction to read older versions, if necessary. If a concurrency control protocol allows transaction to read older versions, we can obtain better throughput and response time than the traditional multiversion concurrency control protocols. We show that multiversion schedule based upon proposed criteria is also one-copy serializable. Secondly, this paper proposes a secure multiversion concurrency control protocol for MLS/DDBMSs that is only free from covert channels but also do so without starving high security level transactions, in addition to ensure the proposed serializability. Further, in distributed database systems, an atomic commitment protocol is needed to terminate distributed transactions consistently. To meet MLS requirements and to avoid database inconsistencies 2PC commit protocol is also modified.

关键词： multilevel security concurrency control commit protocol covert channel distributed database system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：