Results 1  10
of
70,773
Linear Hashing
"... Linear Hashing is a dynamically updateable diskbased index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+tree index which also supports exact ..."
Abstract
 Add to MetaCart
Linear Hashing is a dynamically updateable diskbased index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+tree index which also supports exact
Linear Hashing
, 1999
"... Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good H is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from H and look at ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good H is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from H and look
Analysis Of Linear Hashing Revisited
, 1998
"... . In this paper we characterize several expansion techniques used for linear hashing and we present how to analyze any linear hashing technique that expands based on local events or that mixes local events and global conditions. As an example we give a very simple randomized expansion technique, whi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. In this paper we characterize several expansion techniques used for linear hashing and we present how to analyze any linear hashing technique that expands based on local events or that mixes local events and global conditions. As an example we give a very simple randomized expansion technique
LH: linear hashing for distributed files
 ACM SIGMOD Record
, 1993
"... LH * generalizes Linear Hashing to parallel or distributed RAM and disk les. An LH * le can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion i ..."
Abstract

Cited by 106 (17 self)
 Add to MetaCart
LH * generalizes Linear Hashing to parallel or distributed RAM and disk les. An LH * le can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion
Linear Hash Functions
, 1999
"... Consider the set # of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good # is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from # and look at ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Consider the set # of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good # is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from # and look
Abstract LH * — Linear Hashing for
"... RAM and disk files. An LH * file can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion is one in general, and three in the worst case. The numbe ..."
Abstract
 Add to MetaCart
number of objects. It can be more efficient than any file with a centralized directory, or a static parallel or distributed hash file. 1
Performance of linear hashing schemes for primary key retrieval
 Information Systems
, 1994
"... Abstract Linear hashing is one of the most attractive dynamic hashing schemes. Linear hashing with partial expansions and linear hashing with priority splitting are two variations with improved space and time performance. Here, we propose a new structure, which is termed linear hashing with partial ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract Linear hashing is one of the most attractive dynamic hashing schemes. Linear hashing with partial expansions and linear hashing with priority splitting are two variations with improved space and time performance. Here, we propose a new structure, which is termed linear hashing
ABSTRACT DISTRIBUTED LINEAR HASHING AND PARALLEL PROJECTION IN MAIN MEMORY DATABASES
"... This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher level parallel dambase operations. The basic distributed linear hashing technique provides a high speed hash based dynamic file system on a NUMA atchitecture multiprocess ..."
Abstract
 Add to MetaCart
This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher level parallel dambase operations. The basic distributed linear hashing technique provides a high speed hash based dynamic file system on a NUMA atchitecture multi
Locally Linear Hashing for Extracting NonLinear Manifolds
"... Previous efforts in hashing intend to preserve data variance or pairwise affinity, but neither is adequate in capturing the manifold structures hidden in most visual data. In this paper, we tackle this problem by reconstructing the locally linear structures of manifolds in the binary Hamming spac ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Previous efforts in hashing intend to preserve data variance or pairwise affinity, but neither is adequate in capturing the manifold structures hidden in most visual data. In this paper, we tackle this problem by reconstructing the locally linear structures of manifolds in the binary Hamming
Similarity search in high dimensions via hashing
, 1999
"... The nearest or nearneighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over highdimensional data, e.g., image dat ..."
Abstract

Cited by 622 (13 self)
 Add to MetaCart
to 20, searching in kd trees and related structures involves the inspection of a large fraction of the database, thereby doing no better than bruteforce linear search. It has been suggested that since the selection of features and the choice of a distance metric in typical applications is rather
Results 1  10
of
70,773