A graph based cluster approach for vertical partitioning in database design

DOI10.1016/0169-023X(93)90003-8MaRDI QIDQ4294518zbMATH OpenOpenAlexWikidataFDO

Authors Xuemin Lin, M. E. Orlowska, Yanchun Zhang

Publication date 1 February 1995

Published in Data & Knowledge Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-023x(93)90003-8

zbMATH Keywords

attribute affinitydistributed databasefragmentationgraphpartitioningrelational databasetransaction

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1756665
• On fragmentation approaches for distributed database design
• An improved branch-and-bound clustering approach for data partitioning
• Database partitioning in a cluster of processors
• Publication:4725780

Cited in

(6)

• Database placement in communication networks for minimizing the overall transmission cost
• A parallel query processing system based on graph-based database partitioning
• On fragmentation approaches for distributed database design
• scientific article; zbMATH DE number 1756665 (Why is no real title available?)
• scientific article; zbMATH DE number 3999328 (Why is no real title available?)
• A Graph Theory-Based Approach for Partitioning Knowledge Bases

This page was built for publication: A graph based cluster approach for vertical partitioning in database design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294518)