A New Client-server Architecture for Distributed Query Processing a New Client-server Architecture for Distributed Query Processing
نویسندگان
چکیده
This paper presents the idea of \tuple bit-vectors" for distributed query processing. Using tuple bit-vectors, a new two-way semijoin operator called 2SJ++ that enhances the semijoin with an essentially \free" backward reduction capability is proposed. We explore in detail the beneets and costs of 2SJ++ compared with other semijoin variants, and its eeect on distributed query processing performance. We then focus on one particular distributed query processing algorithm, called the \one-shot" algorithm. We modify the one-shot algorithm by using 2SJ++ and demonstrate the improvements achieved in network transmission cost compared with the original one-shot technique. We use this improvement to demonstrate that equipped with the 2SJ++ technique, one can improve the performance of distributed query processing algorithms signiicantly without adding much complexity to the algorithms. Abstract This paper presents a new client-server architecture to process distributed queries. We transform an N-way join query into an N-way join operation on the join attribute values only, and a concatenation operation to assemble the nal join result. Rather than relying on conventional semijoin techniques, we use tuple bit vectors to eeectively reduce the network overhead. We demonstrate that under this new architecture, the autonomy of the remote sites involved in executing the distributed query is preserved to a maximum degree, no direct communication link or network traac among the remote sites is necessary, the available access paths on the participating relations can be eeectively utilized and each joining relation is usually scanned only twice. The bulk of the processing is done by the client, allowing better utilization of the server. Several techniques are proposed to handle the potential processing bottlenecks that might occur before and during the nal assembling stage. Finally we explore some of the query optimization and performance issues encountered when following this architecture to process distributed N-way join queries.
منابع مشابه
Separating indexes from data: a distributed scheme for secure database outsourcing
Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...
متن کاملGuardian 90: A Distributed Operating System Optimized Simultaneously for High-Performance OLTP, Parallelized Batch/Query and Mixed Workloads
The Tandem NonStop is a loosely-coupled multi-computer system managed by Guardian 90, a message-based distributed operating system designed to provide an environment for online transaction processing. One of the benefits of a loosely-coupled architecture is its inherently distributed character. A distributed architecture allows many components to be applied scalably in parallel to a large data-...
متن کاملHybrid Shipping Architectures: A Survey
Recent advances in relational database systems include distributed systems that can choose to execute portions of query processing functionality at server or client sites. A symmetric problem that has received little attention is the partitioning of client application functionality between client and server. This report presents a survey of the literature related to both of these partitioning p...
متن کاملDistributed Query Processing Using Partitioned Inverted Files
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The distributed system adopts a network of workstations model and the client-server paradigm. The document collection is indexed with an inverted file. We adopt two distinct strategies of index partitioning in the distribute...
متن کاملA Novel Method for VANET Improvement using Cloud Computing
In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...
متن کامل