A fast retrieval method for local or distributed data
In this paper, we propose an improvement to an approach to data retrieval which is performed in only one access to a bucket hash table or file. The idea behind it, is to let the system assign one digit to the record key so that the hashed new record key is "forced " to fall in a bucket acc...
| Autor principal: | |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23312 |
| Aporte de: |
| id |
I19-R120-10915-23312 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas Distributed Management Concurrent Programming Distributed data searching Hashing one access retrieval system cooperating code assignment key management |
| spellingShingle |
Ciencias Informáticas Distributed Management Concurrent Programming Distributed data searching Hashing one access retrieval system cooperating code assignment key management Fontao, Rafael Oscar A fast retrieval method for local or distributed data |
| topic_facet |
Ciencias Informáticas Distributed Management Concurrent Programming Distributed data searching Hashing one access retrieval system cooperating code assignment key management |
| description |
In this paper, we propose an improvement to an approach to data retrieval which is performed in only one access to a bucket hash table or file. The idea behind it, is to let the system assign one digit to the record key so that the hashed new record key is "forced " to fall in a bucket according to some practical criteria. From a user point of view this forced hash procedure could be thought of as a “user-system cooperating code assignment”, since the user is free to code an object to be retrieved but the system may append s a digit to that code. For one access retrieval purposes, the new code key-digit is used to find its address. However, should the digit is not known, the retrieval process will find the key in its surrounding, provided it exists. In this approach it is unnecessary a bucket overflow area of any kind, since this method allows a high load factor for practical use. In the event of the hash table is nearly full, a simple procedure could be ran to extend the table size either by keeping the original digit or assigning new ones.
For distributed data sets this methodology shows an appealing performance in real life and simulation results. |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Fontao, Rafael Oscar |
| author_facet |
Fontao, Rafael Oscar |
| author_sort |
Fontao, Rafael Oscar |
| title |
A fast retrieval method for local or distributed data |
| title_short |
A fast retrieval method for local or distributed data |
| title_full |
A fast retrieval method for local or distributed data |
| title_fullStr |
A fast retrieval method for local or distributed data |
| title_full_unstemmed |
A fast retrieval method for local or distributed data |
| title_sort |
fast retrieval method for local or distributed data |
| publishDate |
2001 |
| url |
http://sedici.unlp.edu.ar/handle/10915/23312 |
| work_keys_str_mv |
AT fontaorafaeloscar afastretrievalmethodforlocalordistributeddata AT fontaorafaeloscar fastretrievalmethodforlocalordistributeddata |
| bdutipo_str |
Repositorios |
| _version_ |
1764820466126553089 |