Tom Lane 2604359251 Improve hash_any() to use word-wide fetches when hashing suitably aligned ... data. This makes for a significant speedup at the cost that the results now vary between little-endian and big-endian machines; which forces us to add explicit ORDER BYs in a couple of regression tests to preserve machine-independent comparison results. Also, force initdb by bumping catversion, since the contents of hash indexes will change (at least on big-endian machines). Kenneth Marshall and Tom Lane, based on work from Bob Jenkins. This commit does not adopt Bob's new faster mix() algorithm, however, since we still need to convince ourselves that that doesn't degrade the quality of the hashing.		2008-04-06 16:54:49 +00:00
..
dblink.sql	Improve hash_any() to use word-wide fetches when hashing suitably aligned	2008-04-06 16:54:49 +00:00