OLAP Query Processing Algorithm Based on Relational Storage
暂无分享,去创建一个
[1] Stefan Berchtold,et al. High-dimensional index structures database support for next decade's applications (tutorial) , 1998, SIGMOD '98.
[2] Nick Roussopoulos,et al. An alternative storage organization for ROLAP aggregate views based on cubetrees , 1998, SIGMOD '98.
[3] Kyuseok Shim,et al. Including Group-By in Query Optimization , 1994, VLDB.
[4] O'NeilPatrick,et al. Improved query performance with variant indexes , 1997 .
[5] Andrea C. Arpaci-Dusseau,et al. High-performance sorting on networks of workstations , 1997, SIGMOD '97.
[6] Goetz Graefe,et al. Multi-table joins through bitmapped join indices , 1995, SGMD.
[7] Jeffrey F. Naughton,et al. On the Computation of Multidimensional Aggregates , 1996, VLDB.
[8] Shivakumar Venkataraman,et al. Cost-based optimization of decision support queries using transient-views , 1998, SIGMOD '98.
[9] Divesh Srivastava,et al. Answering Queries with Aggregation Using Views , 1996, VLDB.
[10] Patrick E. O'Neil,et al. Improved query performance with variant indexes , 1997, SIGMOD '97.
[11] Ramesh C. Agarwal,et al. A super scalar sort algorithm for RISC processors , 1996, SIGMOD '96.
[12] Goetz Graefe,et al. Sort versus Hash Revisited , 1994, IEEE Trans. Knowl. Data Eng..
[13] Goetz Graefe,et al. Query evaluation techniques for large databases , 1993, CSUR.
[14] C AgarwalRamesh. A super scalar sort algorithm for RISC processors , 1996 .