Browse > Article
http://dx.doi.org/10.9717/kmms.2019.22.2.225

Database Segment Distributing Algorithm using Graph Theory  

Kim, Joong Soo (Dept. of Computer Engineering Andong National University)
Publication Information
Journal of Korea Multimedia Society / v.22, no.2, 2019 , pp. 225-230 More about this Journal
Abstract
There are several methods which efficiencies of database are uprise. One of the well-known methods is that segments of database satisfying a query was rapidly accessed and processed. So if it is possible to search completely parallel multiple database segment types which satisfy a query, the response time of the query will be reduced. The matter of obtaining CPS(Completely Parallel Searchable) distribution without redundancy can be viewed as graph theoretic problem, and the operation of ring sum on the graph is used for CPS. In this paper, the parallel algorithm is proposed.
Keywords
Database; Graph Theory; Parallel Algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 K. Sikic and O. Carugo, "Protein Sequence Redundancy Reduction: Comparison of Various Method," Bioinformation, Vol. 5, No. 6, pp. 234-239, 2010.   DOI
2 C. Hazirbas, J. Diebold, and M. Cremers, "Optimizing the Relevance-Redundancy Tradeoff for Efficient Semantic Segmentation," Proceeding of International Conference on Scale Space and Variational Methods in Computer Vision, pp. 243-255, 2015.
3 A.S. Oh and O.H. Kwon, "Database Construction for Design of the Components Software by Using an Incremental Update Propagation," Journal of Korea Multimedia Society, Vol. 6, No. 4, pp. 583-593, 2003.
4 S. Ghosh, “Distribution a Database with Logical Associations on a Computer Network for Parallel Searching,” IEEE Transactions on Software Engineering, Vol. SE-2, No. 2, pp. 106-113, 1976.   DOI
5 B. Srinivasan and R. Sankar, “Algorithms to Distribute a Database for Parallel Searching,” IEEE Transactions on Software Engineering, Vol. 7, No. 1, pp. 112, 1981.   DOI
6 N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall, New Jersey, 1974.
7 J.L. Gros and J .Yellen, Graph Theory and Its Application, CRC Press, Boca Raton, 2005.
8 P.A. Berstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Data-Base Systems, Addison-Wesley, Boston, 1987.
9 P.A. Berstein and E. Newcomer, Principles of Transaction Processing, Morgan Kaufmann, San Francisco, 1996.
10 T.W. Ling, M.L. Lee, and G. Dobbie, Semistructured Database Design, Springer, Berlin, 2005.
11 D.B. Little, S, Farmer, and Q. El-Hilali, Digital Data Integrity : The Evolution from Passive Protection to Active Management, John Wiley and Sons ltd, Symantec Corporation, Wiley, 2007.
12 D. Dittrich and B. Seeger, "Data Redundancy and Duplicate Detection in Spatial Join Processing," Preceeding of International Conference on Data Engineering, pp. 535, 2000.