Francesco M. Malvestuto Papers on DiSC'04 Auditing Sum Queries Customized Answers to Summary Queries via Aggregate Views Publications Note: Links lead to the DBLP on the Web. Francesco M. Malvestuto Francesco M. Malvestuto, Mauro Mezzini : Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type. Privacy in Statistical Databases 2004 : 353-365 Francesco M. Malvestuto, Elaheh Pourabbas : Customized Answers to Summary Queries via Aggregate Views. SSDBM 2004 : 193-202 Francesco M. Malvestuto, Mauro Mezzini : Auditing Sum Queries. ICDT 2003 : 126-142 Francesco M. Malvestuto, Marina Moscarini : Privacy in Multidimensional Databases. Multidimensional Databases 2003 : 310-360 Francesco M. Malvestuto: From Conditional Independences to Factorization Constraints with Discrete Random Variables. Ann. Math. Artif. Intell. 35 (1-4): 253-285 (2002) Francesco M. Malvestuto, Mauro Mezzini : A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph. SIAM J. Comput. 31 (5): 1438-1455 (2002) Francesco M. Malvestuto, Marina Moscarini : Decomposition of a hypergraph by partial-edge separators. Theor. Comput. Sci. 237 (1-2): 57-79 (2000) Francesco M. Malvestuto, Marina Moscarini : Computational Issues Connected with the Protection of Sensitive Statistics by Auditing Sum Queries. SSDBM 1998 : 134-144 Francesco M. Malvestuto: A Complete Axiomatization of Full Acyclic Join Dependencies. Inf. Process. Lett. 68 (3): 133-139 (1998) Francesco M. Malvestuto, Marina Moscarini : A Fast Algorithm for Query Optimization in Universal-Relation Databases. J. Comput. Syst. Sci. 56 (3): 299-309 (1998) Francesco M. Malvestuto: Query Processing in Probabilistic Data Bases. SEBD 1997 : 87-100 Francesco M. Malvestuto, Marina Moscarini : Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems. SSDBM 1996 : 12-21 Francesco M. Malvestuto, Marina Moscarini : A Fast Algorithm for Query Optimization in Universal Relation Databases. SEBD 1995 : 343-361 Francesco M. Malvestuto: Formal Theories of Probabilistic Dependency Models. WOCFAI 1995 : 241-252 Francesco M. Malvestuto: Statistical vs. Relational Reasoning about Join Dependancies. SEBD 1994 : 229-248 Francesco M. Malvestuto: Statistical versus Relational Join Dependencies. SSDBM 1994 : 64-73 Francesco M. Malvestuto: A Universal-Scheme Approach to Statistical Databases Containing Homogeneous Summary Tables. ACM Trans. Database Syst. 18 (4): 678-708 (1993) Francesco M. Malvestuto: A unique formal system for binary decompositions of database relations, probability distributions, and graphs. Inf. Sci. 59 (1-2): 21-52 (1992) Francesco M. Malvestuto, Milan Studený : Comment on "A unique formal system for binary decompositions of database relations, probability distributions, and graphs". Inf. Sci. 63 (1-2): 1-2 (1992) Francesco M. Malvestuto, Marina Moscarini , Maurizio Rafanelli : Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table. PODS 1991 : 252-258 Francesco M. Malvestuto, Marina Moscarini : Query Evaluability in Statistical Databases. IEEE Trans. Knowl. Data Eng. 2 (4): 425-430 (1990) Francesco M. Malvestuto, Marina Moscarini : Aggregate Evaluability in Statistical Databases. VLDB 1989 : 279-286 Francesco M. Malvestuto: A universal table model for categorical databases. Inf. Sci. 49 (1-3): 203-223 (1989) Francesco M. Malvestuto: The Derivation Problem for Summary Data. SIGMOD Conference 1988 : 82-89 Francesco M. Malvestuto, C. Zuffada : The Classification Problem with Semantically Heterogeneous Data. SSDBM 1988 : 157-176 Francesco M. Malvestuto: Answering Queries in Categorial Data Bases. PODS 1987 : 87-96 Francesco M. Malvestuto: Modelling Large Bases of Categorial Data With Acyclic Schemes. ICDT 1986 : 323-340 Francesco M. Malvestuto: Decomposing Complex Contingency Tables to Reduce Storage Requirements. SSDBM 1986 : 66-71 Francesco M. Malvestuto: Statistical treatment of the information content of a database. Inf. Syst. 11 (3): 211-223 (1986) Francesco M. Malvestuto: Theory of random observables in relational data bases. Inf. Syst. 8 (4): 281-289 (1983) 1 [ 25 ] [ 28 ] [ 30 ] 2 [ 9 ] [ 10 ] [ 11 ] [ 18 ] [ 19 ] [ 21 ] [ 23 ] [ 24 ] [ 27 ] 3 [ 29 ] 4 [ 11 ] 5 [ 12 ] 6 [ 6 ] ©2005 Association for Computing Machinery