A New Parallel Signature File Method for Efficient Information Retrieval.
Jeong-Ki Kim, Jae-Woo Chang:
A New Parallel Signature File Method for Efficient Information Retrieval.
CIKM 1995: 66-73@inproceedings{DBLP:conf/cikm/KimC95,
author = {Jeong-Ki Kim and
Jae-Woo Chang},
title = {A New Parallel Signature File Method for Efficient Information
Retrieval},
booktitle = {CIKM '95, Proceedings of the 1995 International Conference on
Information and Knowledge Management, November 28 - December
2, 1995, Baltimore, Maryland, USA},
publisher = {ACM},
year = {1995},
pages = {66-73},
ee = {db/conf/cikm/KimC95.html, http://doi.acm.org/10.1145/221270.221329},
crossref = {DBLP:conf/cikm/95},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
The signature file method has been widely advocated as an efficient index scheme to handle new applications demanding a large volume of textual databases.
Moreover, it has recently been extended to support multimedia data.
In order to achieve good performance when handling 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 (HPSF) method using extendible hashing and frame-slicing techniques.
In addition, we also propose a heuristic processor allocation method so that we may assign a set of signatures to 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, insertion time, and storage overhead.
Finally, we show from the performance results that HPSF outperforms the conventional parallel signature file methods regarding retrieval performance and dynamic operating measures used to combine both retrieval and insertion time.
Copyright © 1995 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 2 Issue 4, CIKM, DOLAP, GIS, SIGFIDET, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
CIKM '95, Proceedings of the 1995 International Conference on Information and Knowledge Management, November 28 - December 2, 1995, Baltimore, Maryland, USA.
ACM 1995
Contents
Online Edition
Citation Page
References
- [1]
- Jae-Woo Chang, Joon Ho Lee, Yoon-Joon Lee:
Multikey Access Methods Based on Term Discrimination and Signature Clustering.
SIGIR 1989: 176-185

- [2]
- Walter W. Chang, Hans-Jörg Schek:
A Signature Access Method for the Starburst Database System.
VLDB 1989: 145-153

- [3]
- ...
- [4]
- Uwe Deppisch:
S-Tree: A Dynamic Balanced Signature Index for Office Retrieval.
SIGIR 1986: 77-87

- [5]
- Pavel Zezula, Fausto Rabitti, Paolo Tiberio:
Dynamic Partitioning of Signature Files.
ACM Trans. Inf. Syst. 9(4): 336-369(1991)

- [6]
- ...
- [7]
- ...
- [8]
- Christos Faloutsos, Stavros Christodoulakis:
Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation.
ACM Trans. Inf. Syst. 2(4): 267-288(1984)

- [9]
- Kien A. Hua, Chiang Lee:
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning.
VLDB 1991: 525-535

- [10]
- Jianzhong Li, Jaideep Srivastava, Doron Rotem:
CMD: A Multidimensional Declustering Method for Parallel Data Systems.
VLDB 1992: 3-14

- [11]
- Fabio Grandi, Paolo Tiberio, Pavel Zezula:
Frame-Sliced Partitioned Parallel Signature Files.
SIGIR 1992: 286-297

- [12]
- Zheng Lin:
Concurrent Frame Signature Files.
Distributed and Parallel Databases 1(3): 231-249(1993)

- [13]
- George Panagopoulos, Christos Faloutsos:
Bit-Sliced Signature Files for Very Large Text Databases an a Parallel Machine Architecture.
EDBT 1994: 379-392

- [14]
- Kyu-Young Whang, Gio Wiederhold, Daniel Sagalowicz:
Estimating Block Accesses in Database Organizations: A Closed Noniterative Formula.
Commun. ACM 26(11): 940-944(1983)

Copyright © Mon Dec 14 20:06:27 2009
by Michael Ley (ley@uni-trier.de)