Article

Hashing revisited

Author:

John HamerAuthors Info & Claims

ITiCSE '02: Proceedings of the 7th annual conference on Innovation and technology in computer science education

Pages 80 - 83

https://doi.org/10.1145/544414.544440

Published: 24 June 2002 Publication History

Get Access

Abstract

Hashing is a singularly important technique for building efficient data structures. Unfortunately, the topic has been poorly understood historically, and recent developments in the practice of hashing have not yet found their way into textbooks.This paper revisits the theory and practice of hashing in a modern light, relates our teaching experiences, and presents some suggestions for student exercises.

References

[1]

D. Knuth. Sorting and Searching, The Art of Computer Programming, volume 3. Addison-Wesley, 1973.

Digital Library

Google Scholar

[2]

P. Pearson. Fast hashing of variable length text strings. Communications of the ACM, 33(6):677--680, June 1990.

Digital Library

Google Scholar

[3]

R. Uzgalis and M. Tong. Hashing myths. Technical Report 97, Department of Computer Science University of Auckland, July 1994.

Google Scholar

Cited By

View all

Simon Sheard JGiannakos MSindre GLuxton-Reilly ADivitini M(2020)Twenty-Four Years of ITiCSE PapersProceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education10.1145/3341525.3387407(5-11)Online publication date: 15-Jun-2020
https://dl.acm.org/doi/10.1145/3341525.3387407
Hamer JDavoli RGoldweber MSalomoni P(2006)Some experiences with the "contributing student approach"Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education10.1145/1140124.1140145(68-72)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1140124.1140145
Hamer J(2006)Some experiences with the "contributing student approach"ACM SIGCSE Bulletin10.1145/1140123.114014538:3(68-72)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1140123.1140145

Index Terms

Hashing revisited
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization

Recommendations

Hashing revisited

Hashing is a singularly important technique for building efficient data structures. Unfortunately, the topic has been poorly understood historically, and recent developments in the practice of hashing have not yet found their way into textbooks.This ...
Locality sensitive hashing revisited: filling the gap between theory and algorithm analysis
CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge Management

Locality Sensitive Hashing (LSH) is widely recognized as one of the most promising approaches to similarity search in high-dimensional spaces. Based on LSH, a considerable number of nearest neighbor search algorithms have been proposed in the past, with ...
Hashing, searching, sketching

Comments

Information & Contributors

Information

Published In

ITiCSE '02: Proceedings of the 7th annual conference on Innovation and technology in computer science education

June 2002

262 pages

ISBN:1581134991

DOI:10.1145/544414

Conference Chairs:
Michael E. Caspersen
University of Aarhus, Denmark
,
Dan Joyce
Villanova University, USA
,
Program Chairs:
Don Goelman
Villanova University, USA
,
Ian Utting
University of Kent, UK

ACM SIGCSE Bulletin Volume 34, Issue 3
September 2002
269 pages
ISSN:0097-8418
DOI:10.1145/637610
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 June 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

general hashing

Qualifiers

Article

Conference

ITiCSE02

Sponsor:

SIGCSE

ITiCSE02: Innovation and Technology in Computer Science Education

June 24 - 28, 2002

Aarhus, Denmark

Acceptance Rates

ITiCSE '02 Paper Acceptance Rate 42 of 100 submissions, 42%;

Overall Acceptance Rate 552 of 1,613 submissions, 34%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
947
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Simon Sheard JGiannakos MSindre GLuxton-Reilly ADivitini M(2020)Twenty-Four Years of ITiCSE PapersProceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education10.1145/3341525.3387407(5-11)Online publication date: 15-Jun-2020
https://dl.acm.org/doi/10.1145/3341525.3387407
Hamer JDavoli RGoldweber MSalomoni P(2006)Some experiences with the "contributing student approach"Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education10.1145/1140124.1140145(68-72)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1140124.1140145
Hamer J(2006)Some experiences with the "contributing student approach"ACM SIGCSE Bulletin10.1145/1140123.114014538:3(68-72)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1140123.1140145

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Hashing revisited

Locality sensitive hashing revisited: filling the gap between theory and algorithm analysis

Hashing, searching, sketching