By Topic

Combining rule decomposition and data partitioning in parallel datalog program processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shao, J. ; Dept. of Comput. Sci., Ulster Univ., Jordanstown, UK ; Bell, D.A. ; Hull, M.E.C.

There are two approaches to processing Datalog programs in parallel. One is to decompose the rules of a program into concurrent modules, and then assign them to processors. The other is to partition data between processors, so that each processor evaluates the same program, but with less data. The authors propose a third approach which combines the two methods in a single framework. In this approach, rules are decomposed into segments and data is partitioned among the segments. There are a number of advantages of this approach. Most importantly, it provides good focus on processing the tuples that are relevant to queries, and allows data to be partitioned and balanced dynamically at different levels. An analytic performance study is also presented to illustrate the usefulness of the proposed approach

Published in:

Parallel and Distributed Information Systems, 1991., Proceedings of the First International Conference on

Date of Conference:

4-6 Dec 1991