Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / arun yadav
A hash table, or a hash map, is a data structure that
associates keys with values. The primary operation it
supports efficiently is a lookup: given a key (e.g. a
person's name), find the corresponding value (e.g. that
person's telephone number). It works by transforming the
key using a hash function into a hash, a number that is
used as an index in an array to locate the desired location
("bucket") where the values should be.
| Is This Answer Correct ? | 17 Yes | 5 No |
Post New Answer View All Answers
Define magic tables in sql server?
What is the difference between sql server 2000 object owner and sql server 2005 schema? : sql server database administration
what’s the difference between Covering Indexes and Clustered Indexes ? how to use clustered index small ?
Explain where clause?
Why are you getting errors when creating a new odbc dsn?
How to store and query spatial data?
What are the types of ssrs?
How can you control the amount of free space in your index pages?
How do you create a clustered index?
Is null vs coalesce?
What are the differences between “row_number()”, “rank()” and “dense_rank()”?
Why does sql studio use a single registered database repository? : sql server management studio
How to recover from sql injection? : sql server security
What is the difference between functions and stored procedures?
List out the different types of locks available in sql server?
