Associative Array Data Structure

From GM-RKB
(Redirected from Dictionary DS)
Jump to navigation Jump to search

An Associative Array Data Structure is a collection data structure that facilitates the storage, update, and retrieval of key-value pairs with the same key.



References

2016

  1. Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994. "Dynamic Perfect Hashing: Upper and Lower Bounds". SIAM J. Comput. 23, 4 (Aug. 1994), 738-761.

    http://portal.acm.org/citation.cfm?id=182370

  2. , pp. 597–599.

2013

  • http://rosettacode.org/wiki/Associative_array
    • An associative array is a collection indexed by arbitrary data types, not just small integers. Whereas an array is typically implemented as many same-sized items stored in a contiguous block of memory, an associative array must be implemented via a more complex data structure, such as a hash table, a list, or some other type of map.

      The terminology and semantics of these vary among different programming languages. For example in Perl and Ruby they are called “hashes” (from abbreviating “hash table”, the underlying implementation) while in Python, Objective-C, and Smalltalk they are called “dictionaries” (by analogy to the normal English usage of the term: an indexed reference by which keys (words) are associated with values (definitions)). In Lua they are called “tables”. In Java, C++, and Go they are called “maps”.

      The semantics differ as well. While all of these allow the programmer to associate some sort of key with some sort of value they can differ considerably in how they evaluate the key and what sorts of values can be stored.

      For example in awk and Perl the keys are evaluated (as “scalars” in Perl terminology). Thus the the keys "1" (a string) and 1 (an integer) and 1.0 (a real or floating point number) would all evaluate into equivalent keys. By contrast these would each be distinct in Python. In a Python dictionary any immutable object (strings, integer, floats) and any object/class which implements the __hash__ special method can be used as a key. Values can be references to any objects (including functions, classes, class methods which are all "first class objects" in that language). In Lua, a table is a complex data structure which can be used to implement arrays, objects and associative arrays (integer key values are implicitly treated like indices into a virtual array, those with values that reference functions are methods, those which reference other types of objects are attributes or members).

      Associative arrays are used as the underlying data structure for objects in a number of languages. Python objects normally have a visible __dict__ attribute by which its methods and other attributes can be accessed indirectly. PHP objects can be cast into associative arrays, and vice versa, with the keys and values corresponding to property names and values of the object. Perl objects are references of (usually) hashes. And (as described above) Lua objects are implemented as tables (functions and other objects are “first class objects” which an be assigned to keys and passed around as arguments, as with Python). Similarly, in JavaScript the concepts of associative array and object are the same, since JavaScript lacks a separate "associative array" type, and object attributes can be accessed using subscript operator with the attribute name as a string.

2010

2009