High-Performance Operations Using a Compressed Database Architecture

Computer Journal

Volumn 41, Issue 5, 1998, Pages 283-296

  Cockshott, W Paul ^a   Mcgregor, Douglas ^b   Wilson, John ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DATA COMPRESSION;

DATA INSERTION; DATA REPRESENTATION;

QUERY LANGUAGES;

EID: 0032288305     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/41.5.283     Document Type: Article

References (27)

1. Garcia-Molina, H. and Salem, K. (1992) Main memory database systems: an overview. IEEE Trans. Knowledge Data Eng., 4, 509-516.
2. Lehman, T. J., Shekita, E. J. and Cabrera, L. (1992) An evaluation of starburst's memory resident storage component. IEEE Trans. Knowledge Data Eng., 4, 555-566.
3. Pucheral, P., Thevenin, J. and Valduriez, P. (1990) Efficient main memory data management using DBGraph storage model. In Proc. 16th Int. Conf. on Very Large Databases, August, Brisbane, Australia, pp. 683-695. North-Holland, The Netherlands.
4. Goldstein, R. and Strnad, A. (1970) The MacAIMS data management system. In Proc. ACM SIGFIDET Workshop on Data Description and Access, November, Houston, TX, pp. 201-229.
5. Wang, C. J. and Lavington, S. J. (1991) SIMD parallelism for symbol mapping. In Delgado-Frias, J. F. and Moore, W. R. (eds), VLSI for Artificial Intelligence and Neural Networks, pp. 67-78, Plenum Press, New York, NY.
6. Cockshott, W. P., Cowie, A., Russell, G. and McGregor, D. (1993) Memory Resident Databases: Reliability, Compression and Performance. Research Report ARCH-11-93, Department of Computer Science, University of Strathclyde.
7. Rivest, R. (1976) Partial-match retrieval algorithms. SIAM J. Comput., 5, 19-50.
8. Fagin, R., Nievergelt, J., Pippenger, N. and Strong, H. R. (1979) Extensible hashing - a fast access method for dynamic files. ACM Trans. Database Syst., 4, 315-344.
9. Aho, A. and Ullman, J. (1979) Optimal partial-match retrieval when fields are independently specified. ACM Trans. Database Syst., 4, 168-179.
10. Lloyd, J. (1980) Optimal partial-match retrieval. BIT, 20, 406-413.
11. Lelewer, D. and Hirshberg, D. (1987) Data compression. ACM Comput. Surveys, 19, 261-296.
12. Ziv, J. and Lempel, A. (1978) Compression of individual sequences via variable rate coding. IEEE Trans. Inform. Theory, 24, 530-536.
13. Cockshott, W. P. (1993) Persistent objects in Turbo Pascal for Windows. J. Object Oriented Program., 6, 68-73.
14. Atkinson, M. P., Bailey, P., Chisholm, K. J., Cockshott, W. P. and Morrison, R. (1983) An approach to persistent programming. Comput. J., 26, 360-365.
15. Kilburn, T., Edwards, B. B. G., Lanigen, M. J. and Sunner, F. H. (1962) One-level storage system. Inst. Radio Eng. Trans., EC-11, 223-235.
16. Hepp, P. E. (1983) A DBS Architecture Supporting Coexisting Query Languages and Data Models. PhD Thesis, University of Edinburgh.
17. Knuth, D. E. (1973) The Art of Computer Programming Vol. 3: Sorting and Searching. Addison-Wesley, Reading, MA.
18. Benford, F. (1938) The law of anomalous numbers. In Proc. Am. Phil. Soc., 78, 551-572.
19. Hill, T. (1998) The first digit phenomenon. American Scientist, 86, 358-363.
20. Halloran, T. J. (1993) 'Magic Mirror on the Wall, Who's the Fastest Database of Them All?': A Survey of Database Benchmarks. Technical Report AFIT/EN-TR-93-5, US Air Force, ftp://archive.afit.af.mil/pub/techreports/tr-93-05.ps.
21. Boncz, P. A. and Kersten, M. L. (1995) Monet: an impressionist sketch of an advanced database system. In Proc. IEEE BIWIT Workshop, July, San Sebastian, Spain, pp. 240-251.
22. De Witt, D. J., Ghandeharizadeh, D., Schneider, D., Jauhari, R., Muralikrishna, M. and Sharma, A. (1987) A single user evaluation of the GAMMA database machine. In Proc. 5th Int. Workshop on Database Machines, October, Tokyo, Japan, pp. 370-386.
23. De Witt, D. J., Ghandeharizadeh, D., Schneider, D., Bricker, A., Hsiao, H. and Rasmussen, R. (1990) The GAMMA database machine project. IEEE Trans. Knowledge Data Eng., 2, 44-62.
24. Leland, M. D. P., and Roome, W. D. (1987) The silicon database machine: rational design and results. In Proc. 5th Int. Workshop on Database Machines, October, Tokyo, Japan, pp. 311-324.
25. Wischut, A. N., Floskstra, J. and Apers, P. M. G. (1992) Parallelism in a main memory DBMS: the performance of PRISMA/DB. In Proc. 18th Int. Conf. on Very Large Databases, August, Vancouver, Canada, pp. 521-532. North-Holland, The Netherlands.
26. Eich, M. H. (1987) MARS: The design of a main memory database machine. In Proc. 5th Int. Workshop on Database Machines, October, Tokyo, Japan, pp. 325-338.
27. Bitton, D., DeWitt, D., and Turbyfill, C. (1983) Benchmarking simple database operations. In Proc. 9th Int. Conf. on Very Large Databases, November, Florence, Italy, pp. 8-19.