On the public citation graph

Metadata Partitioning for Large-Scale Distributed Storage Systems

0 signed · 23 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0166-218x(99)00125-0openalex-snapshot
Tree partitioning under constraints — clustering for vehicle routing problems
inferredcites →https://doi.org/10.1109/12.54838openalex-snapshot
Coda: a highly available file system for a distributed workstation environment
inferredcites →https://doi.org/10.1145/1925805.1925816openalex-snapshot
The SDSC storage resource broker
inferredcites →https://doi.org/10.1145/322234.322236openalex-snapshot
Max-Min Tree Partitioning
inferredcites →https://doi.org/10.1145/322290.322294openalex-snapshot
A Shifting Algorithm for Min-Max Tree Partitioning
inferredcites →https://doi.org/10.1147/rd.183.0217openalex-snapshot
Efficient Algorithm for the Partitioning of Trees
inferredcites →https://doi.org/10.5555/1182635.1164137openalex-snapshot
A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix
inferredcites →https://doi.org/10.5555/127787.127822openalex-snapshot
Optimal algorithms for tree partitioning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-29216-3_3openalex-snapshot
A Dynamic Semantic Metadata Model in Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-41674-3_167openalex-snapshot
Data Security in Cloud for Health Care Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-54525-2_25openalex-snapshot
Metadata Attribute Based Cipher-Key Generation System in Cloud
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_45openalex-snapshot
Algorithms for 2-Balanced Connected k-Partition Problem in Graphs
inferred← citeshttps://doi.org/10.1007/s10845-015-1076-yopenalex-snapshot
‘MaaS’: fast retrieval of E-file in cloud using metadata as a service
inferred← citeshttps://doi.org/10.1007/s10878-025-01332-0openalex-snapshot
Algorithms for 2-balanced connected k-partition problem in graphs
inferred← citeshttps://doi.org/10.1007/s13369-015-1652-7openalex-snapshot
‘MaaS’: Fast Retrieval of Data in Cloud Using Metadata as a Service
inferred← citeshttps://doi.org/10.1109/wisa.2013.67openalex-snapshot
A Multi-source Data Organization and Management Method for Intelligent Transportation
inferred← citeshttps://doi.org/10.14257/ijsia.2014.8.3.37openalex-snapshot
Metadata Driven Efficient CRE based Cipher Key Generation and Distribution in Cloud Security
inferred← citeshttps://doi.org/10.1504/ijhpcn.2017.083217openalex-snapshot
Bloom filter-based framework for cache management in large cloud metadata databases
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.270openalex-snapshot
An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20420openalex-snapshot
A Little Charity Guarantees Fair Connected Graph Partitioning
inferred← citeshttps://doi.org/10.1631/fitee.1900121openalex-snapshot
MDLB: a metadata dynamic load balancing mechanism based on reinforcement learning
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2013.04177openalex-snapshot
Adaptive Metadata Load Balancing for Object Storage Systems
inferred← citeshttps://doi.org/10.3844/jcssp.2014.1929.1938openalex-snapshot
METADATA DRIVEN EFFICIENT KEY GENERATION AND DISTRIBUTION IN CLOUD SECURITY
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.