On the public citation graph

Vertical Fragmentation and Allocation in Distributed Databases with Site Capacity Restrictions Using the Threshold Accepting Algorithm

0 signed · 15 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.1080/07391102.1992.10507969openalex-snapshot
The Multiple-Minima Problem in Small Peptides Revisited. The Threshold Accepting Approach
inferredcites →https://doi.org/10.1109/hicss.1992.183497openalex-snapshot
A semantics-based methodology for integrated computer-aided distributed database design
inferredcites →https://doi.org/10.1109/icci.1993.315314openalex-snapshot
On data allocation with minimum overall communication costs in distributed database design

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11533962_4openalex-snapshot
An Approach for Solving Very Large Scale Instances of the Design Distribution Problem for Distributed Database Systems
inferred← citeshttps://doi.org/10.1007/11576235_69openalex-snapshot
Distribution Design in Distributed Databases Using Clustering to Solve Large Instances
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_15openalex-snapshot
Adaptive and Scalable Allocation of Data-Objects in the Web
inferred← citeshttps://doi.org/10.1007/978-3-540-39853-0_13openalex-snapshot
Adaptive Allocation of Data-Objects in the Web Using Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_52openalex-snapshot
Data-Object Replication, Distribution, and Mobility in Network Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-85863-8_72openalex-snapshot
Modeling the Nonlinear Nature of Response Time in the Vertical Fragmentation Design of Distributed Databases
inferred← citeshttps://doi.org/10.1007/s10115-011-0384-6openalex-snapshot
A new vertical fragmentation algorithm based on ant collective behavior in distributed database systems
inferred← citeshttps://doi.org/10.1016/j.cam.2013.09.057openalex-snapshot
Minimizing roundtrip response time in distributed databases with vertical fragmentation
inferred← citeshttps://doi.org/10.1016/j.jksuci.2018.09.020openalex-snapshot
Differential bond energy algorithm for optimal vertical fragmentation of distributed databases
inferred← citeshttps://doi.org/10.1016/j.knosys.2021.107325openalex-snapshot
Knowledge transfer-based distributed differential evolution for dynamic database fragmentation
inferred← citeshttps://doi.org/10.17533/udea.redin.16692openalex-snapshot
SIADBDD: An integrated tool to design distributed databases
inferred← citeshttps://doi.org/10.3390/e22121352openalex-snapshot
Application of Dynamic Fragmentation Methods in Multimedia Databases: A Review
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.