On the public citation graph
Storage efficient replicated databases
0 signed · 34 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-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1016/0020-0255(89)90023-6openalex-snapshot
Two phase gossip: Managing distributed event histories
inferredcites →https://doi.org/10.1093/oso/9780198534891.001.0001openalex-snapshot
Symmetric Functions and Hall Polynomials
inferredcites →https://doi.org/10.1109/32.16608openalex-snapshot
Performance characterization of quorum-consensus algorithms for replicated data
inferredcites →https://doi.org/10.1145/10590.10593openalex-snapshot
Highly available distributed services and fault-tolerant distributed garbage collection
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/356842.356846openalex-snapshot
Concurrency Control in Distributed Database Systems
inferredcites →https://doi.org/10.1145/357162.357163openalex-snapshot
Synchronization in Distributed Programs
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/5505.5508openalex-snapshot
Consistency in a partitioned network: a survey
inferredcites →https://doi.org/10.1145/588111.588124openalex-snapshot
Sacrificing serializability to attain high availability of data in an unreliable network
inferredcites →https://doi.org/10.1145/6306.6309openalex-snapshot
Low cost management of replicated data in fault-tolerant distributed systems
inferredcites →https://doi.org/10.1145/65000.65001openalex-snapshot
Preserving and using context information in interprocess communication
inferredcites →https://doi.org/10.1145/66926.67809openalex-snapshot
A static pessimistic scheme for handling replicated databases
inferredcites →https://doi.org/10.1145/67544.67809openalex-snapshot
A static pessimistic scheme for handling replicated databases
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1145/800221.806714openalex-snapshot
The failure and recovery problem for replicated databases
inferredcites →https://doi.org/10.1145/800222.806750openalex-snapshot
Efficient solutions to the replicated log and dictionary problems
inferredcites →https://doi.org/10.2140/pjm.1970.34.709openalex-snapshot
Permutations, matrices, and generalized Young tableaux
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-48309-8_72openalex-snapshot
Availability and Reliability Issues in Distributed Databases Using Optimal Horizontal Fragmentation
inferred← citeshttps://doi.org/10.1007/bf00119337openalex-snapshot
A performance model of a design for a minimally replicated distributed database for database-driven telecommunications services
inferred← citeshttps://doi.org/10.1093/comjnl/34.6.534openalex-snapshot
Efficient Dissemination of Information in Computer Networks
inferred← citeshttps://doi.org/10.1109/24.295014openalex-snapshot
Order-P: an algorithm to order network partitionings
inferred← citeshttps://doi.org/10.1109/69.277777openalex-snapshot
Storage efficient and secure replicated distributed databases
inferred← citeshttps://doi.org/10.1109/71.372774openalex-snapshot
Coding-based replication schemes for distributed systems
inferred← citeshttps://doi.org/10.1109/71.89063openalex-snapshot
A nonblocking quorum consensus protocol for replicated data
inferred← citeshttps://doi.org/10.1109/hicss.1994.323253openalex-snapshot
Using extended hierarchical quorum consensus to control replicated data: from traditional voting to logical structures
inferred← citeshttps://doi.org/10.1109/icc.1992.268093openalex-snapshot
Order-P: an algorithm to order network partitionings
inferred← citeshttps://doi.org/10.1109/tkde.2003.1232274openalex-snapshot
Epidemic algorithms for replicated databases
inferred← citeshttps://doi.org/10.1145/137097.137858openalex-snapshot
Distributed algorithms for dynamic replication of data
inferred← citeshttps://doi.org/10.1145/263661.263680openalex-snapshot
Epidemic algorithms in replicated databases (extended abstract)
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.