On the public citation graph
Scan-Sharing for Optimizing RDF Graph Pattern Matching on MapReduce
0 signed · 30 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/978-3-642-21064-8_4openalex-snapshot
An Intermediate Algebra for Optimizing RDF Graph Pattern Matching on MapReduce
inferredcites →https://doi.org/10.1007/s00778-009-0165-yopenalex-snapshot
The RDF-3X engine for scalable management of RDF data
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.1145/1807167.1807273openalex-snapshot
A comparison of join algorithms for log processing in MaPreduce
inferredcites →https://doi.org/10.1145/1851476.1851591openalex-snapshot
Massive Semantic Web data compression with MapReduce
inferredcites →https://doi.org/10.1145/1940747.1940751openalex-snapshot
High-performance, massively scalable distributed systems using the MapReduce software framework
inferredcites →https://doi.org/10.14778/3402707.3402747openalex-snapshot
Scalable SPARQL querying of large RDF graphs
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-37450-0_18openalex-snapshot
Efficient SPARQL Query Evaluation via Automatic Data Partitioning
inferred← citeshttps://doi.org/10.1007/s00778-014-0364-zopenalex-snapshot
RDF in the clouds: a survey
inferred← citeshttps://doi.org/10.1007/s11704-015-4104-3openalex-snapshot
RDF partitioning for scalable SPARQL query processing
inferred← citeshttps://doi.org/10.1017/s0269888916000217openalex-snapshot
Storing massive Resource Description Framework (RDF) data: a survey
inferred← citeshttps://doi.org/10.1109/bigdata.congress.2013.53openalex-snapshot
Fast Quasi-biclique Mining with Giraph
inferred← citeshttps://doi.org/10.1109/ccgrid.2017.109openalex-snapshot
MapReduce-Based Algorithms for Managing Big RDF Graphs: State-of-the-Art Analysis, Paradigms, and Future Directions
inferred← citeshttps://doi.org/10.1109/icdew.2013.6547420openalex-snapshot
A vision for SPARQL multi-query optimization on MapReduce
inferred← citeshttps://doi.org/10.1145/3038912.3052655openalex-snapshot
Type-based Semantic Optimization for Scalable RDF Graph Pattern Matching
inferred← citeshttps://doi.org/10.1145/3295500.3356212openalex-snapshot
Semantic query transformations for increased parallelization in distributed knowledge graph query processing
inferred← citeshttps://doi.org/10.2200/s00986ed1v01y202001dtm062openalex-snapshot
Cloud-Based RDF Data Management
inferred← citeshttps://doi.org/10.3390/a9010007openalex-snapshot
An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.16openalex-snapshot
Scaling Unbound-Property Queries on Big RDF Data Warehouses using MapReduce
inferred← citeshttps://doi.org/10.70675/aa7ad4a5z0f8dz452bzbc99z7b352c0e9a2copenalex-snapshot
Scalable algorithms for cloud-based Semantic Web data management
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.