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

INCORPORATING PROCESSOR COSTS IN OPTIMIZING THE distributed EXECUTION OF JOIN QUERIES

MATHEMATICAL AND COMPUTER MODELLING 1994年第3期20卷 7-29页

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

The processing of a join query in a distributed environment exacts the usage of both the network and its computational facilities. A formulation that accounts for both, and felicitously constructed as an integer linear program, is proposed. Information disseminated among the sites of a distributed system is to be amalgamated and presented to a user, in response to his request. From all possible strategies by which this might be achieved, one necessitating the smallest usage of system resources is to be chosen. The data transferal resources of the network are usually presumed to be of greatest significance, and therefore, an optimal strategy is most often defined to be one which minimizes the total transmission cost. One model conforming to this philosophy, appearing in [1), expediently takes the form of a linear integer program, and so forms the basis for further refinement. In the omission of processing costs, the various processor elements of the network are treated homologously;dissimilarities in processing ability are also ignored. By analyzing the nature of join computations at a single processor, the minimal transmission cost model can be hybridized to incorporate the cost of such computations and differences in processing power.

关键词： distributed database system INTEGER LINEAR PROGRAM JOIN QUERY RELATIONAL database

来源：评论

学校读者我要写书评

暂无评论

A LIUB(LOG(2)(N))-2 RESILIENT DECENTRALIZED COMMIT PROTOCOL

引用

IEEE TRANSACTIONS ON RELIABILITY 1994年第4期43卷 594-599页

作者： YUAN, SM National Chiao Tung University Hsinchu Taiwan

In distributed database systems, commit protocols are used to ensure the transaction atomicity. In the presence of failures, nonblocking commit protocols can guarantee the transaction atomicity without blocking the transaction execution. A (resilient) decentralized nonblocking commit protocol (RDCP) is proper-ed for distributed database systems. This protocol is based on the hypercube network topology and is 'liub(log(2)(N)) - 2' resilient to node failures (N = number of system-nodes). The number of messages sent among the N nodes is 0(***(2)(2)(N)) which is only a factor of log(2)(N) over the message complexity lower bound 0(***(2)(N)) of decentralized commit protocols. Furthermore, RDCP is an optimistic nonblocking protocol. It aborts the transaction only when some nodes want to abort or some nodes fail before they make local decisions.

关键词： distributed database system COMMIT PROTOCOL DECENTRALIZED ALGORITHM RESILIENCE HYPERCUBE MESSAGE COMPLEXITY

来源：评论

学校读者我要写书评

暂无评论

THE EFFECT OF INDEX PARTITIONING SCHEMES ON THE PERFORMANCE OF distributed QUERY-PROCESSING

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1993年第3期5卷 510-522页

作者： LIEBEHERR, J OMIECINSKI, ER AKYILDIZ, IF GEORGIA INST TECHNOL COLL COMPATLANTAGA 30332 UNIV CALIF BERKELEY DIV COMP SCIBERKELEYCA 94720 GEORGIA INST TECHNOL SCH ELECT ENGNATLANTAGA 30332 UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCIBERKELEYCA 94720

The benefit of using indexes for processing conjunctive queries in a database system is well known. The use of indexes in distributed database systems is equally justified. In a distributed database environment a relation may be horizontally partitioned across the nodes of the system and indexes may be created for the fragment of the relation that resides at each node. However, as an alternative, one might construct each index on the entire relation, i.e., global indexes, and then partition each index between the nodes. An approach is presented for processing such an index partitioning scheme in response to a conjunctive range query. The performance of these schemes is evaluated in terms of the response time of a query and the utilization of processors, disk, and communication network while varying the number of nodes and query mix.

关键词： distributed database system QUERY PROCESSING INDEXING SCHEME PARTITIONED GLOBAL INDEX PARTIAL INDEX CONJUNCTIVE QUERIES SIMULATION PERFORMANCE EVALUATION

来源：评论

学校读者我要写书评

暂无评论

distributed database-systemS - WHERE ARE WE NOW

引用

COMPUTER 1991年第8期24卷 68-78页

作者： OZSU, MT VALDURIEZ, P GTE LABS INC WALTHAMMA 02254 INST NATL RECH INFORMAT & AUTOMAT F-78153 LE CHESNAYFRANCE

The authors explain what is meant by a distributed database system and discuss its characteristics. They survey the state of distributed database technology, focusing on how well products meet the goals of transparent management of distributed and replicated data, reliability through distributed transactions, better performance, and easier, more economical system expansion. They then consider unsolved problems with regard to network scaling, distribution design, distributed query processing, distributed transaction processing, integration with distributed operating systems, and distributed multidatabase systems

关键词： distributed database system distributed databases distributed multidatabase systems distributed operating systems distributed query processing distributed transaction processing distribution design network operating systems network scaling query languages replicated data transaction processing

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE EVALUATION OF CATALOG MANAGEMENT SCHEMES IN distributed database-systemS

引用

INFORMATION systemS 1991年第2期16卷 125-144页

作者： FUI, KH JUNG, WC KOREA ADV INST SCI & TECHNOL DEPT COMP SCISEOUL 131SOUTH KOREA

Catalog management schemes may affect the site autonomy, query optimization, view management and data distribution transparency. However, the performance comparison of various catalog architectures has received relatively little attention. We employ the simulation models to investigate the relative performance of six catalog management schemes-a centralized catalog, two variations of fully replicated catalogs and three variations of partitioned catalogs-in a locally distributed database system and a geographically distributed database system. We show that three variations of partitioned catalogs perform better than the centralized catalogs and fully replicated catalogs over the wide range. The performance of centralized catalogs and fully replicated catalogs with quorum consensus are the worst because of the queuing delays in several queues. Our simulation results also indicate that the performance difference among the variations of partitioned catalogs is mainly due to the recompilation rate.

关键词： distributed database system CATALOG MANAGEMENT PERFORMANCE EVALUATION SIMULATION QUERY PROCESSING

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RESILIENT EXTENDED TRUE-COPY TOKEN SCHEME FOR A distributed database system

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1982年第3期8卷 173-189页

作者： MINOURA, T WIEDERHOLD, G STANFORD UNIV DEPT COMP SCISTANFORDCA 94305

The problem of failure recovery for a distributed database system is more complex than that for a centrally controlled database system. If all the sites in a distributed system whose data are updated by a transaction are not up and available at the time of transaction execution, either the updates must be cancelled for all sites or the updates for the temporarily inaccessible site must be saved for later delivery. A resilient control scheme for a distributed database system is described. The notion of a resilient system holds that a transaction cannot be executed if some true copies required by the transaction are not available within the partition where the transaction is executing. system objectives include the elimination of lost transaction updates, where the user receives an acknowledgment but updates are not posted, and lost transaction output, where updates are posted but the user receives no acknowledgment. Figures.

关键词： True Copy Token distributed database system Logical Data Replicated Data Resiliency Control

来源：评论

学校读者我要写书评

暂无评论

A METHODOLOGY FOR STRUCTURED database DECOMPOSITION

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1980年第2期6卷 205-218页

作者： CHANG, SK CHENG, WH Knowledge Systems Laboratory University of Illinois

We present a methodology for structured database decomposition based on the relational data model. It is argued that in the distributed database environment, structured database decomposition is attractive both for efficiency and for database security considerations. Techniques for parallel processing and hashed access of structurally decomposed database are presented. Techniques for structured database decomposition to support multiple user views are also described. Structured database decomposition is most advantageous in a query only database environment with stable user views, although dynamic updates can also be handled using techniques described in this paper.

关键词： Relational database database Decompostion distributed database system distributed Information system

来源：评论

学校读者我要写书评

暂无评论

The Correctness of Concurrency Control Mechanisms in a system for distributed databases (SDD-1)

引用

ACM Transactions on database systems (TODS) 1980年第1期5卷 52-68页

作者： Bernstein, Philip A. Shipman, David W. Center for Research in Computing Technology Aiken Computation Laboratory Harvard University Cambridge MA 02138 United States Computer Corpotation of America 575 Technology Square Cambridge MA 02139 United States

This paper presents a formal analysis of the concurrency control strategy of SDD-1. SDD-1, a system for distributed databases, is a prototype distributed database system being developed by Computer Corporation of America. In SDD-1, portions of data distributed throughout a network may be replicated at multiple sites. The SDD-1 concurrency control guarantees database consistency in the face of such distribution and replication. This paper is one of a series of companion papers on SDD-1 [2, 8]. © 1980, ACM. All rights reserved.

关键词： conflict graph correctness of concurrency control distributed database system serializability theory

来源：评论

学校读者我要写书评

暂无评论

Introduction to a system for distributed databases (SDD-1)

引用

ACM Transactions on database systems (TODS) 1980年第1期5卷 1-17页

作者： Rothnie, J.B. Bernstein, P.A. Fox, S. Goodman, N. Hammer, M. Landers, T.A. Reeve, C. Shipman, D.W. Wong, E. Computer Corporation of America 575 Technology Square Cambridge MA 02139 United States Center for Research in Computing Technology Aiken Computation Laboratory Harvard University Cambridge MA 02138 United States Massachusetts Institute of Technology Laboratory for Computing Science 545 Technology Square Cambridge MA 02139 United States Department of Electrical Engineering and Computer Sciences University of California Berkeley CA 94720 United States

The declining cost of computer hardware and the increasing data processing needs of geographically dispersed organizations have led to substantial interest in distributed data management. SDD-1 is a distributed database management system currently being developed by Computer Corporation of America. Users interact with SDD-1 precisely as if it were a nondistributed database system because SDD-1 handles all issues arising from the distribution of data. These issues include distributed concurrency control, distributed query processing, resiliency to component failure, and distributed directory management. This paper presents an overview of the SDD-1 design and its solutions to the above problems. This paper is the first of a series of companion papers on SDD-1 (Bernstein and Shipman [2], Bernstein et al. [4], and Hammer and Shipman [14]). © 1980, ACM. All rights reserved.

关键词： concurrency control database reliability distributed database system query processing relational data model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：