Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Hashing Schemes for Extendible Arrays
Journal of the ACM (JACM)
Big Buckets Are (Are Not) Better!
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
The reallocation of hash-coded tables
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
General performance analysis of key-to-address transformation methods using an abstract file concept
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Generating association rules from semi-structured documents using an extended concept hierarchy
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
EH* - Extendible Hashing in a Distributed Environment
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Evaluation of LH*LH for a Multicomputer Architecture
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Platypus: Design and Implementation of a Flexible High Performance Object Store
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Serving Datacube Tuples from Main Memory
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Optimal Linear Hashing Files for Orthogonal Range Retrieval
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Supporting Load Balancing and Efficient Reorganization During System Scaling
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Stasis: flexible transactional storage
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
LH*RSP2P: a scalable distributed data structure for P2P environment
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Fault-tolerant stream processing using a distributed, replicated file system
Proceedings of the VLDB Endowment
Architecture of a Database System
Foundations and Trends in Databases
Kinesis: A new approach to replica placement in distributed storage systems
ACM Transactions on Storage (TOS)
Universal hash functions for an infinite universe and hash trees
Information Processing Letters
Online reorganization of databases
ACM Computing Surveys (CSUR)
Dynamic external hashing: the limit of buffering
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Query Optimization through Cached Queries for Object-Oriented Query Language SBQL
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
EH*RS: a high-availability scalable distributed data structure
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
A load balancing framework for clustered storage systems
HiPC'08 Proceedings of the 15th international conference on High performance computing
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The DataPath system: a data-centric analytic processing engine for large data warehouses
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
LH*RSP2P: a fast and high churn resistant scalable distributed data structure for P2P systems
International Journal of Internet Technology and Secured Transactions
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Query optimization by result caching in the stack-based approach
ICOODB'10 Proceedings of the Third international conference on Objects and databases
Scale and concurrency of GIGA+: file system directories with millions of files
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Boosting multi-core reachability performance with shared hash tables
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Query Optimization by Indexing in the ODRA OODBMS
Annales UMCS, Informatica
Query Optimization by Indexing in the ODRA OODBMS
Annales UMCS, Informatica
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
LHlf: lock-free linear hashing (poster paper)
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
FlashLight: A Lightweight Flash File System for Embedded Systems
ACM Transactions on Embedded Computing Systems (TECS)
Scalable load balancing in cluster storage systems
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Distributed memory virtualization with the use of SDDSfL
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Scalable load balancing in cluster storage systems
Proceedings of the 12th International Middleware Conference
Toward millions of file system IOPS on low-cost, commodity hardware
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
RCached-tree: an index structure for efficiently answering popular queries
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Linear hashing is a hashing in which the address space may grow or shrink dynamically. A file or a table may then support any number of insertions or deletions without access or memory load performance deterioration. A record in the file is, in general, found in one access, while the load may stay practically constant up to 90 %. A record in a table is found in a mean of 1.7 accesses, while the load is constantly 80 %. No other algorithms attaining such a performance are known.