Partitioning algorithms for a distributed deductive database

Kathleen Neumann; Lawrence Henschen

Partitioning algorithms for a distributed deductive database

Kathleen Neumann^*, Lawrence Henschen

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

9 Scopus citations

Abstract

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 language	English (US)
Title of host publication	Proceedings - ACM Computer Science Conference
Editors	Dawn Cizmar
Publisher	Publ by ACM
Pages	288-295
Number of pages	8
ISBN (Print)	0897916344
State	Published - Jan 1 1994
Event	Proceedings of the 22nd Annual ACM Computer Science Conference - Phoenix, AZ, USA Duration: Mar 8 1994 → Mar 10 1994

Other

Other	Proceedings of the 22nd Annual ACM Computer Science Conference
City	Phoenix, AZ, USA
Period	3/8/94 → 3/10/94

ASJC Scopus subject areas

Hardware and Architecture

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

Cite this

@inproceedings{bd00e85915dc4951885d6b6d147ac742,

title = "Partitioning algorithms for a distributed deductive database",

abstract = "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.",

author = "Kathleen Neumann and Lawrence Henschen",

year = "1994",

month = jan,

day = "1",

language = "English (US)",

isbn = "0897916344",

pages = "288--295",

editor = "Dawn Cizmar",

booktitle = "Proceedings - ACM Computer Science Conference",

publisher = "Publ by ACM",

note = "Proceedings of the 22nd Annual ACM Computer Science Conference ; Conference date: 08-03-1994 Through 10-03-1994",

}

TY - GEN

T1 - Partitioning algorithms for a distributed deductive database

AU - Neumann, Kathleen

AU - Henschen, Lawrence

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028062519&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028062519&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028062519

SN - 0897916344

SP - 288

EP - 295

BT - Proceedings - ACM Computer Science Conference

A2 - Cizmar, Dawn

PB - Publ by ACM

T2 - Proceedings of the 22nd Annual ACM Computer Science Conference

Y2 - 8 March 1994 through 10 March 1994

ER -

Partitioning algorithms for a distributed deductive database

Abstract

Other

ASJC Scopus subject areas

Other files and links

Cite this