According to MYSQL's site: Each BLOB or TEXT value is represented internally by a separately allocated object. This is in contrast to all other data types, for which storage is allocated once per column when the table is opened. In other words, if a TEXT is only about the size of an INT for row size purposes, would it be as fast as querying a row with just an INT? However after searching again I learned that the implementation is specific to a certain type of MYSQL database and may not be relevant to what I am using.
I asked because of the possibility that row size or database size may be relevant to performance, but I do not know if it is.
Refactoring is just a buzz word for recoding. Essentially the board is already working but I am trying to make it more efficient and OOP.
Somewhat related, I wonder how I may efficiently return a set of sorted rows as a composite row of the most relevant values.
For example, I want a single set of options from a table:
option1 option2 option3
These are the rows sorted:
A | 0 | 0
X | B | 0
X | X | C
I would return the first non zero or non null that is found of each of the fields:
option1: A option2: B option3: C