Relational queries with a tensor processing unit

Tensor Processing Units are specialized hardware devices built to train and apply Machine Learning models at high speed through high-bandwidth memory and massive instruction parallelism. In this short paper, we investigate how relational operations can be translated to those devices. We present mapping of relational operators to TPU-supported TensorFlow operations and experimental results comparing with GPU and CPU implementations. Results show that while raw speeds are enticing, TPUs are unlikely to improve relational query processing for now due to a variety of issues

Better Semijoins Using Tuple Bit-Vectors

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 benefits and costs of 2SJ++ compared with other semijoin variants, and its effect 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 significantly without adding much complexity to the algorithms

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 benefits and costs of 2SJ++ compared with other semijoin variants, and its effect 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 significantly without adding much complexity to the algorithms

Memory system for a relational database processor

An associative memory for a relational database management system, with content addressing capability, is studied and analyzed. The system utilizes one level of indexing and the database is clustered. The logic-per-track approach is used for parallel processing of the data in a cylinder. The attributes and the tuples are allowed to have an arbitrary length and no encoding algorithm is used. The performance of the system is analyzed and it is demonstrated to have superior performance in comparison to software-based systems. The cost effectiveness of the system is also shown

TRINITY RELATIONSHIP AMONG WEB SERVERS, DATABASE SERVERS AND HUMANS IN DIFFERENT ROLES AND SETTINGS

Front-end web server and back-end database servers are widely recognized as two essential infrastructure components that cast a significant influence on the stability and success of individuals and organizations. Nevertheless, unreliable or problematic servers could cause issues to jeopardize the regular operation of those organizations. Knowing that the market now exists a wide range of available web server and database server providers, users face challenges of effectively evaluating those service providers based on their experience and perception of the definition of the excellent and robust web server and database server. Thus, the study would provide a detailed analysis and comparison between available and accessible performance evaluation methods. Besides, anonymous surveys within user groups are conducted to show reflections of how different groups of users in different roles and setting tend to evaluate the performance, and feedbacks from semi-structured interviews are presented and discussed.Master of Science in Information Scienc

Performance Evaluation of Outer Join Operations on Adds System

This paper describes the performance evaluation of an outerjoin operation on the ADDS system. It includes the definition of outerjoin, the algorithms used, the test results, and the recommendation of the evaluation.Computing and Information Science

A comparative study of the performance of concurrency control algorithms in a centralised database

Abstract unavailable. Please refer to PDF

Extending functional databases for use in text-intensive applications

This thesis continues research exploring the benefits of using functional databases based around the functional data model for advanced database applications-particularly those supporting investigative systems. This is a growing generic application domain covering areas such as criminal and military intelligence, which are characterised by significant data complexity, large data sets and the need for high performance, interactive use. An experimental functional database language was developed to provide the requisite semantic richness. However, heavy use in a practical context has shown that language extensions and implementation improvements are required-especially in the crucial areas of string matching and graph traversal. In addition, an implementation on multiprocessor, parallel architectures is essential to meet the performance needs arising from existing and projected database sizes in the chosen application area. [Continues.

Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks

Peer-to-peer (P2P) has become a modern distributed computing architecture that supports massively large-scale data management and query processing. Complex query operators such as range operator and join operator are needed by various distributed applications, including content distribution, locality-aware services, computing resource sharing, and many others. This dissertation tackles a number of problems related to range and join query processing in P2P systems: fault-tolerant range query processing under structured P2P architecture, distributed range caching under unstructured P2P architecture, and integration of heterogeneous data under unstructured P2P architecture. To support fault-tolerant range query processing so as to provide strong performance guarantees in the presence of network churn, effective replication schemes are developed at either the overlay network level or the query processing level. To facilitate range query processing, a prefetch-based caching approach is proposed to eliminate the performance bottlenecks incurred by those data items that are not well cached in the network. Finally, a purely decentralized partition-based join query operator is devised to realize bandwidth-efficient join query processing under unstructured P2P architecture. Theoretical analysis and experimental simulations demonstrate the effectiveness of the proposed approaches