Abstract
Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and horizontal decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. G. G. Cattell, editor. Object Database Standard: ODMG-93. Morgan Kaufmann, San Francisco, California, 1996. Rel. 1.2.
P. Ciaccia and P. Zezula. “Estimating Accesses in Partitioned Signature File Organizations,”. ACM Trans. Inf. Syst., 11(2):133–142, 1993.
C. Faloutsos. “Access Methods for Text,”. ACM Comput. Surv., 17(1):49–74, 1985.
C. Faloutsos. “Signature-Based Text Retrieval Methods: A Survey,”. IEEE Database Eng., 13(1):25–32, Mar. 1990.
C. Faloutsos and S. Christodoulakis. “Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation,”. ACM Trans. Off. Inf. Syst., 2(4):267–288, 1984.
C. Faloutsos and S. Christodoulakis. “Description and Performance Analysis of Signature File Methods for Office Filing,”. ACM Trans. Off. Inf. Syst., 5(3):237–257, July 1987.
Y. Ishikawa, H. Kitagawa, and N. Ohbo. “Evaluation of Signature Files as Set Access Facilities in OODBs,”. In Proc. ACM SIGMOD, pages 247–256, Washington, D.C., 1993.
J. K. Kim and J. W. Chang. “A Two-dimensional Dynamic Signature File Method,”. In Intl. Symp. on Advanced Database Technologies and Their Integration (ADTI'94), pages 63–70, Nara, Japan, 1994.
H. Kitagawa, Y. Fukushima, Y. Ishikawa, and N. Ohbo. “Estimation of False Drops in Set-valued Object Retrieval with Signature Files,”. In Proc. 4th Intl. Conf. on Foundations of Data Organization and Algorithms (FODO '93), pages 146–163, 1993.
D. L. Lee and C. Leng. “Partitioned Signature Files: Design Issues and Performance Evaluation,”. ACM Trans. Off. Inf. Syst., 7(2):158–180, 1989.
W. Lee and D. L. Lee. “Signature File Methods for Indexing Object-Oriented Database Systems,”. In Intl. Computer Science Conf. (ICSC), pages 616–622, Hong Kong, 1992.
Z. Lin and C. Faloutsos. “Frame-Sliced Signature Files,”. IEEE Trans. Knowl. and Data Eng., 4(3):281–289, 1992.
F. Rabitti and P. Savino. “Image Query Processing Based on Multi-level Signatures,”. In Proc. of 14th Annual Intl. ACM/SIGIR Conf. on Research and Development in Information Retrieval, pages 305–314, Chicago, Illinois, Oct. 1991.
K. Ramamohanarao and J. A. Shepherd. “A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases,”. In Proc. of the Third Intl. Conf. on Logic Programming, pages 569–576, London, 1986.
C. S. Roberts. “Partial-Match Retrieval via the Method of Superimposed Codes,”. Proc. IEEE, 67(12):1624–1642, Dec. 1979.
S. Stiassny. “Mathematical Analysys of Various Superimposed Coding Methods,”. American Documentation, 11(2):155–169, 1960.
P. Tiberio and P. Zezula. “Storage and Retrieval: Signature File Access,”. In A. Kent and J. G. Williams, editors, Encyclopedia of Microcomputers, volume 16, pages 377–403. Marcel Dekker, Inc., New York, 1995.
N. Watanabe and H. Kitagawa. “Design and Evaluation of Partitioned Bit-Sliced Signature File,”. IPS Japan SIGDBS, 95-DBS-104:1–8, July 1995. (in Japanese).
S. B. Yao. “Approximating Block Accesses in Database Organizations,”. CACM, 20(4):260–261, 1977.
H.-S. Yong, S. Lee, and H.-J. Kim. “Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases,”. In Proc. of 10th Intl. Conf. on Data Engineering, pages 518–525, Houston, Texas, Feb. 1994. IEEE.
P. Zezula, P. Ciaccia, and P. Tiberio. “Key-Based Partitioned Bit-Sliced Signature File,”. ACM SIGIR Forum, 29(2):20–34, Fall 1995.
P. Zezula, F. Rabitti, and P. Tiberio. “Dynamic Partitioning of Signature Files,”. ACM Trans. Inf. Syst., 9(4):336–369, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitagawa, H., Watanabe, N., Ishikawa, Y. (1996). Design and evaluation of signature file organization incorporating vertical and horizontal decomposition schemes. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034739
Download citation
DOI: https://doi.org/10.1007/BFb0034739
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61656-6
Online ISBN: 978-3-540-70651-9
eBook Packages: Springer Book Archive