Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re: Advanced Sorting - GRT - Guttman Rosler Transform

by dws (Chancellor)
on Feb 15, 2002 at 21:14 UTC ( #145767=note: print w/ replies, xml ) Need Help??

in reply to Advanced Sorting - GRT - Guttman Rosler Transform

The basic idea is to encode the precomputed keys into a string, usually using pack() such that perl can sort them lexicographically

This is a key point. I've seen it overlooked in two cases, both leading to subtle sorting problems of the "well, this stuff sorts most of the time" variety.

A naive read of Guttman-Rosler is "hey, let's cram the key parts together in a way we can uncram them later." That's necessary, but not sufficient. Simple concatenation won't do. You must pack(), or concatenate in such a way that the keys are aligned for a lexicographic sort. If you see someone use join in a Guttman-Rosler search, watch out!

Consider the difference between

Naive join Aligned keys foo 47 foo 47 foo 103 foo 103
If you don't align the keys (typically via pack or a carefully crafted sprintf), you risk getting composite keys that sort correctly most of the time. A variant of the problem can occur with non-numeric strings when joining them with a character like '|'.

Comment on Re: Advanced Sorting - GRT - Guttman Rosler Transform
Select or Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://145767]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (3)
As of 2015-11-29 20:03 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (753 votes), past polls