User1524032685 posted
Hi,
If for example I have a table:
tblstrings >>>
--- IdString DText - Dsource
(Int) (text) (text)
In 99% of the time I recover DText and only 1% of the time I recover Dsource.
Dtext and dsource (DText and DSource are big texts).
Query 1
(99%)
SELECT DText FROM tblstrings WHERE id = n
Query 2
(1%)
SELECT DSource FROM tblstrings WHERE id = n
If I split the table in two parts I'll have to search more efficiently?
For example:
tblstrings1
--- IdString DText
tblstrings2
FK_IdString - Dsource
Someone with a theoretical basis on the database can give an opinion? (table size x performance)
As always thank you very much.
