Name
Abstract | ||
|---|---|---|
The signature file method has widely been advocated as an efficient index scheme to handle new applications demanding a large
amount of textual databases. Moreover, it has been recently extended to support multimedia data. In order to achieve good
performance on handling the multimedia data. the signature file approach has been required to support parallel database processing.
Therefore, in this paper we propose a horizontally-divided parallel signature file method (HPSF) using extendible hashing
and frame-slicing techniques. In addition, we propose a heuristic processor allocation method so that we may assign a set
of signatures into a given number of processors in a uniform way. To show the efficiency of HPSF, we evaluate the performance
of HPSF in terms of retrieval time, storage overhead, and insertion time. Finally, we show from the performance results that
HPSF outperforms the conventional parallel signature file methods on retrieval performance as well as a dynamic operating
measure to combine both retrieval and insertion time.
|
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BFb0049120 | DEXA |
Keywords | Field | DocType |
frame-slicing technique,dynamic signature files,extendible hashing,parallel databases,parallel processing environment,performance evaluation,new dynamic signature file,indexation,parallel processing | Heuristic,Extendible hashing,Computer science,Parallel database,Parallel computing,Parallel processing,Insertion time,Database,Signature file,Computer file | Conference |
ISBN | Citations | PageRank |
3-540-60303-4 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeong-ki Kim | 1 | 21 | 7.91 |
| Jae-Woo Chang | 2 | 401 | 99.85 |