"Fast elimination of duplicate data is needed in many areas, especially in the textual data context. A solution to this problem was recently found for geometrical data using a hash function to speed up the process. In this paper a new construction of the hash function is presented, giving short clusters with few collisions only."@en . "hash function; has table; duplicate elimination; data structure; dictionary"@en . "P(2C06002)" . "Vysok\u00E9 Tatry - Podbansk\u00E9" . . "Efficient hash function for duplicate elimination in dictionaries"@en . "2009-03-20+01:00"^^ . . "312508" . "978-80-227-3032-7" . "10"^^ . "Algoritmy 2009 : 18th Conference on Scientific Computing" . . "Skala, V\u00E1clav" . . . "[527067CF3B44]" . . "2"^^ . "Efficient hash function for duplicate elimination in dictionaries" . . . . "2"^^ . . "000267157200040" . "Efficient hash function for duplicate elimination in dictionaries" . "Slovensk\u00E1 technick\u00E1 univerzita v Bratislave" . . . . "23520" . "Bratislava" . "Efficient hash function for duplicate elimination in dictionaries"@en . . "Fast elimination of duplicate data is needed in many areas, especially in the textual data context. A solution to this problem was recently found for geometrical data using a hash function to speed up the process. In this paper a new construction of the hash function is presented, giving short clusters with few collisions only." . "RIV/49777513:23520/09:00502113!RIV10-MSM-23520___" . . "RIV/49777513:23520/09:00502113" . . . "Hr\u00E1dek, Jan" . . .