On the public citation graph

Fast Reachability Query Processing

0 signed · 31 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.1007/11687238_56openalex-snapshot
Fast Computation of Reachability Labeling for Large Graphs
inferredcites →https://doi.org/10.1007/3-540-36556-7_10openalex-snapshot
Assessing XML Data Management with XMark
inferredcites →https://doi.org/10.1007/3-540-36901-5_27openalex-snapshot
Verifying the Purchase Request in SET Protocol
inferredcites →https://doi.org/10.1007/978-3-540-24741-8_15openalex-snapshot
HOPI: An Efficient Connection Index for Complex XML Document Collections
inferredcites →https://doi.org/10.1007/978-3-540-30192-9_23openalex-snapshot
FliX: A Flexible Framework for Indexing Complex XML Document Collections
inferredcites →https://doi.org/10.1007/978-3-540-31849-1_28openalex-snapshot
Labeling Scheme and Structural Joins for Graph-Structured XML Data
inferredcites →https://doi.org/10.1007/s007780050083openalex-snapshot
Analysis of navigation behaviour in web sites integrating multiple information systems
inferredcites →https://doi.org/10.1016/b978-155860869-6/50031-7openalex-snapshot
Efficient Structural Joins on Indexed XML Documents
inferredcites →https://doi.org/10.1016/b978-155860869-6/50096-2openalex-snapshot
XMark
inferredcites →https://doi.org/10.1093/nar/gki108openalex-snapshot
EcoCyc: a comprehensive database resource for Escherichia coli
inferredcites →https://doi.org/10.1109/icde.2002.994704openalex-snapshot
Structural joins: a primitive for efficient XML query pattern matching
inferredcites →https://doi.org/10.1109/icde.2003.1260797openalex-snapshot
XR-tree: indexing XML data for efficient structural joins
inferredcites →https://doi.org/10.1109/icde.2005.57openalex-snapshot
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/1031570.1031576openalex-snapshot
An evaluation of XML indexes for structural join
inferredcites →https://doi.org/10.1145/66926.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.1145/67544.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.1145/959060.959080openalex-snapshot
Review of Data on the Web
inferredcites →https://doi.org/10.1186/gb-2004-6-1-r2openalex-snapshot
Computational prediction of human metabolic pathways from the complete human genome

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-1-4419-6045-0_6openalex-snapshot
Graph Reachability Queries: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-71703-4_4openalex-snapshot
Cost-Based Query Optimization for Multi Reachability Joins
inferred← citeshttps://doi.org/10.1007/s00778-009-0141-6openalex-snapshot
Optimizing updates of recursive XML views of relations
inferred← citeshttps://doi.org/10.1007/s00778-013-0346-6openalex-snapshot
Efficient processing of $$k$$ k -hop reachability queries
inferred← citeshttps://doi.org/10.1109/icde.2008.4497500openalex-snapshot
Fast Graph Pattern Matching
inferred← citeshttps://doi.org/10.1109/npc.2007.166openalex-snapshot
Querying Graph-Structured Data
inferred← citeshttps://doi.org/10.1109/tkde.2009.117openalex-snapshot
Incremental Maintenance of 2-Hop Labeling of Large Graphs
inferred← citeshttps://doi.org/10.1145/1367497.1367611openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferred← citeshttps://doi.org/10.1145/1988688.1988736openalex-snapshot
R 2 DF framework for ranked path queries over weighted RDF graphs
inferred← citeshttps://doi.org/10.14393/ufu.te.2023.460openalex-snapshot
Efficient dynamic data structures for reachability queries on large temporal graphs
inferred← citeshttps://doi.org/10.14778/2350229.2350247openalex-snapshot
K-reach
inferred← citeshttps://doi.org/10.32657/10356/42234openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
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.