Why not just append the insert as it's incoming order for maximum insert speed?

[郭枫]

Just append the insert row is fastest for insert, though it says search will be full table scan and will be very slow,but  adding index could solve this~

Even B-Tree or Fractal Tree is clustering index organized table, it just quick for primary key search without secondary index, looking for non-primary column still needs a full table scan~

So compared to append rows , B-Tree or Fractal Tree ’s insert speed is slower, and same slow for non-indexed column search, so why not just using append file this method?

[郭枫]

I think: if a row is inserted  into the table in appending method , but the row has to be inserted into index in a sorted order, so insert speed will be slow too~ 

在 2015年8月29日星期六 UTC+8下午3:42:03，郭枫写道：