5 ms·
>> Nobody really wants a huge globally sorted output. We haven’t found a single use case for the problem as stated. Do anyone has a real world use case of glob
by azurezyq 11y ago
>> Nobody really wants a huge globally sorted output. We haven’t found a single use case for the problem as stated.
Do anyone has a real world use case of global sorting other than top-k?
- mc808 11y agoIf the key is a sizable part of the data, then sorting could allow you to shave a few bytes from the key and reduce the overall storage needed. (Going from 50,000 drives to 40,000 drives is pretty significant even for someone who can afford 50,000 drives.) But I have no idea if there are real world cases where that is the right way to compress the data.
- rockinghigh 11y agoIf you sort records by time you can perform time range queries. You can also create an index to access random keys (like a MapFile in Hadoop).
- amelius 11y agoBut isn't sorting by time easy, because records come in the correct order? I would say you don't need an algorithm for that.
- rockinghigh 11y agoYou may want to sort by settlement date instead of transaction date. There are plenty of examples where you need to sort before you can index: let's say you want to create a spatial index. You first need to sort/group spatially (by tile) to query an area.