Abstract
The issue of vertical partitioning was extensively studied with many proposed approaches, which can be applied to the areas where the match between data and transactions affects performance. Vertical partitioning is the process of producing groups of attributes, called fragments, which are composed of attributes with high aÆnity each other. Though a vertical partitioning method should be able to generate arbitrary n fragments as well as all meaningful fragments, previous methods have some limitations to support both of them. In this paper we propose an efficient and flexible vertical partitioning method based on a fuzzy graph. The method can not only generate all meaningful fragments at a time but also support n-ary partitioning without any complex mathematical computations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Tamer Ozsu and Patrick Valduriez, Principles of Distributed Database Systems, Prentice Hall, 1999.
Wesley W. Chu and Ion Tim Leong, “A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems,” IEEE Transactions on Software Engineering, Vol. 19,No. 8, 804–812, August, 1993.
Ladjel Bellatreche and Ana Simonet, “Vertical Fragmentation in Distributed Object Database Systems with Complex Attributes and Methods,” The Seventh International Workshop on Database and Expert Systems Applications, 15–21, 1996.
Michael Hammer and Bahram Njamir, “A Heuristic Approach to Attribute Partitioning,” ACM SIGMOD, 93–101, 1979.
Shamkant Navathe, Stefano Ceri, Gio Wiederhold, and Jinglie Dou, “Vertical Partitioning Algorithms for Database Design,” ACM Transactions on Database Systems, Vol. 9,No. 4, 680–710, December, 1984.
Shamkant B. Navathe and Minyoung Ra, “Vertical Partitioning for Database Design: A Graphical Algorithm,” ACM SIGMOD, 440–450, 1989.
Hoffer, J.A., and Severance, D.G., “The use of cluster analysis in physical database design,” In proceedings of first international conference on Very Large Database, 1975.
McCormick, W.T., Schweitzer, P.J., and White, T.W., “Problem decomposition and data reorganization by a clustering technique,” Operation Research, Vol. 20,No. 5, 993–1009, September, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
HyunSon, J., HoKim, M. (2001). α-Partitioning Algorithm: Vertical Partitioning Based on the Fuzzy Graph. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_53
Download citation
DOI: https://doi.org/10.1007/3-540-44759-8_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42527-4
Online ISBN: 978-3-540-44759-7
eBook Packages: Springer Book Archive