[1]GRUMBACH S,RAFANELLI M,TINININI L. Querying aggregate data[A].Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System[C].New York,NY,USA:ACM,1999.174-184.
[2]GRUMBACH S,TINININI L. On the content of materialized aggregate views[A]. Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System[C].New York,NY,USA:ACM,2000.47-57.
[3]COHEN S,NUTT W,SEREBRENIK A. Algorithms for rewriting aggregate queries using views[A]. Pro. Symposium on Advances in Databases and Information Systems[C].Prague,Czech Republic:ADBIS-DASFAA,2000.65-78.
[4]ABITEBOUL S,DUSCHKA O M. Complexity of answering queries using materialized views[A].Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System[C].New York,NY,USA:ACM,1998.254-263.
[5]CHAUDHURI S,DAS G,NARASAYYA V.A robust,optimization-based approach for approximate answering of aggregate queries[A]. ACM SIGMOD[C].New York,NY, USA:ACM SIGMOD,2001.295-306.
[6]ALON N,MATIAS Y,SZEGEDY M. The space complexity of approximating the frequency moments[J]. Journal of Computer and System Sciences,1999,58(1):137-147.
[7]CORMODE G,INDYK P,KOUDAS N,et al. Fast mining of tabular data via approximate distance computations[A]. IEEE ICDE[C].San Jose,California,USA:IEEE,2002.605-616.
|