Key and Value Paired Data using Java Hash Table

This paper proposes use of a Java HashTable mechanism for Online Shopping Cart Application over the Web Application. A hash table is a data structure in java that can offer rapid storage and retrieval of data. Hash tables are extensively used to implement tables that associate a set of key and values, as they provide O(1), to perform operations such as query, insert and delete operations. A leading implementation for string keys is the cache conscious array hash table. However, at moderate collisions are quite frequent which not only increases the access time, but also decrease the performance in the deterministic. Due to this deterministic performance, the hash table degrades. In some systems, it is very difficult to keep the hash operations more deterministic. In recent trends, more research papers have been proposed, which employs a new and fast hash functions to implement hash tables and to avoid collisions.