On the public citation graph

Towards an Efficient Data Fragmentation, Allocation, and Clustering Approach in a Distributed Environment

0 signed · 37 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.1002/cpe.4416openalex-snapshot
Dynamic data reallocation and replication over a cloud environment
inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1007/978-3-319-60663-7_28openalex-snapshot
Sequentially Grouping Items into Clusters of Unspecified Number
inferredcites →https://doi.org/10.1007/978-3-319-77818-1openalex-snapshot
Context-Aware Systems and Applications, and Nature of Computation and Communication
inferredcites →https://doi.org/10.1007/978-3-319-77818-1_16openalex-snapshot
Fragmentation in Distributed Database Design Based on KR Rough Clustering Technique
inferredcites →https://doi.org/10.1007/bf01267326openalex-snapshot
An objective function for vertically partitioning relations in distributed databases and its analysis
inferredcites →https://doi.org/10.1007/s11227-017-2182-8openalex-snapshot
A hybrid MapReduce-based k-means clustering using genetic algorithm for distributed datasets
inferredcites →https://doi.org/10.1016/j.asoc.2017.11.019openalex-snapshot
A new approach based on particle swarm optimization algorithm for solving data allocation problem
inferredcites →https://doi.org/10.1016/j.chb.2013.04.025openalex-snapshot
A synchronized design technique for efficient data distribution
inferredcites →https://doi.org/10.1016/j.chb.2013.04.026openalex-snapshot
Performance optimality enhancement algorithm in DDBS (POEA)
inferredcites →https://doi.org/10.1016/j.heliyon.2017.e00487openalex-snapshot
An optimized approach for simultaneous horizontal data fragmentation and allocation in Distributed Database Systems (DDBSs)
inferredcites →https://doi.org/10.1093/comjnl/bxw041openalex-snapshot
A Replication Scheme for Multiple Fragmentations with Overlapping Fragments
inferredcites →https://doi.org/10.1109/pdgc.2018.8745981openalex-snapshot
An Aggregated Similarity Based Hierarchical Clustering Technique for Relational DDBS Design
inferredcites →https://doi.org/10.1145/3150223openalex-snapshot
A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in Distributed Database Design
inferredcites →https://doi.org/10.1145/3213187.3293604openalex-snapshot
On an Effective Hierarchical Clustering Based Model for Data Fragmentation and Allocation in Relational DDBS
inferredcites →https://doi.org/10.4018/978-1-5225-7186-5openalex-snapshot
Semantic Web Science and Real-World Applications
inferredcites →https://doi.org/10.4018/978-1-5225-7186-5.ch006openalex-snapshot
Data Replication Impact on DDBS System Performance
inferredcites →https://doi.org/10.4018/ijswis.2017040103openalex-snapshot
A Novel Query-Driven Clustering-Based Technique for Vertical Fragmentation and Allocation in Distributed Database Systems

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-030-89909-7_5openalex-snapshot
A Brief Review of Vertical Fragmentation Methods Considering Multimedia Databases and Content-Based Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-73741-1_11openalex-snapshot
Challenges for AI in Healthcare Systems
inferred← citeshttps://doi.org/10.1007/978-981-19-2456-9_64openalex-snapshot
A Brief Comparison of K-means and Agglomerative Hierarchical Clustering Algorithms on Small Datasets
inferred← citeshttps://doi.org/10.1007/s42452-019-1787-3openalex-snapshot
Data allocation in distributed database systems: a novel hybrid method based on differential evolution and variable neighborhood search
inferred← citeshttps://doi.org/10.1016/j.heliyon.2020.e03172openalex-snapshot
ASGOP: An aggregated similarity-based greedy-oriented approach for relational DDBSs design
inferred← citeshttps://doi.org/10.1016/j.matpr.2020.08.492openalex-snapshot
Efficient separation and allocation of dataset in structured and unstructured databases
inferred← citeshttps://doi.org/10.1109/csci51800.2020.00073openalex-snapshot
An Interactive Data Assignment Algorithm for Non-Replicated DDBMSs
inferred← citeshttps://doi.org/10.1109/iccike47802.2019.9004233openalex-snapshot
A Review on Fragmentation, Allocation and Replication in Distributed Database Systems
inferred← citeshttps://doi.org/10.1109/ici53355.2022.9786886openalex-snapshot
Performance Analysis of Degree of Redundancy for Replication in Distributed Database System
inferred← citeshttps://doi.org/10.1109/mwscas47672.2021.9531836openalex-snapshot
Simplified-BBO for Non-redundant Allocation of Data in Distributed Database Design
inferred← citeshttps://doi.org/10.1145/3579142openalex-snapshot
Proceedings of the International Workshop on Big Data in Emergent Distributed Environments
inferred← citeshttps://doi.org/10.1145/3579142.3594293openalex-snapshot
Design of Highly Scalable Graph Database Systems without Exponential Performance Degradation
inferred← citeshttps://doi.org/10.1186/s40537-020-00306-9openalex-snapshot
On K-means clustering-based approach for DDBSs design
inferred← citeshttps://doi.org/10.21817/indjcse/2022/v13i3/221303165openalex-snapshot
AN IMPROVED VOGEL’S APPROXIMATION METHOD (IVAM) FOR FRAGMENT ALLOCATIONN AND REPLICATION IN DISTRIBUTED DATABASE SYSTEMS
inferred← citeshttps://doi.org/10.22247/ijcna/2020/205322openalex-snapshot
A Novel Fragmentation Scheme for Textual Data Using Similarity-Based Threshold Segmentation Method in Distributed Network Environment
inferred← citeshttps://doi.org/10.31449/inf.v46i2.3027openalex-snapshot
Formal Approach to Data Accuracy Evaluation
inferred← citeshttps://doi.org/10.3390/a18090554openalex-snapshot
Future Skills in the GenAI Era: A Labor Market Classification System Using Kolmogorov–Arnold Networks and Explainable AI
inferred← citeshttps://doi.org/10.3390/e22121352openalex-snapshot
Application of Dynamic Fragmentation Methods in Multimedia Databases: A Review
inferred← citeshttps://doi.org/10.37624/ijert/13.9.2020.2461-2473openalex-snapshot
SBBO Based Replicated Data Allocation Approach for Distributed Database Design
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.