Partitioning algorithms for a distributed deductive database

Kathleen Neumann*, Lawrence Henschen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


This paper presents the algorithms necessary to partition an Extended Predicate connection Graph (EPCG) that represents a deductive database for use with a distributed system. The algorithms satisfy our initial partitioning goals which include equalization of storage and processing costs, distributing the base relation nodes in an effective manner and preserving the locality of nodes within the EPCG as much as possible. These algorithms also account for multiple users who may be simultaneously accessing the system from various 'share nothing' workstations that are connected via a communication network.

Original languageEnglish (US)
Title of host publicationProceedings - ACM Computer Science Conference
EditorsDawn Cizmar
PublisherPubl by ACM
Number of pages8
ISBN (Print)0897916344
StatePublished - Jan 1 1994
EventProceedings of the 22nd Annual ACM Computer Science Conference - Phoenix, AZ, USA
Duration: Mar 8 1994Mar 10 1994


OtherProceedings of the 22nd Annual ACM Computer Science Conference
CityPhoenix, AZ, USA

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'Partitioning algorithms for a distributed deductive database'. Together they form a unique fingerprint.

Cite this