Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
хеширование
Связанные издания:
Accurate Modeling of the Hybrid Hash Join Algorithm
A Comparison of Three Strategies for Computing Letter Oriented, Minimal Perfect Hashing Functions
Adaptive Hashing with Signatures
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
A Hardware Design Model for Cryptographic Algorithms
Alternatives to the B+ -tree
A Modulus Oriented Hash Function for the Construction of Minimal Perfect Tables
An Alternative Analysis of the Algorithm for Separate Chaining Technique of the Hashing Method
Analysis of parallel uniform hashing
A New Dynamic Signature File Method in Parallel Processing Environment
A New Family of Authentication Protocols
An Incremental Memory Allocation Method for Mixed Workloads
An Undergraduate Project to Compute Minimal Perfect Hashing Functions
Counter reduction technique for combined processing of selection and join
DBJ - A Dynamic Balancing Hash Join Algorithm in Multiprocessor Database Systems
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
Design and Implementation of Linear Hash Algorithm in a Nested Transaction Environment
Design of Hashing Algorithms
Dynamic Hashing with Distributed Overflow Space: A File Organization with Good Insertion Performance
Dynamic Partitioning of Signature Files
Effective Representation of Aliases and Indirect Memory Operations in SSA Form
Fast Search in Main Memory Databases
Fast Software Encryption: Revised Selected Papers/16th International Workshop, FSE 2009. Leuven, Belgium, February 2009
Filtered Hashing
Graphs, Hypergraphs and Hashing
Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines
LH* - Linear Hashing for Distributed Files
Linear-Density Hashing with Dynamic Overflow Sharing
Linear Spiral Hashing for Expansible Files
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
Message Authentication with One-Way Hash Functions
Minimal Perfect Hashing for Large Sets of Data
Modelle fur die Leistungsanalyse von Hashtabellen mit "Separate Chaining"
Multi-Directory Hashing
Nested Anealing a Provable Iprovement to Simulated Annealing
On GDM Allocation Method for Partial Range Queries
On Optimal Processor Allocation to Support Pipelined Hash Joins
On Randomization in Sequential and Distributed Algorithms
Optimal MMI file systems for orthogonal range retrieval
Order-Preserving Minimal Perfect Hash Functions and Information Retrieval
Partially Preemptible Hash Joins
Performance Analysis of a Main Memory Multi-Directory Hashing Technique
Performance of Linear Hashing Schemes for Primary Key Retrieval
Practical Minimal Perfect Hash Fanctions for Large Databases
Practical Minimal Perfect Hashing Functions for Large Databases
Realizing Sets by Hash Tables
Reliable Hashing without Collision Detection
Simulation-based Comparison of Hash Functions for Emulated Shared Memory
Software Stamping
Structuring Sets in Declarative Languages
1
2
следующая ›
последняя »