Difference between revisions of "The Notion of Key-Value Pairs"
imported>Benkoo |
imported>Benkoo |
||
Line 1: | Line 1: | ||
Key-Value pairs is a common [[wikipedia:data type|data type]] or [[wikipedia:design pattern|design pattern]] in [[wikipedia:software engineering|software engineering]] that refers to the implementation of a look-up table, sometimes called "dictionary". This is also a data-oriented approach to represent a [[wikipedia:Function (mathematics)|function]]. On the other hand, all [[wikipedia:Computable function|computable function]]s can be approximated in terms of Key-Value pairs or "dictionary". | Key-Value pairs is a common [[wikipedia:data type|data type]] or [[wikipedia:design pattern|design pattern]] in [[wikipedia:software engineering|software engineering]] that refers to the implementation of a look-up table, sometimes called "dictionary". This is also a data-oriented approach to represent a [[wikipedia:Function (mathematics)|function]]. On the other hand, all [[wikipedia:Computable function|computable function]]s can be approximated in terms of Key-Value pairs or "dictionary". | ||
The notion of having a generic data structure, in this case | The notion of having a generic data structure, in this case:'''Key-Value pair''', to represent all computable structures is useful for pedagogical purposes, particularly for learning about data science. In the past, when functions are understood in terms of relations between numerical values, Key-Value pair or "dictionary" allows people to realize that mathematical functions are Key-Value pair. This means all properties of Key-Value data abstraction can be applied to all compute or compress data of any type. Offering a technical standard to reduce implementation complexity. |
Revision as of 14:57, 4 May 2021
Key-Value pairs is a common data type or design pattern in software engineering that refers to the implementation of a look-up table, sometimes called "dictionary". This is also a data-oriented approach to represent a function. On the other hand, all computable functions can be approximated in terms of Key-Value pairs or "dictionary".
The notion of having a generic data structure, in this case:Key-Value pair, to represent all computable structures is useful for pedagogical purposes, particularly for learning about data science. In the past, when functions are understood in terms of relations between numerical values, Key-Value pair or "dictionary" allows people to realize that mathematical functions are Key-Value pair. This means all properties of Key-Value data abstraction can be applied to all compute or compress data of any type. Offering a technical standard to reduce implementation complexity.