Optimizing Database Accesses for Parallel Processing of Multikey Range Searches

نویسندگان

  • Myoung-Ho Kim
  • Sakti Pramanik
چکیده

A multikey search query has many qualified records because it specifies some of the attributes and the rest of them are unspecified. Thus, data distribution among the parallel devices is important to enhance access concurrency for multikey search queries. Though there are some heuristics on data distribution for multikey accesses, range specification in a query has not been considered in those methods. In this paper we investigate optimal data distribution for multiattribute range queries in parallel processing file systems. We show for various-types of multiattribute range queries that there are inherent limitations to achieve optimal distribution. The results show that optimal distribution does not exist in many cases even for files with two fields. We give sufficient conditions for the nonexistence of perfect optimal distribution for certain types of multiattribute range queries. We have also developed data distribution methods for several useful multiattribute range queries. Sufficient conditions for optimal distribution by these proposed data distribution methods are given. It will be shown that the proposed distribution methods are perfect optimal for certain types of multiattribute range queries, and strict optimal for a large class of multiattribute range queries.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concurrent and Distributed Data Structures for Multikey Sorting on Computer Clusters

Parallel computing has long offered the promise of very high performance for a wide range of applications, but unfortunately it is hampered by several drawbacks. Among the drawbacks of exploiting parallelism is the cost of messagepassing and communication overhead. Consequently, the trend in parallel and distributed computations is moving away from specialized platforms, such as the Cray/SGI T3...

متن کامل

Determining the Number of Remote Sites Accessed in Distributed Transaction Processing

We characterize the number of remote accesses and the number of distinct remote sites accessed by global transactions in a distributed database environment. Both measures are important in determining the overhead of distributed transaction processing and are affected by the distribution of transaction size (number of distinct objects accessed by a transaction) and the distribution of remote acc...

متن کامل

Manycore processing of repeated range queries over massive moving objects observations

The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. Parallelism enables such applications to face this data-intensive challenge and allows the devised systems to feature low latency and high scalability. In this paper we focus on a specific data-intensive problem, concerning the repeated processing of huge...

متن کامل

Isolated Persian/Arabic handwriting characters: Derivative projection profile features, implemented on GPUs

For many years, researchers have studied high accuracy methods for recognizing the handwriting and achieved many significant improvements. However, an issue that has rarely been studied is the speed of these methods. Considering the computer hardware limitations, it is necessary for these methods to run in high speed. One of the methods to increase the processing speed is to use the computer pa...

متن کامل

An Optical Content-Addressable Parallel Processor for High-Speed Database

In this paper, we extend the concept of optical content-addressable parallel processing [1] to a novel architecture designed speci cally for the parallel and high-speed implementation of database operations called Optical Content-Addressable Parallel Processor for Relational database Processing (OCAPPRP). OCAPPRP combines a parallel model of computation { associative processing with a parallel ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. J.

دوره 35  شماره 

صفحات  -

تاریخ انتشار 1992