On the public citation graph
LH*lh: A scalable high performance data structure for switched multicomputers
0 signed · 31 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/3-540-11980-9_23openalex-snapshot
Relational algebra machine GRACE
inferredcites →https://doi.org/10.1007/3-540-57301-1_7openalex-snapshot
Design and implementation of DDH: A distributed dynamic hashing algorithm
inferredcites →https://doi.org/10.1007/978-3-030-26253-2openalex-snapshot
Principles of Distributed Database Systems
inferredcites →https://doi.org/10.1145/191839.191889openalex-snapshot
Distributed file organization with scalable cost/performance
inferredcites →https://doi.org/10.1145/191839.191891openalex-snapshot
Distributing a search tree among a growing number of processors
inferredcites →https://doi.org/10.1145/236711.236713openalex-snapshot
LH*—a scalable, distributed data structure
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_27openalex-snapshot
Evaluation of LH*LH for a Multicomputer Architecture
inferred← citeshttps://doi.org/10.1007/978-1-4615-1379-7_21openalex-snapshot
HQT*: A Scalable Distributed Data Structure for High-Performance Spatial Accesses
inferred← citeshttps://doi.org/10.1007/978-3-540-71661-7_9openalex-snapshot
A Content–Addressable Network for Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-72905-1_17openalex-snapshot
EH*RS: A High-Availability Scalable Distributed Data Structure
inferred← citeshttps://doi.org/10.1007/978-3-662-05300-3_12openalex-snapshot
Scalable Storage for Digital Libraries
inferred← citeshttps://doi.org/10.1007/978-3-662-05300-3_13openalex-snapshot
Object Repositories for Digital Libraries
inferred← citeshttps://doi.org/10.1109/coopis.1996.555011openalex-snapshot
High-availability LH* schemes with mirroring
inferred← citeshttps://doi.org/10.1109/icpads.2000.857715openalex-snapshot
Improving performance of parallel transaction processing systems by balancing data load on line
inferred← citeshttps://doi.org/10.1109/tkde.2002.1019223openalex-snapshot
LH*g: a high-availability scalable distributed data structure by record grouping
inferred← citeshttps://doi.org/10.1109/uic-atc-scalcom-cbdcom-iop-smartworld.2016.0185openalex-snapshot
Dynamic Range Partitioning with Asynchronous Data Balancing
inferred← citeshttps://doi.org/10.1145/1093382.1093386openalex-snapshot
LH* RS ---a highly-available scalable distributed data structure
inferred← citeshttps://doi.org/10.1145/372202.372458openalex-snapshot
Performance evaluation of the LH*lh scalable, distributed data structure for a cluster of workstations
inferred← citeshttps://doi.org/10.1504/ijitst.2010.031470openalex-snapshot
LH*RSP2P: a fast and high churn resistant scalable distributed data structure for P2P systems
inferred← citeshttps://doi.org/10.26083/tuprints-00000864openalex-snapshot
A Model Driven Architecture for Adaptable Overlay Networks
inferred← citeshttps://doi.org/10.48084/etasr.9648openalex-snapshot
Design and Implementation of a ROLAP Cube in Scalable Distributed Data Structure
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0439openalex-snapshot
TH*:Scalable Distributed Trie Hashing
inferred← citeshttps://doi.org/10.48550/arxiv.1412.4353openalex-snapshot
LH*TH: New fast Scalable Distributed Data Structures (SDDS)
inferred← citeshttps://doi.org/10.5555/1251229.1251251openalex-snapshot
Scalable, distributed data structures for internet service construction
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.