On the public citation graph
BRGP: a balanced RDF graph partitioning algorithm for cloud storage
0 signed · 43 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.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/978-3-319-18422-7_23openalex-snapshot
RDF Graph Partitions: A Brief Survey
inferredcites →https://doi.org/10.1007/978-3-642-17746-0_27openalex-snapshot
SPARQL Query Optimization on Top of DHTs
inferredcites →https://doi.org/10.1007/978-3-642-21064-8_10openalex-snapshot
The Design and Implementation of Minimal RDFS Backward Reasoning in 4store
inferredcites →https://doi.org/10.1007/s00778-014-0364-zopenalex-snapshot
RDF in the clouds: a survey
inferredcites →https://doi.org/10.1007/s11704-015-4104-3openalex-snapshot
RDF partitioning for scalable SPARQL query processing
inferredcites →https://doi.org/10.1016/j.is.2013.07.001openalex-snapshot
SPARQL in the cloud using Rya
inferredcites →https://doi.org/10.1016/j.jpdc.2014.09.012openalex-snapshot
Multi-threaded modularity based graph clustering using the multilevel paradigm
inferredcites →https://doi.org/10.1016/j.websem.2005.06.005openalex-snapshot
LUBM: A benchmark for OWL knowledge base systems
inferredcites →https://doi.org/10.1103/physreve.69.026113openalex-snapshot
Finding and evaluating community structure in networks
inferredcites →https://doi.org/10.1103/physreve.76.036106openalex-snapshot
Near linear time algorithm to detect community structures in large-scale networks
inferredcites →https://doi.org/10.1109/12.508322openalex-snapshot
Genetic algorithm and graph partitioning
inferredcites →https://doi.org/10.1109/bigdata.2014.7004274openalex-snapshot
Rainbow: A distributed and hierarchical RDF triple store with dynamic scalability
inferredcites →https://doi.org/10.1109/cloud.2013.63openalex-snapshot
Efficient and Customizable Data Partitioning Framework for Distributed Big RDF Data Processing in the Cloud
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1109/icde.2009.28openalex-snapshot
SP^2Bench: A SPARQL Performance Benchmark
inferredcites →https://doi.org/10.1109/icde.2014.6816682openalex-snapshot
How to partition a billion-node graph
inferredcites →https://doi.org/10.1109/icde.2015.7113334openalex-snapshot
Scalable SPARQL querying using path partitioning
inferredcites →https://doi.org/10.1109/icdew.2013.6547414openalex-snapshot
WARP: Workload-aware replication and partitioning for RDF
inferredcites →https://doi.org/10.1109/tkde.2011.103openalex-snapshot
Heuristics-Based Query Processing for Large RDF Graphs Using Cloud Computing
inferredcites →https://doi.org/10.1126/science.1242072openalex-snapshot
Clustering by fast search and find of density peaks
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1996014.1996021openalex-snapshot
Clause-iteration with MapReduce to scalably query datagraphs in the SHARD graph-store
inferredcites →https://doi.org/10.1145/2087522.2087527openalex-snapshot
Efficient processing of RDF graph pattern matching on MapReduce platforms
inferredcites →https://doi.org/10.1145/224170.224228openalex-snapshot
A multilevel algorithm for partitioning graphs
inferredcites →https://doi.org/10.1145/2588555.2588891openalex-snapshot
Cloud-based RDF data management
inferredcites →https://doi.org/10.14778/2556549.2556571openalex-snapshot
Scaling queries over big RDF graphs with semantic hash partitioning
inferredcites →https://doi.org/10.14778/3402707.3402747openalex-snapshot
Scalable SPARQL querying of large RDF graphs
inferredcites →https://doi.org/10.2307/2348448openalex-snapshot
Optimization Using Simulated Annealing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4215openalex-snapshot
Special issue on Big Data Security and Intelligent Data in Clouds ( BDS‐IDC )
inferred← citeshttps://doi.org/10.1002/cpe.4404openalex-snapshot
A distributed parallel algorithm for inferring hierarchical groups from large‐scale text corpuses
inferred← citeshttps://doi.org/10.1007/978-3-030-04284-4_10openalex-snapshot
SPARQ$$\lambda $$: A Functional Perspective on Linked Data Services
inferred← citeshttps://doi.org/10.1007/978-3-030-12388-8_57openalex-snapshot
SPARQ $$\lambda $$ λ : SPARQL as a Function
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100309openalex-snapshot
Storage, partitioning, indexing and retrieval in Big RDF frameworks: A survey
inferred← citeshttps://doi.org/10.1016/j.datak.2023.102239openalex-snapshot
An efficient and scalable SPARQL query processing framework for big data using MapReduce and hybrid optimum load balancing
inferred← citeshttps://doi.org/10.1016/j.future.2019.07.014openalex-snapshot
Placing big graph into cloud for parallel processing with a two-phase community-aware approach
inferred← citeshttps://doi.org/10.1109/access.2018.2833480openalex-snapshot
A Partitioning and Index Algorithm for RDF Data of Cloud-Based Robotic Systems
inferred← citeshttps://doi.org/10.1145/3368756.3369047openalex-snapshot
A categorization of RDF triplestores
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2359904/v1openalex-snapshot
Approximate Big Graph Partitioning
inferred← citeshttps://doi.org/10.22266/ijies2018.0228.09openalex-snapshot
Cloud Based RDF Security: A Secured Data Model for Cloud Computing
inferred← citeshttps://doi.org/10.3390/app12010122openalex-snapshot
An Efficient Distributed SPARQL Query Processing Scheme Considering Communication Costs in Spark Environments
inferred← citeshttps://doi.org/10.3390/sym11070926openalex-snapshot
Dynamic Partitioning Supporting Load Balancing for Distributed RDF Graph Stores
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.