# Table Indexing

**Question:** A table is two data structures in one. It is considered an array of dictionaries, as well as a dictionary of arrays. For the former, each element is a dictionary that holds one value per key. The keys represent the columns and the values represent the column data for that row. For the latter, each key maps to an array of values. The keys represent the columns and the values represent the column data for all rows. You can manipulate a table using both keys and numeric indices, keys will yield columns and numbers will yield rows. Knowing how to use each indexing method in tandem with each other will result in the fastest retrieval of data. Generally, if you're retrieving a subset of columns and a subset of rows, the fastest method of retrieval would be column retrieval first and then row retrieval. If you are retrieving all columns, it is faster not to lookup columns. If you are retreiving all rows, it is faster not to lookup rows. Using the table 't' created below, write the equivalent of '**update px:100f from t where px>60f**' using the apply/amend operator '@'. Write two forms, one applying column indices first, and the other applying row indices first. Notice the speed difference between the two forms.

**More Information:**

### Example

```
``````
q)t:([]time:asc n?.z.N;sym:upper n?`2;px:n?100f;size:(n:100000000)?200j) / 100 mil rows
q)i:til count t
q)\t (`time`sym#t) i / column lookup first, then row lookup
350
q)\t `time`sym#t i / rows lookup first then column lookup, significantly slower
694
q)((`time`sym#t) i) ~ `time`sym#t i
1b
```