On the public citation graph
Querying Regular Graph Patterns
0 signed · 95 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.1006/jcss.2001.1805openalex-snapshot
Rewriting of Regular Expressions and Regular Path Queries
inferredcites →https://doi.org/10.1006/jcss.2001.1811openalex-snapshot
Querying Incomplete Information in Semistructured Data
inferredcites →https://doi.org/10.1007/3-540-46093-4_2openalex-snapshot
Optimization Properties for Classes of Conjunctive Regular Path Queries
inferredcites →https://doi.org/10.1007/3-540-68804-8_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
inferredcites →https://doi.org/10.1007/978-3-031-01840-4openalex-snapshot
Relational and XML Data Exchange
inferredcites →https://doi.org/10.1007/978-3-540-30570-5_9openalex-snapshot
An Abstract Framework for Generating Maximal Answers to Queries
inferredcites →https://doi.org/10.1007/978-3-540-75987-4_5openalex-snapshot
Conjunctive Query Containment over Trees
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
inferredcites →https://doi.org/10.1007/978-3-642-02121-3_24openalex-snapshot
Representing, Querying and Transforming Social Networks with RDF/SPARQL
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1016/0020-0190(96)00095-6openalex-snapshot
A lower bound technique for the size of nondeterministic finite automata
inferredcites →https://doi.org/10.1016/0022-0000(84)90081-3openalex-snapshot
Testing containment of conjunctive queries under functional and inclusion dependencies
inferredcites →https://doi.org/10.1016/b978-012088469-8.50014-0openalex-snapshot
On Testing Satisfiability of Tree Pattern Queries
inferredcites →https://doi.org/10.1016/j.jcss.2010.04.009openalex-snapshot
Foundations of Semantic Web databases
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.033openalex-snapshot
Data exchange: semantics and query answering
inferredcites →https://doi.org/10.1016/j.tcs.2012.12.036openalex-snapshot
Parameterized regular expressions and their languages
inferredcites →https://doi.org/10.1089/153623103322006652openalex-snapshot
Graph Data Management for Molecular Biology
inferredcites →https://doi.org/10.1093/bioinformatics/bti1105openalex-snapshot
A query language for biological networks
inferredcites →https://doi.org/10.1109/69.298174openalex-snapshot
A graph-oriented object database model
inferredcites →https://doi.org/10.1109/icde.2000.839439openalex-snapshot
Answering regular path queries using views
inferredcites →https://doi.org/10.1109/icde.2008.4497500openalex-snapshot
Fast Graph Pattern Matching
inferredcites →https://doi.org/10.1109/icde.2009.172openalex-snapshot
SoQL: A Language for Querying and Creating Data in Social Networks
inferredcites →https://doi.org/10.1109/icde.2011.5767858openalex-snapshot
Adding regular expressions to graph reachability and pattern queries
inferredcites →https://doi.org/10.1109/lics.2000.855784openalex-snapshot
View-based query processing and constraint satisfaction
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1126/science.298.5594.824openalex-snapshot
Network Motifs: Simple Building Blocks of Complex Networks
inferredcites →https://doi.org/10.1145/1055558.1055573openalex-snapshot
Foundations of semantic web databases
inferredcites →https://doi.org/10.1145/1131342.1131345openalex-snapshot
Conjunctive queries over trees
inferredcites →https://doi.org/10.1145/1281192.1281271openalex-snapshot
Fast best-effort pattern matching in large attributed graphs
inferredcites →https://doi.org/10.1145/1322432.1322433openalex-snapshot
Survey of graph database models
inferredcites →https://doi.org/10.1145/1498765.1498784openalex-snapshot
Database and information-retrieval methods for knowledge discovery
inferredcites →https://doi.org/10.1145/1567274.1567278openalex-snapshot
Semantics and complexity of SPARQL
inferredcites →https://doi.org/10.1145/1634.1886openalex-snapshot
Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1145/1807085.1807089openalex-snapshot
Expressive languages for path queries over graph-structured data
inferredcites →https://doi.org/10.1145/1870103.1870107openalex-snapshot
XML with incomplete information
inferredcites →https://doi.org/10.1145/1989284.1989294openalex-snapshot
Incomplete information and certain answers in general data models
inferredcites →https://doi.org/10.1145/233269.233368openalex-snapshot
A query language and optimization techniques for unstructured data
inferredcites →https://doi.org/10.1145/303976.303996openalex-snapshot
Rewriting of regular expressions and regular path queries
inferredcites →https://doi.org/10.1145/38713.38749openalex-snapshot
A graphical query language supporting recursion
inferredcites →https://doi.org/10.14778/1920841.1920986openalex-snapshot
Graph homomorphism revisited for graph matching
inferredcites →https://doi.org/10.1613/jair.334openalex-snapshot
A Uniform Framework for Concept Definitions in Description Logics
inferredcites →https://doi.org/10.2168/lmcs-8(3:4)2012openalex-snapshot
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
inferredcites →https://doi.org/10.2200/s00297ed1v01y201008dtm008openalex-snapshot
Relational and XML Data Exchange
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119528227.ch6openalex-snapshot
Fuzzy Preference Queries to NoSQL Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_49openalex-snapshot
Data Graphs with Incomplete Information (and a Way to Complete Them)
inferred← citeshttps://doi.org/10.1007/978-3-319-45276-0_9openalex-snapshot
Negative Knowledge for Certain Query Answers
inferred← citeshttps://doi.org/10.1007/978-3-319-45856-4_18openalex-snapshot
Fuzzy Quantified Structural Queries to Fuzzy Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-49493-7_3openalex-snapshot
Navigational and Rule-Based Languages for Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_29openalex-snapshot
Deciding Universality of ptNFAs is PSpace-Complete
inferred← citeshttps://doi.org/10.1007/978-3-319-74875-7_7openalex-snapshot
Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-981-96-0567-5_25openalex-snapshot
RPQBench: A Benchmark for Regular Path Queries on Graph Data
inferred← citeshttps://doi.org/10.1007/s10619-023-07433-1openalex-snapshot
Multi-model query languages: taming the variety of big data
inferred← citeshttps://doi.org/10.1007/s11280-025-01365-9openalex-snapshot
LD-RPQB: a benchmark for regular path queries based on length distribution
inferred← citeshttps://doi.org/10.1007/s13218-020-00686-3openalex-snapshot
Ontologies and Data Management: A Brief Survey
inferred← citeshttps://doi.org/10.1016/j.artint.2015.11.004openalex-snapshot
Certain answers as objects and knowledge
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.005openalex-snapshot
Querying incomplete information in RDF with SPARQL
inferred← citeshttps://doi.org/10.1016/j.datak.2024.102340openalex-snapshot
Topological querying of music scores
inferred← citeshttps://doi.org/10.1016/j.engappai.2016.01.013openalex-snapshot
Associating ω-automata to path queries on Webs of Linked Data
inferred← citeshttps://doi.org/10.1016/j.ic.2017.06.004openalex-snapshot
Complexity of universality and related problems for partially ordered NFAs
inferred← citeshttps://doi.org/10.1016/j.ic.2018.05.001openalex-snapshot
CTL* with graded path modalities
inferred← citeshttps://doi.org/10.1016/j.ins.2020.02.035openalex-snapshot
Fuzzy quality-Aware queries to graph databases
inferred← citeshttps://doi.org/10.1016/j.is.2023.102337openalex-snapshot
Process Query Language: Design, Implementation, and Evaluation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100616openalex-snapshot
A navigational logic for reasoning about graph properties
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.100997openalex-snapshot
A Logical Approach to Graph Databases
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00200openalex-snapshot
Integrating Connection Search in Graph Queries
inferred← citeshttps://doi.org/10.1109/lics.2017.8005106openalex-snapshot
The homomorphism problem for regular graph patterns
inferred← citeshttps://doi.org/10.1109/smap.2014.15openalex-snapshot
Querying Linked Data and Büchi Automata
inferred← citeshttps://doi.org/10.1145/2603088.2603136openalex-snapshot
Pattern logics and auxiliary relations
inferred← citeshttps://doi.org/10.1145/2691190.2691194openalex-snapshot
Naïve Evaluation of Queries over Incomplete Databases
inferred← citeshttps://doi.org/10.1145/3044713openalex-snapshot
An Indexing Framework for Queries on Probabilistic Graphs
inferred← citeshttps://doi.org/10.1145/3104031openalex-snapshot
Foundations of Modern Query Languages for Graph Databases
inferred← citeshttps://doi.org/10.1145/3105831.3105871openalex-snapshot
Quality Awareness over Graph Pattern Queries
inferred← citeshttps://doi.org/10.1145/3375395.3387663openalex-snapshot
Conjunctive Regular Path Queries with String Variables
inferred← citeshttps://doi.org/10.1145/3514221.3526057openalex-snapshot
Graph Pattern Matching in GQL and SQL/PGQ
inferred← citeshttps://doi.org/10.1145/3514230openalex-snapshot
Conjunctive Regular Path Queries with Capture Groups
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/3763061openalex-snapshot
Flexible and Expressive Typed Path Patterns for GQL
inferred← citeshttps://doi.org/10.1145/3767715openalex-snapshot
On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:14)2021openalex-snapshot
Partially Ordered Automata and Piecewise Testability
inferred← citeshttps://doi.org/10.24963/kr.2020/38openalex-snapshot
Containment of Simple Conjunctive Regular Path Queries
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.61openalex-snapshot
On the Complexity of Universality for Partially Ordered NFAs
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.1704.07860openalex-snapshot
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard
inferred← citeshttps://doi.org/10.5555/3329995.3330041openalex-snapshot
The homomorphism problem for regular graph patterns
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.