Constant-time query processing

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 60-69

  Raman, Vijayshankar ^a   Swart, Garret ^a   Qiao, Lin ^a   Reiss, Frederick ^a   Dialani, Vijay ^a   Kossmann, Donald ^b   Narang, Inderpal ^a   Sidle, Richard ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATION; DATA COMPRESSION; QUERY PROCESSING; TECHNOLOGY; TUNING;

AD-HOC QUERYING; COMPRESSION SCHEMES; CURRENT SYSTEMS; DATA ENGINEERING; EXPERIMENTAL STUDIES; INTERNATIONAL CONFERENCES; L2 CACHE; MATERIALIZED VIEWS; QUERY PERFORMANCES; QUERY PROCESSORS; RESPONSE TIMES; SIMD FASHION; SKEWED DATA; SQL QUERIES;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 52649097915     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497414     Document Type: Conference Paper

References (17)

1. B.Bhattacharjee, S. Padmanabhan, T. Malkemus, T. Lai, L. Cranston, and M. Huras. Efficient Query Processing for Multi-Dimensionally Clustered Tables in DB2. In VLDB, 2003.
2. Minimal Perfect Hashing .http://www.burtleburtle.net/bob/hash/perfect. html.
3. Z. Czech, G. Havas, and B. Majewski. An Optimal Algorithm for Generating Minimal Perfect Hash Functions. IPL, 43(5), 1992.
4. A. Holloway, V. Raman, G. Swart, and D. DeWitt. How to Barter Bits for Chronons: Compression and Bandwidth Tradeoffs for Database Scans. In SIGMOD, 2007.
5. D. Huffman. A method for construction of minimum-redundancy codes. In Proceedings of I.R.E., 1952.
6. D. Knuth. In The Art of Computer Programming, v3, 1973.
7. H. F. Korth, G. M. Kuper, J. Feigenbaum, A. van Gelder, and J. D. Ullman, SYSTEM/U: a database system based on the universal relation assumption. TODS, 9(3), 1984.
8. T. Legler, W. Lehner, and A. Ross. Data Mining with the SAP Netweaver BI Accelerator. In VLDB, 2006.
9. R. MacNicol and B. French. Sybase IQ Multiplex - Designed for analytics. In VLDB, 2004.
10. P. O'Neil, B. O'Neil, and X. Chen. The Star Schema Benchmark (SSB) (Preprint), January 2007. http://www.cjs.umb.edu/~ponell/StarSehemaB.PDF.
11. R. Pagh and F. Rodler. Cuckoo hashing. J. Algorithms, 51(2), 2004.
12. V. Raman and G. Swart. Entropy Compression of Relations and Querying of Compressed Relations. In VLDB, 2006.
13. K. Ross. Efficient Hash Probes on Modern Processors, In ICDE, 2007.
14. M. Stonebraker, D. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. O'Neil, P. O'Neil, A. Rasin, N. Tran, and S. Zdonik, C-Store: a column-oriented DBMS. In VLDB, 2005.
15. T. Westmann, D. Kossmann, S. Helmer, and G. Moerkotte. The Implementation and Performance of Compressed Databases. SIGMOD Record, 29(3), 2000.
16. M. Zukowski, S. Heman, and P. Boncz. Architecture-conscious hashing. In DaMoN, page 6, 2006.
17. M. Zukowski, S. Heman, N. Nes, and P. Boncz, Super-Scalar RAM-CPU Cache Compression. In ICDE, 2006.