On the public citation graph
Dynamic hashing
0 signed · 172 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1145/362686.362693openalex-snapshot
File structures using hashing functions
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-oopenalex-snapshot
Parallel join for IBGF partitioned relational databases
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1982.tb03434.xopenalex-snapshot
Database Systems: Database Administration System-Architecture and Design Issues
inferred← citeshttps://doi.org/10.1002/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferred← citeshttps://doi.org/10.1002/spe.4380120206openalex-snapshot
A function for generating nearly balanced binary search trees from sets of non‐random keys
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_53openalex-snapshot
Trees as data and file structures
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_100openalex-snapshot
Methods in the analysis of algorithms : Evaluations of a recursive partitioning process
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_87openalex-snapshot
Grid file algorithms: An analysis in the biased case
inferred← citeshttps://doi.org/10.1007/3-540-51295-0_126openalex-snapshot
A language for the p-ary trees
inferred← citeshttps://doi.org/10.1007/3-540-54414-3_38openalex-snapshot
Grow and post index trees: Role, techniques and future potential
inferred← citeshttps://doi.org/10.1007/3-540-57301-1_7openalex-snapshot
Design and implementation of DDH: A distributed dynamic hashing algorithm
inferred← citeshttps://doi.org/10.1007/978-1-349-21151-7_6openalex-snapshot
Abstract Data Type Sets—II
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_3openalex-snapshot
Fundamental Access Methods
inferred← citeshttps://doi.org/10.1007/978-1-4613-1679-4_25openalex-snapshot
MACH: Much Faster Associative Machine
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_44openalex-snapshot
Data Organization Method for the Parallel Execution of Relational Operations
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_5openalex-snapshot
Hash-Based File Organization Utilizing Large Capacity Main Memory
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_6openalex-snapshot
Trie Hashing : Further Properties and Performance
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_36openalex-snapshot
Discrete Optimization using String Encodings for the Synthesis of Complete Chemical Processes
inferred← citeshttps://doi.org/10.1007/978-1-4684-6371-2_5openalex-snapshot
The Hash Table Abstraction
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_6openalex-snapshot
Graph Clustering and Caching
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_3openalex-snapshot
Arbres, algorithmes et données
inferred← citeshttps://doi.org/10.1007/978-3-540-39737-3_28openalex-snapshot
A Robust Scheme for Multilevel Extendible Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-69419-6_18openalex-snapshot
Adaptive Segmentation Schemes for Large Relational Database Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-77605-2_12openalex-snapshot
How to Split Buckets in Spatial Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-95388-0_3openalex-snapshot
Realisierung von operationalen Schnittstellen
inferred← citeshttps://doi.org/10.1007/978-3-662-05300-3_12openalex-snapshot
Scalable Storage for Digital Libraries
inferred← citeshttps://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferred← citeshttps://doi.org/10.1007/bf00276022openalex-snapshot
Modeling splits in file structures
inferred← citeshttps://doi.org/10.1007/bf00996923openalex-snapshot
Multidimensional extendible hashing for partial-match queries
inferred← citeshttps://doi.org/10.1007/bf01932837openalex-snapshot
Tightly controlled linear hashing without separate overflow storage
inferred← citeshttps://doi.org/10.1007/bf01932839openalex-snapshot
Order preserving extendible hashing and bucket tries
inferred← citeshttps://doi.org/10.1007/bf01941465openalex-snapshot
On the allocation of binary trees to secondary storage
inferred← citeshttps://doi.org/10.1007/bf01990340openalex-snapshot
Single access hashing with overflow separators for dynamic files
inferred← citeshttps://doi.org/10.1007/bf02679623openalex-snapshot
Dynamical sources in information theory: A general analysis of trie structures
inferred← citeshttps://doi.org/10.1007/bfb0012773openalex-snapshot
A branching process arising in dynamic hashing, trie searching and polynomial factorization
inferred← citeshttps://doi.org/10.1007/bfb0014179openalex-snapshot
LH*lh: A scalable high performance data structure for switched multicomputers
inferred← citeshttps://doi.org/10.1007/bfb0015472openalex-snapshot
Three selected case studies in verification
inferred← citeshttps://doi.org/10.1007/bfb0022669openalex-snapshot
Trie partitioning process: Limiting distributions
inferred← citeshttps://doi.org/10.1007/s11265-016-1139-0openalex-snapshot
An Efficient GPU-Based Multiple Pattern Matching Algorithm for Packet Filtering
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90033-8openalex-snapshot
On the average height of trees in digital search and dynamic hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90123-6openalex-snapshot
On the use of Extendible Hashing without hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90101-8openalex-snapshot
Approximate storage utilization of B-trees
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90058-0openalex-snapshot
Implicit data structures for linear hashing schemes
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90118-sopenalex-snapshot
Performance analysis of a main memory multi-directory hashing technique
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00189-1openalex-snapshot
A uniform model for the storage utilization of B-tree-like structures
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00048-topenalex-snapshot
Climbing hashing for expansible files
inferred← citeshttps://doi.org/10.1016/0169-023x(88)90004-3openalex-snapshot
Issues in relational database performance (invited paper ISDBMS)
inferred← citeshttps://doi.org/10.1016/0169-023x(90)90001-topenalex-snapshot
Heuristics and multi-dimensional physical database design: An experimental KBS
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00306-4openalex-snapshot
On the variance of a class of inductive valuations of data structures for digital search
inferred← citeshttps://doi.org/10.1016/0306-4379(81)90032-6openalex-snapshot
Computed chaining—A hybrid of direct chaining and open addressing
inferred← citeshttps://doi.org/10.1016/0306-4379(84)90024-3openalex-snapshot
A pruned TRIE to index a sorted file and its evaluation
inferred← citeshttps://doi.org/10.1016/0306-4379(88)90004-xopenalex-snapshot
Partitioned storage for temporal databases
inferred← citeshttps://doi.org/10.1016/0306-4379(88)90030-0openalex-snapshot
Concurrency in extendible hashing
inferred← citeshttps://doi.org/10.1016/0306-4379(92)90028-lopenalex-snapshot
File organizations with shared overflow blocks for variable length objects
inferred← citeshttps://doi.org/10.1016/0306-4379(92)90032-iopenalex-snapshot
Linear-density hashing with dynamic overflow sharing
inferred← citeshttps://doi.org/10.1016/0306-4379(93)90041-xopenalex-snapshot
Optimal MMI file systems for orthogonal range retrieval
inferred← citeshttps://doi.org/10.1016/0306-4379(94)90005-1openalex-snapshot
Performance of linear hashing schemes for primary key retrieval
inferred← citeshttps://doi.org/10.1016/b978-0-08-034094-4.50030-9openalex-snapshot
Analysis references
inferred← citeshttps://doi.org/10.1016/b978-0-12-037101-3.50008-9openalex-snapshot
Adaptive Optimal Segmentation Schemes for Multiattribute Files
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0749-0.50010-8openalex-snapshot
Data structures and algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0813-8.50017-4openalex-snapshot
Data structures and algorithms
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1313-2.50025-1openalex-snapshot
Locally Balanced Compact Trie Hashing
inferred← citeshttps://doi.org/10.1016/j.cpc.2014.04.005openalex-snapshot
OFF, Open source Finite volume Fluid dynamics code: A free, high-order solver based on parallel, modular, object-oriented Fortran API
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.12.012openalex-snapshot
Universal hash functions for an infinite universe and hash trees
inferred← citeshttps://doi.org/10.1016/s0169-023x(01)00005-2openalex-snapshot
Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73107-4openalex-snapshot
Algebraic Methods for Trie Statistics
inferred← citeshttps://doi.org/10.1016/s0950-5849(97)00035-9openalex-snapshot
Linearity in directory growth of the multilevel grid file
inferred← citeshttps://doi.org/10.1017/s0963548304006200openalex-snapshot
Concentration of Size and Path Length of Tries
inferred← citeshttps://doi.org/10.1051/ita/1996300504431openalex-snapshot
On the Horton-Strahler number for random tries
inferred← citeshttps://doi.org/10.1093/comjnl/25.3.358openalex-snapshot
Binary-Relational Storage Structures
inferred← citeshttps://doi.org/10.1093/comjnl/40.7.416openalex-snapshot
Optimal Clustering of Relations to Improve Sorting and Partitioning for Joins
inferred← citeshttps://doi.org/10.1109/32.6184openalex-snapshot
Gray codes for partial match and range queries
inferred← citeshttps://doi.org/10.1109/52.17804openalex-snapshot
Multikey, extensible hashing for relational databases
inferred← citeshttps://doi.org/10.1109/69.124898openalex-snapshot
New order preserving access methods for very large files derived from linear hashing
inferred← citeshttps://doi.org/10.1109/69.567061openalex-snapshot
Alternating hashing for expansible files
inferred← citeshttps://doi.org/10.1109/69.824617openalex-snapshot
Linear spiral hashing for expansible files
inferred← citeshttps://doi.org/10.1109/69.87965openalex-snapshot
An efficient file structure for document retrieval in the automated office environment
inferred← citeshttps://doi.org/10.1109/69.91065openalex-snapshot
Multilevel extendible hashing: a file structure for very large databases
inferred← citeshttps://doi.org/10.1109/artcom.2009.210openalex-snapshot
An Efficient Word Searching Algorithm through Splitting and Hashing the Offline Text
inferred← citeshttps://doi.org/10.1109/ccaa.2015.7148369openalex-snapshot
Efficient single pattern searching algorithm for offline text by using binary search tree (ESPS Algorithm)
inferred← citeshttps://doi.org/10.1109/cmpsac.1997.624796openalex-snapshot
EH/sup */-extendible hashing in a distributed environment
inferred← citeshttps://doi.org/10.1109/compcomm.2017.8322954openalex-snapshot
Parallel optimization of a type of dynamic hashing
inferred← citeshttps://doi.org/10.1109/dexa.1998.707416openalex-snapshot
Avoiding inference problem using page level security classification
inferred← citeshttps://doi.org/10.1109/icde.1986.7266231openalex-snapshot
An extension of access paths to improve joins and selections
inferred← citeshttps://doi.org/10.1109/icde.1986.7266242openalex-snapshot
Towards an implementation of database management systems with temporal support
inferred← citeshttps://doi.org/10.1109/icde.1987.7272348openalex-snapshot
Linear hashing with Priority Splitting: A method for improving the retrieval performance of linear hashing
inferred← citeshttps://doi.org/10.1109/icde.1987.7272370openalex-snapshot
An efficient file structure for document retrieval in the automated office environment
inferred← citeshttps://doi.org/10.1109/icde.1988.105506openalex-snapshot
Linearizing the directory growth in order preserving extendible hashing
inferred← citeshttps://doi.org/10.1109/icde.1989.47230openalex-snapshot
Key-sequential access methods for very large files derived from linear hashing
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346783openalex-snapshot
A linear hashing enabling efficient retrieval for range queries
inferred← citeshttps://doi.org/10.1109/icsmc.2010.5641860openalex-snapshot
A distributed linear hashing enabling efficient retrieval for range queries
inferred← citeshttps://doi.org/10.1109/parbse.1990.77141openalex-snapshot
A high speed KDL-RAM file system for parallel computers
inferred← citeshttps://doi.org/10.1109/samos.2013.6621118openalex-snapshot
Concurrent multi-level arrays: Wait-free extensible hash maps
inferred← citeshttps://doi.org/10.1109/sfcs.1983.79openalex-snapshot
Tree structures for partial match retrieval
inferred← citeshttps://doi.org/10.1109/tcom.1984.1096122openalex-snapshot
Computationally Optimal Metric-First Code Tree Search Algorithms
inferred← citeshttps://doi.org/10.1109/tkde.2002.1019221openalex-snapshot
Hashing methods for temporal data
inferred← citeshttps://doi.org/10.1109/tse.1980.230471openalex-snapshot
A Methodology for Structured Database Decomposition
inferred← citeshttps://doi.org/10.1109/tse.1982.236022openalex-snapshot
Analysis of Extendible Hashing
inferred← citeshttps://doi.org/10.1109/tse.1987.233515openalex-snapshot
On Multiple Random Accesses and Physical Data Placement in Dynamic Files
inferred← citeshttps://doi.org/10.1137/s009753979223023xopenalex-snapshot
The Joint Distribution of Elastic Buckets in Multiway Search Trees
inferred← citeshttps://doi.org/10.1142/s0218126615501285openalex-snapshot
h-Hash: A Hash Index Structure for Flash-Based Solid State Drives
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/114325.103714openalex-snapshot
A dynamic hash method with signature
inferred← citeshttps://doi.org/10.1145/12047.12048openalex-snapshot
Associative searching in multiple storage units
inferred← citeshttps://doi.org/10.1145/122045.122048openalex-snapshot
Performance comparison of extendible hashing and linear hashing techniques
inferred← citeshttps://doi.org/10.1145/130283.130317openalex-snapshot
Fast search in main memory databases
inferred← citeshttps://doi.org/10.1145/141484.130317openalex-snapshot
Fast search in main memory databases
inferred← citeshttps://doi.org/10.1145/16856.16877openalex-snapshot
Multiattribute hashing using Gray codes
inferred← citeshttps://doi.org/10.1145/236711.236713openalex-snapshot
LH*—a scalable, distributed data structure
inferred← citeshttps://doi.org/10.1145/3148.318987openalex-snapshot
Analysis of dynamic hashing with deferred splitting
inferred← citeshttps://doi.org/10.1145/3148011.3148031openalex-snapshot
Capturing Knowledge in Semantically-typed Relational Patterns to Enhance Relation Linking
inferred← citeshttps://doi.org/10.1145/319540.319564openalex-snapshot
New file organization based on dynamic hashing
inferred← citeshttps://doi.org/10.1145/319758.319760openalex-snapshot
A unifying model of physical databases
inferred← citeshttps://doi.org/10.1145/319758.319763openalex-snapshot
Performance analysis of linear hashing with partial expansions
inferred← citeshttps://doi.org/10.1145/319830.319837openalex-snapshot
Bounded index exponential hashing
inferred← citeshttps://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferred← citeshttps://doi.org/10.1145/3798055openalex-snapshot
Tapping the Potential of Spiral Storage for Persistent Memory
inferred← citeshttps://doi.org/10.1145/42267.42274openalex-snapshot
External hashing with limited internal storage
inferred← citeshttps://doi.org/10.1145/44498.44500openalex-snapshot
Linear hashing with separators—a dynamic hashing scheme achieving one-access
inferred← citeshttps://doi.org/10.1145/4879.5392openalex-snapshot
Modeling the storage architectures of commercial database systems
inferred← citeshttps://doi.org/10.1145/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
inferred← citeshttps://doi.org/10.1145/582192.582213openalex-snapshot
A high performance, universal, key associative access method
inferred← citeshttps://doi.org/10.1145/588058.588071openalex-snapshot
Storage mappings for multidimensional linear dynamic hashing
inferred← citeshttps://doi.org/10.1145/588111.588153openalex-snapshot
External hasing with limited internal storage
inferred← citeshttps://doi.org/10.1145/5922.5923openalex-snapshot
Order-preserving key transformations
inferred← citeshttps://doi.org/10.1145/602259.602275openalex-snapshot
A multikey hashing scheme using predicate trees
inferred← citeshttps://doi.org/10.1145/63500.63521openalex-snapshot
File organization using composite perfect hashing
inferred← citeshttps://doi.org/10.1145/78973.78979openalex-snapshot
Concurrent operations on extendible hashing and its performance
inferred← citeshttps://doi.org/10.1145/93597.98742openalex-snapshot
Linear clustering of objects with multiple attributes
inferred← citeshttps://doi.org/10.1145/971695.582213openalex-snapshot
A high performance, universal, key associative access method
inferred← citeshttps://doi.org/10.1145/971697.602275openalex-snapshot
A multikey hashing scheme using predicate trees
inferred← citeshttps://doi.org/10.1145/971701.50221openalex-snapshot
Optimal file distribution for partial match retrieval
inferred← citeshttps://doi.org/10.1145/99412.99462openalex-snapshot
Performance comparison of extendible hashing and linear hashing techniques
inferred← citeshttps://doi.org/10.1201/9781420069815-c6openalex-snapshot
Accelerating Queries on Very Large Datasets
inferred← citeshttps://doi.org/10.1205/026387698524587openalex-snapshot
The Generation and Use of Partial Solutions in Process Synthesis
inferred← citeshttps://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
inferred← citeshttps://doi.org/10.13140/rg.2.2.26693.58089openalex-snapshot
Practical Dynamic Transactional Data Structures
inferred← citeshttps://doi.org/10.17762/ijritcc.v4i6.2379openalex-snapshot
A Survey of Hashing Techniques for High Performance Computing
inferred← citeshttps://doi.org/10.4047/jap.2014.6.5.351openalex-snapshot
Characteristics and response of mouse bone marrow derived novel low adherent mesenchymal stem cells acquired by quantification of extracellular matrix
inferred← citeshttps://doi.org/10.4108/icst.infoscale2008.3554openalex-snapshot
Dynamic Data Organization for Bitmap Indices
inferred← citeshttps://doi.org/10.4108/icst.mobiquitous2008.3556openalex-snapshot
How to Edit Gigabyte XML Files on a Mobile Phone with XAS, RefTrees, and RAXS
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.