Abstract
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different approaches for organizing signature files have been proposed, such as sequential signature files, bit-slice files, S-trees, and its different variants, as well as signature trees. In this paper, we extends the structure of signature trees by introducing multiple-bit checkings. That is, during the searching of a signature tree against a query signature s q , more than one bit in s q will be checked each time when a node is encoun tered. This does not only reduce significantly the size of a signature tree, but also increases the filtering ability of the signature tree. We call such a structure a general signature tree. Experiments have been made, showing that the general signature tree uniformly outperforms the signature tree approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Cluet, S., Christophides, V., Milo, T., Moerkotte, G., Simeon, J.: Querying documents in object databases. Int. J. on Digital Libraries 1(1), 5–19 (1997)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Com., London (1974)
Bayer, R., Unterrauer, K.: Prefix B-tree. ACM Transaction on Database Systems 2(1), 11–26 (1977)
Christodoulakis, S., Faloutsos, C.: Design consideration for a message file server. IEEE Trans. Software Engineering 10(2), 201–210 (1984)
Chen, Y.: Signature Files and Signature Trees. Information Processing Letters 82(4), 213–221 (2002)
Chang, W.W., Schek, H.J.: A signature access method for the STARBURST database system. In: Proc. 19th VLDB Conf., pp. 145–153 (1989)
Christodoulakis, S., Theodoridou, M., Ho, F., Papa, M., Pathria, A.: Multimedia document presentation, information extraction and document formation in MINOS - A model and a system. ACM Trans. Office Inform. Systems 4(4), 345–386 (1986)
Ciaccia, P., Zezula, P.: Declustering of key-based partitioned signature files. ACM Trans. Database Systems 21(3), 295–338 (1996)
Deppisch, U.: S-tree: A Dynamic Balanced Signature Index for Office Retrieval. In: ACM SIGIR Conf., September 1986, pp. 77–87 (1986)
Dervos, D., Manolopulos, Y., Linardis, P.: Comparison of signature file models with superimposed coding. J. of Information Processing Letters 65, 101–106 (1998)
Faloutsos, C.: Access Methods for Text. ACM Computing Surveys 17(1), 49–74 (1985)
Faloutsos, C.: Signature Files. In: Frakes, W.B., Baeza-Yates, R. (eds.) Information Retrieval: Data Structures & Algorithms, pp. 44–65. Prentice Hall, New Jersey (1992)
Faloutsos, C., Lee, R., Plaisant, C., Shneiderman, B.: Incorporating string search in hypertext system: User interface and signature file design issues. HyperMedia 2(3), 183–200 (1990)
Harman, D., Fox, E., Baeza-Yates, R.: Inverted Files. In: Frakes, W.B., Baeza-Yates, R. (eds.) Information Retrieval: Data Structures & Algorithms, pp. 28–43. Prentice Hall, New Jersey (1992)
Ishikawa, Y., Kitagawa, H., Ohbo, N.: Evaluation of signature files as set access facilities in OODBs. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, Washington D.C., May 1993, pp. 247–256 (1993)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching. Addison-Wesley Pub., London (1973)
Kent, A.J., Sacks-Davis, R., Ramamohanarao, K.: A signature file scheme based on multiple organizations for indexing very large text databases. J. Am. Soc. Inf. Sci. 41(7), 508–534
Lee, W., Lee, D.L.: Signature File Methods for Indexing Object-Oriented Database Systems. In: Proc. ICIC 1992 - 2nd Int. Conf. on Data and Knowledge Engineering: Theory and Application, Hongkong, December 1992, pp. 616–622 (1992)
Morrison, D.R.: PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric. Journal of Association for Computing Machinery 15(4), 514–534 (1968)
Tousidou, E., Nanopoulos, A., Manolopoulos, Y.: Improved methods for signature-tree construction. Computer Journal 43(4), 301–314 (2000)
Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based structures for objects with set-values attributes. Infromation Systems 27(2), 93–121 (2002)
Yong, H.S., Lee, S., Kim, H.J.: Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases. In: Proc. of 10th Int. Conf. on Data Engineering, Houston, Texas, February 1994, pp. 518–525 (1994)
Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted Files Versus Signature Files for Text Indexing. ACM Transaction on Database Systems 23(4), 453–490 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y. (2005). On the General Signature Trees. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_21
Download citation
DOI: https://doi.org/10.1007/11546924_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)