Reputation
Top tag
Next privilege 200 Rep.
See reduced ads
Badges
7
Newest
 Scholar
Impact
~699 people reached

  • 0 posts edited
  • 0 helpful flags
  • 5 votes cast
Aug
21
comment How to search/replace while including or excluding folded text?
Excellent - that's exactly what I needed and somehow couldn't find.
Jun
16
comment Unix sort keys cause performance problems
That makes sense - though the performance is far worse than just 1 pass per key. For example one key takes 30 seconds while three keys takes 10 times as long, or 300 seconds. These seems extremely repeatable and unaffected by using a buffer_size larger than the data.
Jun
16
comment Unix sort keys cause performance problems
Since I'm not looking to access just 1% of the data, but rather the entire set, an index isn't helpful to me. The only thing another piece of software like SQLite would offer is potentially a better sorting algorithm. Does that make sense? Would you agree?
Jun
16
comment Unix sort keys cause performance problems
I need to access 100% of the data - so indexes won't help me. And in fact, if there's just 1 key, the performance is reasonable.
Jun
15
comment Unix sort keys cause performance problems
The sort is performed within a tool that allows the user to configure which columns are keys. So, it must potentially support multiple, non-continuous keys. I suppose I could write the code to consolidate that when the keys are adjacent.
Jun
14
comment Unix sort keys cause performance problems
I'm assuming the problem is algorithmic, but I'll try giving it more memory. I already tried it with & without numeric sorting and found no difference.