| 
|
QuoteRef: litwW10_1980
topics >
all references >
ThesaHelp:
references i-l
ThesaHelp:
ACM references f-l
Topic:
adaptive hash table
Topic:
concurrent operations
Reference
Litwin, W., "Linear hashing : a new tool for file and table addressing", Proceedings Very Large Data Bases, Sixth International Conference , IEEE, ACM, Canadian Information Processing Society, October 1980, pp. 212-223. Google
abstract ;;Quote: dynamic, linear hashing; 1.7 accesses per record while maintaining an 80% load
214 ;;Quote: linear hashing: no tables; split buckets in a linear order, as needed; use overflow buckets
222 ;;Quote: linear hashing is simpler than trees, much faster, easier locking for concurrency control
ThesaHelp: references i-l (342 items)
ThesaHelp: ACM references f-l (241 items)
Topic: adaptive hash table (19 items)
Topic: concurrent operations (22 items)