The chaotic property of a new open addressing hash function, called exponential hashing, is presented. Our analysis indicates the connection between ergodic theory and hashing. Based on that, concepts from ergodic theory are applied to predict the performance of exponential hashing. Experimental results are presented to verify our theoretic analysis and the prediction.