Evaluating Query Result Significance in Databases via Randomizations

Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using relational queries. As an example, in the Internet Movie Database (IMDb) a query can be used to check whether the average rank of action movies is higher than the average rank of drama movies. We consider the problem of assessing whether the results returned by such a query are statistically significant or just a random artifact of the structure in the data. Our approach is based on randomizing the tables occurring in the queries and repeating the original query on the randomized tables. It turns out that there is no unique way of randomizing in multi-relational data. We propose several randomization techniques, study their properties, and show how to find out which queries or hypotheses about our data result in statistically significant information and which tables in the database convey most of the structure in the query. We give results on real and generated data and show how the significance of some queries vary between different randomizations.

[1]  Heikki Mannila,et al.  Randomization methods for assessing data analysis results on real-valued matrices , 2009 .

[2]  Yuguo Chen,et al.  Sequential Monte Carlo Methods for Statistical Analysis of Tables , 2005 .

[3]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[4]  P. Good,et al.  Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses , 1995 .

[5]  Rajeev Motwani,et al.  Beyond Market Baskets: Generalizing Association Rules to Dependence Rules , 1998, Data Mining and Knowledge Discovery.

[6]  J. Besag,et al.  Generalized Monte Carlo significance tests , 1989 .

[7]  Jaideep Srivastava,et al.  Selecting the right interestingness measure for association patterns , 2002, KDD.

[8]  J. Besag,et al.  Sequential Monte Carlo p-values , 1991 .

[9]  Y. Benjamini,et al.  Controlling the false discovery rate: a practical and powerful approach to multiple testing , 1995 .

[10]  Aristides Gionis,et al.  Assessing data mining results via swap randomization , 2007, TKDD.

[11]  S. Holm.  A Simple Sequentially Rejective Multiple Test Procedure , 1979 .

[12]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[13]  G. Casella,et al.  Statistical Inference , 2003, Encyclopedia of Social Network Analysis and Mining.

[14]  Julian Besag,et al.  Markov Chain Monte Carlo Methods for Statistical Inference , 2004 .

[15]  David Hinkley,et al.  Bootstrap Methods: Another Look at the Jackknife , 2008 .

[16]  Oege de Moor,et al.  Type inference for datalog and its application to query optimisation , 2008, PODS.

[17]  Dan Suciu,et al.  Query evaluation with soft-key constraints , 2008, PODS.

[18]  Yung-Pin Chen,et al.  An Application of Markov Chain Monte Carlo to Community Ecology , 2003, Am. Math. Mon..

[19]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[20]  Geoffrey I. Webb.  Discovering Significant Patterns , 2007, Machine Learning.