Database Performance Optimization –A Rough Set Approach

Full Text (PDF, 299KB), PP.48-53

Views: 0 Downloads: 0


M. Phani Krishna Kishore 1,* Leelarani Ch. 1 Aditya. P. V. S. S. 1

1. Department of Information Technology, GVP College of Engineering (Autonomous), Visakhapatnam, India

* Corresponding author.


Received: 5 Sep. 2014 / Revised: 3 Nov. 2014 / Accepted: 11 Dec. 2014 / Published: 8 Feb. 2015

Index Terms

Database Management Systems, Rough Sets And Data Mining


As the sizes of databases are growing exponentially, the optimal design and management of both traditional database management systems as well as processing techniques of data mining are of significant importance. Several approaches are being investigated in this direction. In this paper a novel approach to maintain metadata based on rough sets is proposed and it is observed that with a marginal changes in buffer sizes faster query processing can be achieved.

Cite This Paper

Phani Krishna Kishore. M, Leelarani Ch., Aditya. P. V. S. S., "Database Performance Optimization–A Rough Set Approach", International Journal of Information Technology and Computer Science(IJITCS), vol.7, no.3, pp.48-53, 2015. DOI:10.5815/ijitcs.2015.03.07


[1]Rayne Chen, T.Y. Lin, “Supporting rough set theory in very large databases using Oracle”, RDBMS, 0-7803-3687-9/9601996 IEEE, pp.332-337Z. Pawlak. Rough sets, “Theoretical aspects of reasoning about data”, Kluwer, 1991.

[2]Rasha Osman, William J. Knottenbelt, “Database system performance evaluation models: A survey”, Performance Evaluation 69 (2012) 471–493.

[3]Fares N. Almari, PavolZavarsky, Ron Ruhl, Dale Lindskog, Amer Aljaedi, “Performance Analysis of Oracle Database in Virtual Environments” , Proceedings of the 26th International Conference on Advanced Information Networking and Applications Workshops, 2012,pp.1238-1245.

[4]David Taniar, “High Performance Database Processing”, Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications, 2012, pp-6.

[5]Taniar, C. H. C. Leung, W. Rahayu, and S. Goel, “High Performance Parallel Database Processing and Grid Databases”, John Wiley & Sons 2008.

[6]T. Kramberger, D. Cafuta, I. Dodig, “Database System Performance in Correlation with Different Storage File Systems”, MIPRO-2012, May 21-25, 2012, Opatija, Croatia,913-918.

[7]Xiaohua Tony Hu, T. Y. Lin, Jianchao Han, “A New Rough Sets Model Based on Database Systems”, Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Lecture Notes in Computer Science Volume 2639, 2003, pp. 114-121.

[8]Ślęzak D., Wróblewski J., Eastwood V., Synak P, “Bright house: An Analytic Data Warehouse for Ad-hoc Queries.” Proc. of VLDB 2008, pp. 1337 - 1345. 2008.

[9]Srinivas K G and Jagadish M, Venugopal K R, L M Patnaik, “ Data Mining Query Processing Using Sets and Genetic Algorithms”, Proceedings of the 2007 IEEE symposium on Computational Intelligence and Data Mining (CIDM2007). 

[10]Altigran S. da Silva, Alberto H. F. Laender, Marco A. Casanova, “An approach to maintaining optimized relational representations of entity-relationship schemas”, Conceptual Modeling - ER '96, Lecture Notes in Computer Science Volume 1157, 1996, pp. 292-308. 

[11]T. Apaydin, G. Canahuate, H. Ferhatosmanoglu, A.S.Tosun, “Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps”,. VLDB 2006: 846-857.

[12]Z. Pawlak. Rough sets: “Theoretical aspects of reasoning about data”, Kluwer, 1991.

[13]Z. Pawlak, A. Skowron. “Rudiments of rough sets”, Information Sciences 177(1): 3-27, 2007

[14]Xin Wang, Shuyi Wang, Pufeng Du, Zhiyong Feng, “CHex: An Efficient RDF Storage and Indexing Scheme for Column-Oriented Databases”, IJMECS, vol.3, no.3, pp.55-61, 2011.

[15]Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav, “Mathematical Framework for A Novel Database Replication Algorithm” , IJMECS, vol.5, no.9,pp.1-10,2013.DOI: 10.5815/ijmecs.2013.09.01.