JDK-6996604 : Use more efficient (not linear) data structure for searching buckets in SymbolTable
  • Type: Enhancement
  • Component: hotspot
  • Sub-Component: runtime
  • Affected Version: 7
  • Priority: P3
  • Status: Closed
  • Resolution: Won't Fix
  • OS: generic
  • CPU: generic
  • Submitted: 2010-11-01
  • Updated: 2014-01-16
  • Resolved: 2014-01-16
Related Reports
Relates :  
JDK-8027476 - Improve performance of Stringtable unlink
Description
The buckets in a Hashtable use a linear list for maintaining entry
that have the same hash.  Searching for an entry in a bucket can
be more efficient with a different data structure.
Comments
We won't fix this - there is some concurrent unlinking for GC now implemented and there are symbol table resizing flags, and perhaps automatic resizing based on bucket length.
16-01-2014