Database algorithms for multiprocessor and very large memory systems
Conference
·
OSTI ID:5627804
Many recent computer designs exhibit two features which have been too expensive to exploit previously. The first, very large main memories, may allow significant portions of databases to be kept in main memory. The second, parallel processing, provides multiple processors to speed the operations on databases in memory. A recent paper by DeWitt et. al. discusses the effect of providing a very large main memory in a computer for database operations. This paper explores the algorithms appropriate for relational operations when large main memories and parallel processors are provided. 9 refs., 7 figs.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 5627804
- Report Number(s):
- UCRL-94333; CONF-860740-1; ON: DE86009406
- Country of Publication:
- United States
- Language:
- English
Similar Records
Main memory database algorithms for multiprocessors
Transposition algorithms on very large compressed databases
Multiprocessor algorithms for relational-database operators on hypercube systems
Technical Report
·
Sun Jun 01 00:00:00 EDT 1986
·
OSTI ID:7249634
Transposition algorithms on very large compressed databases
Conference
·
Sun Jun 01 00:00:00 EDT 1986
·
OSTI ID:5516750
Multiprocessor algorithms for relational-database operators on hypercube systems
Journal Article
·
Wed Oct 31 23:00:00 EST 1990
· Computer; (USA)
·
OSTI ID:5692940