한국정보과학회논문지:데이타베이스 (Journal of KIISE:Databases)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

퍼지 그래프 기반의 수직 분할 알고리즘

A Vertical Partitioning Algorithm based on Fuzzy Graph

  • 손진현 (한국과학기술원 전산학과) ;
  • 최경훈 (한국과학기술원 전산학과) ;
  • 김명호 (한국과학기술원 전산학과)
  • Son, Jin-Hyun (Dept. of Computer Science, Korea Advanced Institute of Science and Technology) ;
  • Choi, Kyung-Hoon (Dept. of Computer Science, Korea Advanced Institute of Science and Technology) ;
  • Kim, Myoung-Ho (Dept. of Computer Science, Korea Advanced Institute of Science and Technology)
  • 발행 : 2001.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

사용자의 질의 요청을 보다 빨리 지원하고 시스템 전체 처리량을 증가시키기 위한 하나의 방법으로 데이터 스키마의 수직 분할 문제가 많이 연구되어 왔다. 수직 분할의 대표적인 응 용 예로는 중앙 집중 시스템에서의 파일 분할, 분산 데이터베이스에서의 데이터 분산, 메모 리 계층사이의 데이터 분할 등이 있다. 일반적으로 수직 분할 알고리즘은 모든 유용한 단편 들의 생성과 임의 분할 지원 등의 두가지 기능을 효율적으로 지원할 수 있어야 한다. 그러 나, 기존의 제안된 방법들은 대부분 첫 번째 기능에 중점을 두고 있어 임의 분할 기능을 지 원하는데 많은 제한이 있다. 그리고 수직 분할 알고리즘에서 데이터 속성들이 포함될 단편 을 결정할 때 기본적으로 모호성 문제를 가지고 있기 때문에 이에 대한 효과적인 처리가 필 요하다. 본 논문에서는 퍼지 이론에 기반한 효율적인 수직 $\alpha$-분할 알고리즘을 제안한다. 이 방법은 퍼지 그래프 이론을 바탕으로 수직 분할에서의 모호성 문제를 해결하여 복잡한 수학적 계산 없이 모든 유용한 단편들을 생성할 수 있다. 또한, 범용 임의 분할 기능도 효과 적으로 지원할 수 있다.

The concept of vertical partitioning has been discussed so far in an objective of improving the performance of query execution and system throughput. It can be applied to the areas where the match between data and queries affects performance, which includes partitioning of individual files in centralized environments, data distribution in distributed databases, dividing data among different levels of memory hierarchies, and so on. In general, a vertical partitioning algorithm should support n-ary partitioning as well as a globally optimal solution for the generation of all meaningful fragments. Most previous methods, however, have some limitations to support both of them efficiently. Because the vertical partitioning problem basically includes the fuzziness property, the proper management is required for the fuzziness problem. In this paper we propose an efficient vertical $\alpha$-partitioning algorithm which is based on the fuzzy theory. The method can not only generate all meaningful fragments but also support n-ary partitioning without any complex mathematical computations.

키워드

참고문헌

  1. M. Tamer Ozsu and Patrick Valduriez, Principles of Distributed Database Systems, Prentice Hall, 1999
  2. Shamkant Navathe, Stefano Ceri, Gio Wiederhold, and Jinglie Dou, 'Vertical Partitioning Algorithms for Database Design,' ACM Transactions on Database Systems, Vol. 9, No. 4, pp.680-710, December, 1984 https://doi.org/10.1145/1994.2209
  3. Shamkant B. Navathe and Minyoung Ra, 'Vertical Partitioning for Database Design: A Graphical Algorithm,' ACM SIGMOD, pp.440-450, 1989 https://doi.org/10.1145/66926.66966
  4. C. Meghini and C. Thanos, 'The Complexity of Operations on a Fragmented Relation,' ACM Transactions on Database Systems, Vol. 16, No. 1, pp.56-87, March, 1991 https://doi.org/10.1145/103140.103143
  5. Douglas W. Cornell and Philip S.Yu, 'An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases,' IEEE Transactions on Software Engineering, Vol. 16, No. 2, pp.248-258, February, 1990 https://doi.org/10.1109/32.44388
  6. 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, pp.804-812, August, 1993 https://doi.org/10.1109/32.238583
  7. Vasanth Balasundaram, Geoffrey Fox, Ken Kennedy, and Ulrich Kremer, 'An Interactive Environment for Data Partitioning and Distribution,' In the proceed- ings of the Fifth Distributed Memory Computing Conference, pp.1160-1170, 1990
  8. Domenico Sacca and Gio Wiederhold, 'Database Partitioning in a Cluster of Processors,' ACM Transactions on Database Systems, Vol. 10, No. 1, pp.29-56, March, 1985 https://doi.org/10.1145/3148.3161
  9. 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, pp.15-21, 1996 https://doi.org/10.1109/DEXA.1996.558266
  10. San-Yih Hwang and Chi-Ten Yang, 'Component and Data Distribution in a Distributed Workflow Management System,' In the proceedings of IEEE Software Engineering Conference, pp.244-251, 1998 https://doi.org/10.1109/APSEC.1998.733726
  11. 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
  12. 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, pp.993-1009, September, 1972
  13. Michael Hammer and Bahram Njamir, 'A Heuristic Approach to Attribute Partitioning,' ACM SIGMOD, pp.93-101, 1979 https://doi.org/10.1145/582095.582110
  14. Stephen P. Hufnagel and James C. Browne, 'Performance Properties of Vertically Partitioned Object-Oriented Systems,' IEEE Transactions on Software Engineering, Vol. 15, No. 8, pp.935-946, August, 1989 https://doi.org/10.1109/32.31351