On the public citation graph

Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard

0 signed · 134 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/978-3-540-88564-1_5openalex-snapshot

nSPARQL: A Navigational Language for RDF

inferredcites →https://doi.org/10.1007/978-3-642-04930-9_19openalex-snapshot

Executing SPARQL Queries over the Web of Linked Data

inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot

The Complexity of Computing the Permanent

inferredcites →https://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot

More complicated questions about maxima and minima, and some closures of NP

inferredcites →https://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot

A very hard log-space counting class

inferredcites →https://doi.org/10.1016/b978-155860869-6/50017-2openalex-snapshot

Efficient Algorithms for Processing XPath Queries

inferredcites →https://doi.org/10.1016/j.websem.2009.02.002openalex-snapshot

Extending SPARQL with regular expression patterns (for querying RDF)

inferredcites →https://doi.org/10.1016/j.websem.2010.01.002openalex-snapshot

nSPARQL: A navigational language for RDF

inferredcites →https://doi.org/10.1016/s0022-0000(05)80009-1openalex-snapshot

A taxonomy of complexity classes of functions

inferredcites →https://doi.org/10.1109/wi-iat.2010.144openalex-snapshot

The KGRAM Abstract Machine for Knowledge Graph Querying

inferredcites →https://doi.org/10.1137/s009753979122370xopenalex-snapshot

Finding Regular Simple Paths in Graph Databases

inferredcites →https://doi.org/10.1145/1013367.1013381openalex-snapshot

Jena

inferredcites →https://doi.org/10.1145/1114244.1114247openalex-snapshot

Conditional XPath

inferredcites →https://doi.org/10.1145/1567274.1567278openalex-snapshot

Semantics and complexity of SPARQL

inferredcites →https://doi.org/10.1145/1807085.1807089openalex-snapshot

Expressive languages for path queries over graph-structured data

inferredcites →https://doi.org/10.1145/2389241.2389250openalex-snapshot

Expressive Languages for Path Queries over Graph-Structured Data

inferredcites →https://doi.org/10.1145/303976.303996openalex-snapshot

Rewriting of regular expressions and regular path queries

inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot

The complexity of relational query languages (Extended Abstract)

inferredcites →https://doi.org/10.1307/mmj/1028998975openalex-snapshot

Transition graphs and the star-height of regular events.

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3199178openalex-extracted

inferred← citeshttps://doi.org/10.2139/ssrn.3199269openalex-extracted

LDQL: A Query Language for the Web of Linked Data

inferred← citeshttps://doi.org/10.1007/978-1-4614-6170-8_124openalex-snapshot

SPARQL

inferred← citeshttps://doi.org/10.1007/978-3-030-35514-2_19openalex-snapshot

Approximate Querying on Property Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_28openalex-snapshot

Formal Languages in Information Extraction and Graph Databases

inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_8openalex-snapshot

Knowledge Graphs: Research Directions

inferred← citeshttps://doi.org/10.1007/978-3-030-61133-0_7openalex-snapshot

Explaining Results of Path Queries on Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-61244-3_1openalex-snapshot

A Comparison of the Cognitive Difficulties Posed by SPARQL Query Constructs

inferred← citeshttps://doi.org/10.1007/978-3-030-77385-4_4openalex-snapshot

Processing SPARQL Property Path Queries Online with Web Preemption

inferred← citeshttps://doi.org/10.1007/978-3-031-46671-7_21openalex-snapshot

Efficient Regular Path Query Evaluation with Structural Path Constraints

inferred← citeshttps://doi.org/10.1007/978-3-319-18818-8_5openalex-snapshot

A Context-Based Semantics for SPARQL Property Paths Over the Web

inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_14openalex-snapshot

A Note on Decidable Separability by Piecewise Testable Languages

inferred← citeshttps://doi.org/10.1007/978-3-319-25007-6_1openalex-snapshot

SPARQL with Property Paths

inferred← citeshttps://doi.org/10.1007/978-3-319-25007-6_5openalex-snapshot

LDQL: A Query Language for the Web of Linked Data

inferred← citeshttps://doi.org/10.1007/978-3-319-32667-2_6openalex-snapshot

Discovering Wikipedia Conventions Using DBpedia Properties

inferred← citeshttps://doi.org/10.1007/978-3-319-46565-4_15openalex-snapshot

Top-K Shortest Paths in Large Typed RDF Datasets Challenge

inferred← citeshttps://doi.org/10.1007/978-3-319-61164-8_1openalex-snapshot

Declarative Multidimensional Graph Queries

inferred← citeshttps://doi.org/10.1007/978-3-319-91452-7_49openalex-snapshot

Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-32925-8_4openalex-snapshot

How (Well) Do Datalog, SPARQL and RIF Interplay?

inferred← citeshttps://doi.org/10.1007/978-3-642-33158-9_3openalex-snapshot

Federation and Navigation in SPARQL 1.1

inferred← citeshttps://doi.org/10.1007/978-3-642-35173-0_12openalex-snapshot

Using SPARQL to Query BioPortal Ontologies and Metadata

inferred← citeshttps://doi.org/10.1007/978-3-642-35176-1_40openalex-snapshot

SRBench: A Streaming RDF/SPARQL Benchmark

inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_16openalex-snapshot

Efficient Separability of Regular Languages by Subsequences and Suffixes

inferred← citeshttps://doi.org/10.1007/978-3-642-39992-3_4openalex-snapshot

Counting in SPARQL Property Paths: Perspectives from Theory and Practice

inferred← citeshttps://doi.org/10.1007/978-3-642-41360-5_6openalex-snapshot

SRelation: Fast RDF Graph Traversal

inferred← citeshttps://doi.org/10.1007/978-3-662-58415-6_3openalex-snapshot

Statistical Relation Cardinality Bounds in Knowledge Bases

inferred← citeshttps://doi.org/10.1007/s00224-017-9802-9openalex-snapshot

Complexity and Expressive Power of Weakly Well-Designed SPARQL

inferred← citeshttps://doi.org/10.1007/s00778-023-00811-2openalex-snapshot

Optimizing RPQs over a compact graph representation

inferred← citeshttps://doi.org/10.1007/s11280-019-00739-0openalex-snapshot

Distributed Pregel-based provenance-aware regular path query processing on RDF knowledge graphs

inferred← citeshttps://doi.org/10.1007/s11280-021-00965-5openalex-snapshot

Efficient distributed path computation on RDF knowledge graphs using partial evaluation

inferred← citeshttps://doi.org/10.1007/s12209-013-2137-yopenalex-snapshot

Adapting property path for polynomial-time evaluation and reasoning on semantic web

inferred← citeshttps://doi.org/10.1007/s12209-015-2460-6openalex-snapshot

Efficient path query and reasoning method based on rare axis

inferred← citeshttps://doi.org/10.1016/b978-0-12-809633-8.20394-4openalex-snapshot

Ontology: Querying Languages and Development

inferred← citeshttps://doi.org/10.1016/b978-0-323-95502-7.00344-4openalex-snapshot

Ontology: Definition languages

inferred← citeshttps://doi.org/10.1016/j.datak.2020.101798openalex-snapshot

Top- k user-specified preferred answers in massive graph databases

inferred← citeshttps://doi.org/10.1016/j.jcss.2019.08.006openalex-snapshot

A trichotomy for regular simple path queries on graphs

inferred← citeshttps://doi.org/10.1016/j.websem.2014.11.003openalex-snapshot

On the formulation of performant SPARQL queries

inferred← citeshttps://doi.org/10.1016/j.websem.2016.10.001openalex-snapshot

LDQL: A query language for the Web of Linked Data

inferred← citeshttps://doi.org/10.1080/11663081.2013.798992openalex-snapshot

On the relation between SPARQL1.1 and Answer Set Programming

inferred← citeshttps://doi.org/10.1108/ijwis-05-2013-0013openalex-snapshot

Constrained regular expressions for answering RDF-path queries modulo RDFS

inferred← citeshttps://doi.org/10.1109/icde.2014.6816640openalex-snapshot

Query optimization of distributed pattern matching

inferred← citeshttps://doi.org/10.1109/tkde.2017.2716939openalex-snapshot

Fast Parallel Path Concatenation for Graph Extraction

inferred← citeshttps://doi.org/10.1109/tkde.2022.3161375openalex-snapshot

Reachability Queries with Label and Substructure Constraints on Knowledge Graphs

inferred← citeshttps://doi.org/10.1109/wi-iat.2012.227openalex-snapshot

From DBpedia to Wikipedia: Filling the Gap by Discovering Wikipedia Conventions

inferred← citeshttps://doi.org/10.1145/2213556.2213573openalex-snapshot

The complexity of evaluating path expressions in SPARQL

inferred← citeshttps://doi.org/10.1145/2213598.2213609openalex-snapshot

Foundations of regular expressions in XML schema languages and SPARQL

inferred← citeshttps://doi.org/10.1145/2430456.2430458openalex-snapshot

Querying Semantic Data on the Web?

inferred← citeshttps://doi.org/10.1145/2448496.2448512openalex-snapshot

Walk logic as a framework for path query languages on graph databases

inferred← citeshttps://doi.org/10.1145/2457317.2457353openalex-snapshot

On implementing provenance-aware regular path queries with relational query engines

inferred← citeshttps://doi.org/10.1145/2463664.2465216openalex-snapshot

Querying graph databases

inferred← citeshttps://doi.org/10.1145/2463664.2467795openalex-snapshot

A trichotomy for regular simple path queries on graphs

inferred← citeshttps://doi.org/10.1145/2464464.2464515openalex-snapshot

BlueFinder

inferred← citeshttps://doi.org/10.1145/2484425.2484443openalex-snapshot

Sparqling kleene

inferred← citeshttps://doi.org/10.1145/2488388.2488426openalex-snapshot

PrefixSolve

inferred← citeshttps://doi.org/10.1145/2494529openalex-snapshot

The complexity of regular expressions and property paths in SPARQL

inferred← citeshttps://doi.org/10.1145/2613087.2613092openalex-snapshot

Towards fine grained RDF access control

inferred← citeshttps://doi.org/10.1145/2736277.2741142openalex-snapshot

SCULPT

inferred← citeshttps://doi.org/10.1145/2872427.2883022openalex-snapshot

Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1

inferred← citeshttps://doi.org/10.1145/2902251.2902298openalex-snapshot

Designing a Query Language for RDF

inferred← citeshttps://doi.org/10.1145/3078714.3078731openalex-snapshot

Evaluating Navigational RDF Queries over the Web

inferred← citeshttps://doi.org/10.1145/3083898openalex-snapshot

Query Nesting, Assignment, and Aggregation in SPARQL 1.1

inferred← citeshttps://doi.org/10.1145/3093754.3093759openalex-snapshot

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data

inferred← citeshttps://doi.org/10.1145/3104031openalex-snapshot

Foundations of Modern Query Languages for Graph Databases

inferred← citeshttps://doi.org/10.1145/3129247openalex-snapshot

Designing a Query Language for RDF

inferred← citeshttps://doi.org/10.1145/3132218.3132239openalex-snapshot

Counting to k or how SPARQL1.1 Property Paths Can Be Extended to Top-k Path Queries

inferred← citeshttps://doi.org/10.1145/3180281openalex-snapshot

Minimization of Tree Patterns

inferred← citeshttps://doi.org/10.1145/3196959.3196973openalex-snapshot

The Tractability Frontier of Well-designed SPARQL Queries

inferred← citeshttps://doi.org/10.1145/3212685openalex-snapshot

Reachability Is in DynFO

inferred← citeshttps://doi.org/10.1145/3213891openalex-snapshot

Top-k User-Defined Vertex Scoring Queries in Edge-Labeled Graph Databases

inferred← citeshttps://doi.org/10.1145/3294052.3319704openalex-snapshot

Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation

inferred← citeshttps://doi.org/10.1145/3308558.3313472openalex-snapshot

Navigating the Maze of Wikidata Query Logs

inferred← citeshttps://doi.org/10.1145/3318464.3380567openalex-snapshot

On the Optimization of Recursive Relational Queries: Application to Graph Queries

inferred← citeshttps://doi.org/10.1145/3331446openalex-snapshot

Dichotomies for Evaluating Simple Regular Path Queries

inferred← citeshttps://doi.org/10.1145/3340531.3411958openalex-snapshot

How and Why is An Answer (Still) Correct? Maintaining Provenance in Dynamic Knowledge Graphs

inferred← citeshttps://doi.org/10.1145/3422648.3422661openalex-snapshot

Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation

inferred← citeshttps://doi.org/10.1145/3448016.3457545openalex-snapshot

Querying in the Age of Graph Databases and Knowledge Graphs

inferred← citeshttps://doi.org/10.1145/3477045openalex-snapshot

#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes

inferred← citeshttps://doi.org/10.1145/3514221.3526057openalex-snapshot

Graph Pattern Matching in GQL and SQL/PGQ

inferred← citeshttps://doi.org/10.1145/3517804.3524149openalex-snapshot

The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs

inferred← citeshttps://doi.org/10.1145/3572751.3572753openalex-snapshot

Counting the Answers to a Query

inferred← citeshttps://doi.org/10.1145/3722234.3725822openalex-snapshot

Querying Graph Data: Where We Are and Where To Go

inferred← citeshttps://doi.org/10.1145/3725281openalex-snapshot

Dangers of List Processing in Querying Property Graphs

inferred← citeshttps://doi.org/10.1145/3774904.3792534openalex-snapshot

Kleene Closure Property Path Query Optimization Based on Node Clustered Index

inferred← citeshttps://doi.org/10.14778/3489496.3489510openalex-snapshot

Answering regular path queries through exemplars

inferred← citeshttps://doi.org/10.14778/3587136.3587151openalex-snapshot

Representing Paths in Graph Database Pattern Matching

inferred← citeshttps://doi.org/10.14778/3685800.3685820openalex-snapshot

Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous Graphs

inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11549openalex-snapshot

On the Satisfiability Problem of Patterns in SPARQL 1.1

inferred← citeshttps://doi.org/10.1613/jair.5028openalex-snapshot

On the Satisfiability Problem for SPARQL Patterns

inferred← citeshttps://doi.org/10.17148/ijarcce.2017.65122openalex-snapshot

Semantic Search on Applicant Tracking System

inferred← citeshttps://doi.org/10.20868/upm.thesis.15320openalex-snapshot

Ontology-based access to sensor data streams

inferred← citeshttps://doi.org/10.20868/upm.thesis.39348openalex-snapshot

Query Rewriting Optimisation Techniques for Ontology-Based Data Access

inferred← citeshttps://doi.org/10.24963/kr.2022/10openalex-snapshot

Revisiting Semiring Provenance for Datalog

inferred← citeshttps://doi.org/10.3233/sw-160237openalex-snapshot

SPARQL with property paths on the Web

inferred← citeshttps://doi.org/10.3233/sw-190365openalex-snapshot

Querying knowledge graphs with extended property paths

inferred← citeshttps://doi.org/10.3390/buildings12122162openalex-snapshot

The Application of Graph in BIM/GIS Integration

inferred← citeshttps://doi.org/10.35537/10915/41223openalex-snapshot

Co-evolución entre la Web Social y la Web Semántica

inferred← citeshttps://doi.org/10.4018/978-1-4666-8767-7.ch017openalex-snapshot

RDF Storage and Querying

inferred← citeshttps://doi.org/10.4018/978-1-5225-5191-1.ch019openalex-snapshot

RDF Storage and Querying

inferred← citeshttps://doi.org/10.4230/lipics.icdt.2015.212openalex-snapshot

CONSTRUCT Queries in SPARQL

inferred← citeshttps://doi.org/10.46298/lmcs-19(4:20)2023openalex-snapshot

A Trichotomy for Regular Trail Queries

inferred← citeshttps://doi.org/10.48550/arxiv.1303.0966openalex-snapshot

Efficient Separability of Regular Languages by Subsequences and Suffixes

inferred← citeshttps://doi.org/10.48550/arxiv.1311.3879openalex-snapshot

Answering SPARQL queries modulo RDF Schema with paths

inferred← citeshttps://doi.org/10.48550/arxiv.1403.0949openalex-snapshot

Leveraging Semantic Web Technologies for Managing Resources in a Multi-Domain Infrastructure-as-a-Service Environment

inferred← citeshttps://doi.org/10.48550/arxiv.1411.2351openalex-snapshot

SCULPT: A Schema Language for Tabular Data on the Web

inferred← citeshttps://doi.org/10.48550/arxiv.1503.04831openalex-snapshot

A Context-Based Semantics for SPARQL Property Paths over the Web (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.1507.04614openalex-snapshot

LDQL: A Query Language for the Web of Linked Data (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.1610.06264openalex-snapshot

Foundations of Modern Query Languages for Graph Databases

inferred← citeshttps://doi.org/10.48550/arxiv.1701.06454openalex-snapshot

Evaluating navigational RDF queries over the Web

inferred← citeshttps://doi.org/10.48550/arxiv.1807.07346openalex-snapshot

Indexing Execution Patterns in Workflow Provenance Graphs through Generalized Trie Structures

inferred← citeshttps://doi.org/10.48550/arxiv.1906.09226openalex-snapshot

$\text{#NFA}$ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes

inferred← citeshttps://doi.org/10.5220/0005731200270036openalex-snapshot

SemNaaS: Semantic Web for Network as a Service

inferred← citeshttps://doi.org/10.5441/002/icdt.2014.15openalex-snapshot

Conjunctive Context-Free Path Queries

inferred← citeshttps://doi.org/10.5753/jidm.2013.1480openalex-snapshot

The Chilean Database Group

inferred← citeshttps://doi.org/10.70675/d7b0e5acz2332z4eedz9db0z83320a46ae99openalex-snapshot

Querying and Mining Multigraphs

inferred← citeshttps://doi.org/10.70675/e630d3fez6701z4845zbc10z78adf083e404openalex-snapshot

Comment interroger un graphe de connaissance décentralisé en ligne ?

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.