Vertical fragmentation in databases using data-mining technique

International Journal of Data Warehousing and Mining

Volumn 4, Issue 3, 2008, Pages 35-53

  Gorla, Narasimhaiah ^a   Betty, Pang Wing Yan ^b  

^a AMERICAN UNIVERSITY OF SHARJAH   (United Arab Emirates)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Association rules; Data mining; Database performance; Design methodologies; Information systems; Physical database design; Vertical partitioning

Indexed keywords

ASSOCIATION RULES; HEURISTIC METHODS; INFORMATION SYSTEMS; OBJECT-ORIENTED DATABASES; RELATIONAL DATABASE SYSTEMS;

DATABASE PERFORMANCE; DESIGN METHODOLOGY; EXHAUSTIVE ENUMERATION; FUTURE RESEARCH DIRECTIONS; OBJECT ORIENTED DATABASE DESIGNS; PHYSICAL DATABASE; RELATIONAL DATABASE; VERTICAL PARTITIONING;

DATA MINING;

EID: 47349098800     PISSN: 15483924     EISSN: 15483932     Source Type: Journal    
DOI: 10.4018/jdwm.2008070103     Document Type: Article

References (41)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., & Verkamo, A. I. (1996). Fast discovery of association rules. In A dvances in Knowledge Discovery and Data Mining. AAAI/MIT Press.
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile.
3. Ailamaki, A., Dewitt, D. J., Hill, M. D., & Skounakis, M. (2001). Weaving relations for cache performance. In Proceedings of the 27Th VLDB Conference.
4. Bagui, S. (2006). An approach to mining crime patterns. International Journal of Data Warehousing and Mining, 2(1), 50-80.
5. Ceri, S., Navathe, S., & Wiederhold, G. (1983). Distribution design of logical database schemas. IEEE Transactions on Software Engineering, SE-9(4).
6. Chen, A S., Han, J., & Yu, P. S. (1996). Data mining: An overview from database perspective. IEEE Transactions on Knowledge and Data Engineering, 8(6), 866-883.
7. Chen, Y., Dehne, Y., Eavis, T., & Rau-Chaplin, A. (2006). Improved data partitioning for building large ROLAP data cubes in parallel. International Journal of Data Warehousing and Mining, 2(1), 1-26.
8. Cheng, C-H., Lee, W-K., & Wong, K-F. (2002). A genetic algorithm-based clustering approach for database partitioning. IEEE Transactions on Systems, Man, and Cybernetics, 32(3), 215-230.
9. Chu, W. W. & Ieong, I. T. (1993). A transaction-based approach to vertical partitioning for relational database systems. IEEE Transaction on Software Engineering, 19(8), 804-812.
10. Cornell, D. W. & Yu, P. S. (1990). An effective approach to vertical partitioning for physical design of relational databases. IEEE Transactions on Software Engineering, 16(2), 248-258.
11. De, P., Park, J. S., & Pirkul, H. (1988). An integrated model of record segmentation and access path selection for databases. Information Systems, 13(1), 13-30.
12. Ezeife, C. I. (2001). Selecting and materializing horizontally partitioned warehouse views. Data and Knowledge Engineering, 36, 185-210.
13. Frawley, W. J., Piatetsky-Shapiro, G., & Matheus, C. J. (1991). Knowledge discovery in database: An overview. In G. Piatetsky-Shapiro & W. J. Frawley (Eds.), Knowledge discovery databases. AAAI /MIT Press.
14. Fung, C-W., Karlapalem, K., & Li, Q. (2002). An evaluation of vertical class partitioning for query processing in object-oriented databases. IEEE Transactions on Knowledge and Data Engineering, 14(5), 1095-1118.
15. Furtado, C., Lima, A., Pacitti, E., Valduriez, P., & Mattoso, M. (2005). Physical and virtual partitioning in OLAP database cluster. In Proceedings of the 17th International Symposium on Computer Architecture and High Performance Computing (pp. 143-150).
16. Gorla, N. (2001). An object-oriented database design for improved performance. Data and Knowledge Engineering, 37, 117-138.
17. Gorla, N., & Boe, W. (1990). Effect of schema size on fragmentation design in multirelational databases. Information Systems, 15, 291-301.
18. Hammer, M., & Niamir, B. (1979). A heuristic approach to attribute partitioning. ACM SIGMOD International Conference on Management of Data.
19. Han, J., & Fu, Y. (1999). Mining multiple-level association rules in large databases. IEEE Transactions on Knowledge and Data Engineering, 11(5), 798-805.
20. Hoffer, J. A. (1976). An integer programming formulation of computer database design problems. Information Science, 11, 29-48.
21. Hoffer, J. A., & Severance, D. G. (1975). The use of cluster analysis in physical data base design. International Conference on Very large Databases.
22. Labio, W. J., Quass, D., & Adelberg, B. (1997). Physical database design for data warehouses. In Proceedings of the IEEE Conference on Data Engineering (pp. 277-288).
23. March, S. T. (1983). Techniques in structuring database r ecords. ACM Computing Surveys, 15(1).
24. March, S. T., & Rho, S. (1995). Allocating data and operations to nodes in distributed database design. IEEE Trans. on Knowledge and Data Engineering, 7(2).
25. McCormick, W. T., Jr., Schweitzer, P. J., & White, T. W. (1972). Problem decomposition and data organization by a clustering -technique. Operations Research, 20(5), 993-1009.
26. Navathe, S., Ceri, S., Wiederhold, G., & Dou, J. (1984). Vertical partitioning algorithms fordatabase design. ACM Transactions on. Database Systems.
27. Navathe, S., & Ra, M. (1989). Vertical partitioning for database design: A graphical algorithm. In Proceedings of the 1989 ACM SIGMOD/
28. Ng, V., Gorla, N., Law, D.M., & Chan, C. K. (2003). Applying genetic algorithms in database partitioning. In Proceedings of the 2003 ACM Symposium on Applied Computing (SAC) (pp. 544-549).
29. Ozsu, M., & Valduriez, P. (1996). Principles of distributed database systems. Prentice Hall.
30. Park, J-S., Chen, M-S., & Yu, P. S. (1995). Mining association rules with adjustable accuracy (EBM research report).
31. Ramamurthy, R., Dewitt, D. J., & Su, Q. (2002). A case for fractured mirrors. In Proceedings of the 28th VLDB Conference.
32. Song, S. K., & Gorla, N. (2000). A genetic algorithm for vertical fragmentation and access path selection. The Computer Journal, 45(1), 81-93.
33. Sung, S. Y., Li, Z., Tan, C. L., & Ng, P. A. (2003). Forecasting association rules using existing data sets. IEEE Transactions on Knowledge and Data Engineering, 15(6), 1448-1459.
34. Tjioe, H. C., &Taniar, D. (2005). Mining association rules in data warehouse. International Journal of Data Warehousing and Mining, 1(3), 28-62.
35. Tzanis, G., & Berberidis, C. (2007). Mining for mutually exclusive items in transaction databases. International Journal of Data Warehousing and Mining, 3(3).
36. Yao, S. B. (1977). Approximating block access in data-base organization. Communications of the ACM, 20(4), 260-261.
37. Yen, S-J., & Chen, A. L. P. (2001). A graph-based approach for discovering various types of association rules. IEEE Transactions on Knowledge and Data Engineering, 12(5),839-845.
38. Yu, P. S., Chen, M. S., Heiss, H. U., & Lee, S. (1992). Workload characterization of relational database environments. IEEE Transactions of Software Engineering, 18(4), 347-355.
39. UCL (1999). Machine learning repository content summary. Retrieved February 8, 2008, from http://.www.ics.uci.edu/~mlearn/MLSummary.htm
40. Zaki, M. J. (2000). Scalable Algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372-390.
41. Zaki, M. J., & Hsiao, C-J. (2005). Efficient algorithms for mining closed itemsets and their lattice structures. IEEE Transactions on Knowledge and Data Engineering, 17(4), 462-478.