Space efficient bitmap indexing
作者： Nick Koudas
关键词: Bitmap indexing 、 Bitmap index 、 Information retrieval 、 Computer science 、 Space (commercial competition)
摘要:
acm.org
sci-hub.se 参考文章(21)
Patrick E. O'Neil, Model 204 Architecture and Performance high performance transaction systems workshop. pp. 40- 59 ,(1987) , 10.1007/3-540-51085-0_42
Yannis E. Ioannidis, Universality of Serial Histograms very large data bases. pp. 256- 267 ,(1993)
G. Antoshenkov, Byte-aligned bitmap compression data compression conference. pp. 476- 476 ,(1995) , 10.1109/DCC.1995.515586
Nick Koudas, H. V. Jagadish, Torsten Suel, Kenneth C. Sevcik, Viswanath Poosala, S. Muthukrishnan, Optimal Histograms with Quality Guarantees very large data bases. pp. 275- 286 ,(1998)
Vivek R. Narasayya, Surajit Chaudhuri, An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server very large data bases. pp. 146- 155 ,(1997)
Richard Bellman, THE THEORY OF DYNAMIC PROGRAMMING Bulletin of the American Mathematical Society. ,vol. 60, pp. 503- 515 ,(1954) , 10.1090/S0002-9904-1954-09848-8
Chee-Yong Chan, Yannis E. Ioannidis, Bitmap index design and evaluation Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD '98. ,vol. 27, pp. 355- 366 ,(1998) , 10.1145/276304.276336
Dorit S. Hochba, Approximation Algorithms for NP-Hard Problems ,(1996)
Yannis E. Ioannidis, Viswanath Poosala, Balancing histogram optimality and practicality for query result size estimation international conference on management of data. ,vol. 24, pp. 233- 244 ,(1995) , 10.1145/223784.223841
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)