而通过一个或多个(d1,d2,p1,p2)-sensitive的hash function对原始数据集合进行hashing生成一个或多个hash table的过程称为Locality-sensitive...Hashing。...[3] Locality-sensitive hashing scheme based on p-stable distributions [4] MultiProbe LSH Efficient...Indexing for HighDimensional Similarity Search [...
Leis, V., et al. “The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases”, IEEE 29th International Conference on Data Engineering (ICDE), Apr. 8, 2013, pp. 38-49, IEEE. Lehman, T.J. “Design and Performance Evaluation of a Main Memory Relational Database System.” 1986,...
Chapter9and10.1 B+-TreesandStaticHashing,R.RamakrishnanandJ.Gehrke;revisedbyCh.Eick2 IntroductionIndexingTechniques •Asforanyindex,3alternativesfordataentriesk*: 1.Datarecordwithkeyvaluek 2. 3. •Hash-basedindexesarebestforequalityselections. ...