Extendible Hashing-A Fast Access Method for Dynamic Files

First Page		Document Content
Date: 2005-11-08 01:51:24 Information retrieval Error detection and correction Information Hash table Hash function Trie Extendible hashing Cryptographic hash function B-tree Information science Search algorithms Hashing		Extendible Hashing-A Fast Access Method for Dynamic Files Add to Reading List Source URL: www.informatik.uni-jena.de Download Document from Source Website File Size: 1,93 MB Share Document on Facebook

	Hybrid Use of Hashing Techniques for Spatial Data Wayne A. Davis Department of Computing Science The University of Alberta Edmonton, Alberta, Canada T6G 2H1 DocID: 1pXyJ - View Document
	HIERARCHICAL GRID STRUCTURES FOR STATIC GEOGRAPHIC DATA BASES Andreas Kleiner and Kurt E. Brassel Department of Geography University of Zurich Winterthurerstr. 190 DocID: 1osxi - View Document
	ANALCO-2004, New Orleans, JAN 2004 Theory and Practice of Probabilistic Counting Algorithms Philippe Flajolet, INRIA, Rocquencourt DocID: 18X0Y - View Document
	A Fast, Minimal Memory, Consistent Hash Algorithm John Lamping, Eric Veach Google Abstract DocID: 18kME - View Document
	PDF Document DocID: 17bq8 - View Document