ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A Study of Index Structures for Main Memory Database Management Systems
Source Very Large Data Bases archive
Proceedings of the 12th International Conference on Very Large Data Bases table of contents
Pages: 294 - 303  
Year of Publication: 1986
ISBN:0-934613-18-4
Authors
Publisher
Morgan Kaufmann Publishers Inc.  San Francisco, CA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 45
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
[Amma85] A. Ammann, M. Hanrahan and R. Krishnamurthy, Design of a Memory Resident DBMS, Proc. IEEE COMPCON, San Francisco, February 1985.
3
4
5
6
 
7
[Fish86] M. Fishetti, Technology '86: Solid State, IEEE Spectrum 23,1 (January 1986).
8
 
9
 
10
[Knut73] Donald E. Knuth: The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley 1973.
 
11
[Lars80] Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232.
 
12
13
 
14
[Lela85] M. Leland and W. Roome, The Silicon Database Machine, Proc. 4th Int. Workshop on Database Machines, Grand Bahama Island, March 1985.
15
 
16
[Litw80] Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223.
 
17
18
19
 
20
[Warr81] David H. D. Warren: Efficient Processing of Interactive Relational Data Base Queries expressed in Logic. VLDB 1981: 272-281.
 
21

CITED BY  45
Collaborative Colleagues:
Tobin J. Lehman: colleagues
Michael J. Carey: colleagues