This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Trends in Databases: Reasoning and Mining
May/June 2001 (vol. 13 no. 3)
pp. 426-438

Abstract—We propose a temporal dependency, called trend dependency (TD), which captures a significant family of data evolution regularities. An example of such regularity is “Salaries of employees generally do not decrease.” TDs compare attributes over time using operators of $\{<,=,>,\leq,\geq,\ne\}$. We define a satisfiability problem that is the dual of the logical implication problem for TDs and we investigate the computational complexity of both problems. As TDs allow expressing meaningful trends, “mining” them from existing databases is interesting. For the purpose of TD mining, TD satisfaction is characterized by support and confidence measures. We study the problem $\rm TDMINE$: given a temporal database, mine the TDs that conform to a given template and whose support and confidence exceed certain threshold values. The complexity of $\rm TDMINE$ is studied, as well as algorithms to solve the problem.

[1] J. Chomicki, “Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding,” ACM Trans. Database Systems, vol. 20, no. 2, pp. 148–186, June 1995.
[2] J. Chomicki and D. Niwinski, “On the Feasibility of Checking Temporal Integrity Constraints,” J. Computer and System Sciences, vol. 51, no. 3, pp. 523–535, 1995.
[3] C.S. Jensen, R.T. Snodgrass, and M.D. Soo, “Extending Existing Dependency Theory to Temporal Databases,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 4, pp. 563–582, July/Aug. 1996.
[4] X. Wang, C. Bettini, A. Brodsky, and S. Jajodia, "Logical Design for Temporal Databases with Multiple Granularities," ACM Trans. Database Systems, to appear, 1997.
[5] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACM-SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
[6] J. Wijsen, “Reasoning About Qualitative Trends in Databases,” Information Systems, vol. 23, no. 7, pp. 469–493, 1998.
[7] J. Wijsen and R. Meersman, “On the Complexity of Mining Temporal Trends,” Proc. 1997 ACM SIGMOD Int'l Workshop Research Issues on Data Mining and Knowledge Discovery, R. Ng, ed., Technical Report 97-07, The Univ. of British Columbia, Dept. of Computer Science, pp. 77–84. 1997.
[8] J. Wijsen, “Temporal FDs on Complex Objects,” ACM Trans. Database Systems, vol. 24, no. 1, pp. 127–176, 1999.
[9] V. Vianu, "Dynamic Functional Dependencies and Database Aging," J. ACM, vol. 34, no. 1, pp. 28-59, Jan. 1987.
[10] Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series, A.U. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass eds., Redwood, Calif.: Benjamin/Cummings, 1993.
[11] J. Clifford, A. Crocker, and A. Tuzhilin, “On Completeness of Historical Relational Query Languages,” ACM Trans. Database Systems, vol. 19, no. 1, pp. 64–116, 1994.
[12] M. Baudinet, J. Chomicki, and P. Wolper, “Constraint-Generating Dependencies,” J. Computer and System Sciences, vol. 59, no. 1, pp. 94–115, 1999.
[13] S. Ginsburg and R. Hull, “Order Dependency in the Relational Model,” Theoretical Computer Science, vol. 26, pp. 149–195, 1983.
[14] J. Han, Y. Cai, and N. Cercone, "Data-Driven Discovery of Quantitative Rules in Relational Databases," IEEE Trans. Knowledge and Data Eng., pp. 29-40, Feb. 1993.
[15] T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, Mining Optimized Association Rules for Numeric Attributes Proc. 1996 ACM Symp. Principles of Database Systems, pp. 182-191, 1996.
[16] X. Hu and N. Cercone, “Mining Knowledge Rules from Databases: A Rough Set Approach,” Proc. Int'l Conf. Data Eng., pp. 96–105, 1996.
[17] D. Cheung, J. Han, V. Ng, and C.Y. Wong, Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique Proc. 1996 Int'l Conf. Data Eng., pp. 106-114, Feb. 1996.
[18] S. Ginsburg and R. Hull, “Sort Sets in the Relational Model,” J. ACM, vol. 33, pp. 465–488, 1986.
[19] J. Han and Y. Fu, “Discovery of Multiple-Level Association Rules from Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 420-431, Sept. 1995.
[20] R. Srikant and R. Agrawal, “Mining Quantitative Association Rules in Large Relational Tables,” Proc. 1996 ACM-SIGMOD Int'l Conf. Management of Data, pp. 1-12, June 1996.
[21] J. Wijsen, R.T. Ng, and T. Calders, “Discovering Roll-Up Dependencies,” Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 213–222, 1999.
[22] J. Kivinen and H. Mannila, “Approximate Inference of Functional Dependencies from Relations,” Theoretical Computer Science, vol. 149, pp. 129–149, 1995.

Index Terms:
Temporal database, knowledge discovery, data mining, functional dependency.
Citation:
Jef Wijsen, "Trends in Databases: Reasoning and Mining," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 3, pp. 426-438, May-June 2001, doi:10.1109/69.929900
Usage of this product signifies your acceptance of the Terms of Use.