Implementation of the substring test by hashing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Implementation of the substring test by hashing

Full text

Pdf (211 KB)

Source

Communications of the ACM archive
Volume 14 , Issue 12 (December 1971) table of contents

Pages: 777 - 779

Year of Publication: 1971

ISSN:0001-0782

Author

Malcolm C. Harrison

New York Univ., New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 54, Citation Count: 21

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/362919.362934 What is a DOI?

ABSTRACT

In a paper in the November 1970 Communications of the ACM, V.Y. Lum introduced a technique of file indexing named combined indices. This technique permitted decreased retrieval time at the cost of increased storage space. This paper examines combined indices under conditions of file usage with different fractions of retrieval and update. Tradeoff curves are developed to show minimal cost of file usage by grouping various partially combined indices.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Feller, W. An Introduction to Probability Theory and its Applications (2nd ed.). Wiley, New York, 1957.
	2	Harrison, M.C. Set comparison using hashing techniques. AEC Res. and Develop. Rep. NYO-1480-155, Courant Institute, New York University, New York, June 1970.

CITED BY 21

	Chris Faloutsos , Stavros Christodoulakis, Signature files: an access method for documents and its analytical performance evaluation, ACM Transactions on Information Systems (TOIS), v.2 n.4, p.267-288, Oct. 1984
	Walter A. Burkhard, Partial-match hash coding: benefits of redundancy, ACM Transactions on Database Systems (TODS), v.4 n.2, p.228-239, June 1979
	R. Sacks-Davis , A. Kent , K. Ramamohanarao, Multikey access methods based on superimposed coding techniques, ACM Transactions on Database Systems (TODS), v.12 n.4, p.655-696, Dec. 1987
	Albert L. Zobrist , Frederick R. Carlson, Jr., Detection of combined occurrences, Communications of the ACM, v.20 n.1, p.31-35, Jan. 1977
	Alfred V. Aho , Margaret J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, v.18 n.6, p.333-340, June 1975
	Jonathan D. Cohen, Recursive hashing functions for n-grams, ACM Transactions on Information Systems (TOIS), v.15 n.3, p.291-320, July 1997
	Abraham Bookstein, On Harrison's substring testing technique, Communications of the ACM, v.16 n.3, p.180-181, March 1973
	Christos Faloutsos , Stavros Christodoulakis, Optimal signature extraction and information loss, ACM Transactions on Database Systems (TODS), v.12 n.3, p.395-428, Sept. 1987
	Chris Faloutsos, Access methods for text, ACM Computing Surveys (CSUR), v.17 n.1, p.49-74, March 1985
	Ogawa Yasushi , Iwasaki Masajirou, A new character-based indexing method using frequency data for Japanese documents, Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, p.121-129, July 09-13, 1995, Seattle, Washington, United States
	T. Raita , J. Teuhola, Predictive test compression by hashing, Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval, p.223-233, June 03-05, 1987, New Orleans, Louisiana, United States
	Alfred V. Aho , Jeffrey D. Ullman, Optimal partial-match retrieval when fields are independently specified, ACM Transactions on Database Systems (TODS), v.4 n.2, p.168-179, June 1979
	R. M. Lea , E. J. Schuegraf, An associative file store using fragments for run-time indexing and compression, Proceedings of the 3rd annual ACM conference on Research and development in information retrieval, p.280-295, June 23-27, 1980, Cambridge, England
	Uwe Deppisch, S-tree: a dynamic balanced signature index for office retrieval, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, p.77-87, September 1986, Palazzo dei Congressi, Pisa, Italy
	Ian J. Barton , Susan E. Creasey , Michael F. Lynch , Michael J. Snell, An information-theoretic approach to text searching in direct access systems, Communications of the ACM, v.17 n.6, p.345-350, June 1974
	R. A. Baeza-Yates, Algorithms for string searching, ACM SIGIR Forum, v.23 n.3-4, p.34-58, Spring 1989
	Gaston H. Gonnet, Unstructured data bases or very efficient text searching, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia
	H.-J. Schek, Methods for the administration of textual data in database systems, Proceedings of the 3rd annual ACM conference on Research and development in information retrieval, p.218-235, June 23-27, 1980, Cambridge, England
	Merrill E. Iseman , Dennis E. Shasha, Performance and Architectural Issues for String Matching, IEEE Transactions on Computers, v.39 n.2, p.238-250, February 1990
	W. W. Chang , H. J. Schek, A signature access method for the Starburst database system, Proceedings of the 15th international conference on Very large data bases, p.145-153, July 1989, Amsterdam, The Netherlands
	Alan J. Kent , Ron Sacks-Davis , Kotagiri Ramamohanarao, A Superimposed Coding Scheme Based on Multiple Block Descriptor Files for Indexing Very Large Data Bases, Proceedings of the 14th International Conference on Very Large Data Bases, p.351-359, August 29-September 01, 1988

INDEX TERMS

Keywords:
hashing, information compression, information retrieval, searching, signature, subset, substring

Collaborative Colleagues:

Malcolm C. Harrison: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player