Title: | New Hash Function Construction for Textual and Geometrical Data Retrieval |
Authors: | Skala, Václav Hrádek, Jan Kuchař, Martin |
Citation: | Latest Trends on Applied Mathematics, Simulation, Modelling: 4th International Conference on Applied Mathematics, Simulation, Modelling (ASM'10), p. 214-219. |
Issue Date: | 2010 |
Publisher: | WSEAS |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://hdl.handle.net/11025/11784 |
ISBN: | 978-960-474-210-3 |
ISSN: | 1792-4332 |
Keywords: | hešovací funkce;textová data;geometrická data;indexování;vyhledávání dat |
Keywords in different language: | hash function;textual data;geometric data;indexing;data retrieval |
Abstract: | Techniques based on hashing are heavily used in many applications, e.g. information retrieval, geometry processing, chemical and medical applications etc. and even in cryptography. Traditionally the hash functions are considered in a form of h(v) = f(v) mod m, where m is considered as a prime number and f(v) is a function over the element v, which is generally of „unlimited“ dimensionality and/or of „unlimited“ range of values. In this paper a new approach for a hash function construction is presented which offers unique properties for textual and geometric data. Textual data have a limited range of values (the alphabet size) and „unlimited“ dimensionality (the string length), while geometric data have „unlimited“ range of values (usually (-∞, ∞) ), but limited dimensionality (usually 2 or 3). Construction of the hash function differs for textual and geometric data and the proposed hash construction has been verified on non-trivial data sets. |
Rights: | Original paper published under copyright license © 2010 WSEAS. |
Appears in Collections: | Konferenční příspěvky / Conference Papers (KIV) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Skala_2010_Corfu-NAUN-Hash.pdf | Plný text | 901,12 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11784
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.