On the public citation graph
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins
0 signed · 99 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/spe.2326openalex-snapshot
SIMD compression and the intersection of sorted integers
inferredcites →https://doi.org/10.1007/3-540-58907-4_6openalex-snapshot
On the complexity of generating optimal left-deep processing trees with cross products
inferredcites →https://doi.org/10.1007/978-3-319-95810-1_2openalex-snapshot
Automobile Insurance Fraud Detection Using Social Network Analysis
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.1007/s00778-013-0348-4openalex-snapshot
DBToaster: higher-order delta processing for dynamic, frequently fresh views
inferredcites →https://doi.org/10.1007/s00778-019-00548-xopenalex-snapshot
The ubiquity of large graphs and surprising challenges of graph processing: extended survey
inferredcites →https://doi.org/10.1109/69.273032openalex-snapshot
Volcano-an extensible and parallel query evaluation system
inferredcites →https://doi.org/10.1109/icde.2012.37openalex-snapshot
Scalable Multi-query Optimization for SPARQL
inferredcites →https://doi.org/10.1109/iciap.1999.797762openalex-snapshot
Performance evaluation of the VF graph matching algorithm
inferredcites →https://doi.org/10.1109/tkde.2011.47openalex-snapshot
Optimizing Multiway Joins in a Map-Reduce Environment
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1137/110859440openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1145/1142473.1142543openalex-snapshot
On-the-fly sharing for streamed aggregation
inferredcites →https://doi.org/10.1145/1247480.1247540openalex-snapshot
Efficient exploitation of similar subexpressions for query processing
inferredcites →https://doi.org/10.1145/1516360.1516376openalex-snapshot
Rule-based multi-query optimization
inferredcites →https://doi.org/10.1145/16856.16861openalex-snapshot
Efficiently updating materialized views
inferredcites →https://doi.org/10.1145/16894.16861openalex-snapshot
Efficiently updating materialized views
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/1989323.1989420openalex-snapshot
Incremental graph pattern matching
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2541290openalex-snapshot
Efficient Multiview Maintenance under Insertion in Huge Social Networks
inferredcites →https://doi.org/10.1145/2588555.2588557openalex-snapshot
Parallel subgraph listing in a large-scale graph
inferredcites →https://doi.org/10.1145/2656335openalex-snapshot
Size Bounds for Factorised Representations of Query Results
inferredcites →https://doi.org/10.1145/2723372.2742796openalex-snapshot
Design and Implementation of the LogicBlox System
inferredcites →https://doi.org/10.1145/2764947.2764948openalex-snapshot
Join Processing for Graph Patterns
inferredcites →https://doi.org/10.1145/2882903.2915236openalex-snapshot
Efficient Subgraph Matching by Postponing Cartesian Products
inferredcites →https://doi.org/10.1145/3035918.3064027openalex-snapshot
The Dynamic Yannakakis Algorithm
inferredcites →https://doi.org/10.1145/3183713.3183733openalex-snapshot
Adaptive Optimization of Very Large Join Queries
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/335191.335419openalex-snapshot
Efficient and extensible algorithms for multi query optimization
inferredcites →https://doi.org/10.1145/342009.335419openalex-snapshot
Efficient and extensible algorithms for multi query optimization
inferredcites →https://doi.org/10.1145/375551.375561openalex-snapshot
Pipelining in multi-query optimization
inferredcites →https://doi.org/10.1145/375663.375703openalex-snapshot
Materialized view selection and maintenance using multi-query optimization
inferredcites →https://doi.org/10.1145/376284.375703openalex-snapshot
Materialized view selection and maintenance using multi-query optimization
inferredcites →https://doi.org/10.14778/1453856.1453899openalex-snapshot
Taming verification hardness
inferredcites →https://doi.org/10.14778/2002938.2002940openalex-snapshot
Efficiently compiling efficient query plans for modern hardware
inferredcites →https://doi.org/10.14778/2535570.2488333openalex-snapshot
A distributed graph engine for web scale RDF data
inferredcites →https://doi.org/10.14778/2733004.2733010openalex-snapshot
Real-time twitter recommendation
inferredcites →https://doi.org/10.14778/2850583.2850594openalex-snapshot
How good are query optimizers, really?
inferredcites →https://doi.org/10.14778/3021924.3021929openalex-snapshot
Multi-query optimization for subgraph isomorphism search
inferredcites →https://doi.org/10.14778/3021924.3021937openalex-snapshot
Scalable distributed subgraph enumeration
inferredcites →https://doi.org/10.14778/3229863.3229874openalex-snapshot
Real-time constrained cycle detection in large dynamic graphs
inferredcites →https://doi.org/10.14778/3342263.3342643openalex-snapshot
Optimizing subgraph queries by combining binary and worst-case optimal joins
inferredcites →https://doi.org/10.48550/arxiv.1602.08721openalex-snapshot
Flexible Caching in Trie Joins
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-031-00123-9_4openalex-snapshot
Efficient In-Memory Evaluation of Reachability Graph Pattern Queries on Data Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-3906-2_20openalex-snapshot
ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs
inferred← citeshttps://doi.org/10.1007/978-981-96-0567-5_29openalex-snapshot
Scalable Optimization of Graph Pattern Queries Using Summary Graphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00883-8openalex-snapshot
A graph pattern mining framework for large graphs on GPU
inferred← citeshttps://doi.org/10.1007/s10115-022-01753-xopenalex-snapshot
A survey of continuous subgraph matching for dynamic graphs
inferred← citeshttps://doi.org/10.1007/s41019-024-00271-wopenalex-snapshot
SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching
inferred← citeshttps://doi.org/10.1016/j.is.2023.102249openalex-snapshot
A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphs
inferred← citeshttps://doi.org/10.1016/j.jnca.2022.103562openalex-snapshot
Privacy preserving subgraph isomorphism query for dynamic graph database
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109961openalex-snapshot
Evolving subgraph matching on temporal graphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00028openalex-snapshot
GAMMA: A Graph Pattern Mining Framework for Large Graphs on GPU
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00201openalex-snapshot
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00231openalex-snapshot
Large Subgraph Matching: A Comprehensive and Efficient Approach for Heterogeneous Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00239openalex-snapshot
CSM-TopK: Continuous Subgraph Matching with TopK Density Constraints
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00250openalex-snapshot
Efficient Multi-Query Oriented Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00257openalex-snapshot
NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00260openalex-snapshot
Wings: Efficient Online Multiple Graph Pattern Matching
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00145openalex-snapshot
OSTOR: Online Scheduling Framework for Trading Continuous Queries
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00192openalex-snapshot
MuSha: Subgraph Matching by Multilevel Sharing
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00274openalex-snapshot
Optimizing Queries with Many-to-Many Joins
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00248openalex-snapshot
Efficient Graph Matching with Pattern Reduction
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175769openalex-snapshot
Applications of Information Inequalities to Database Theory Problems
inferred← citeshttps://doi.org/10.1109/tkde.2024.3393936openalex-snapshot
A Survey on Concurrent Processing of Graph Analytical Queries: Systems and Algorithms
inferred← citeshttps://doi.org/10.1109/tkde.2026.3721816openalex-snapshot
Efficient Multi-Query Optimization for Continuous Subgraph Matching Over Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3631504.3631514openalex-snapshot
Kùzu: A Database Management System For "Beyond Relational" Workloads
inferred← citeshttps://doi.org/10.1145/3639294openalex-snapshot
Worst-Case-Optimal Similarity Joins on Graph Databases
inferred← citeshttps://doi.org/10.1145/3654950openalex-snapshot
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework
inferred← citeshttps://doi.org/10.1145/3696410.3714695openalex-snapshot
Worst-Case-Optimal Joins on Graphs with Topological Relations
inferred← citeshttps://doi.org/10.1145/3722212.3725114openalex-snapshot
L p Bound in Action: Cardinality Estimation with One-Sided Guarantees
inferred← citeshttps://doi.org/10.1145/3725263openalex-snapshot
AJOSC: Adaptive Join Order Selection for Continuous Queries
inferred← citeshttps://doi.org/10.1145/3725321openalex-snapshot
LpBound : Pessimistic Cardinality Estimation Using ℓ p -Norms of Degree Sequences
inferred← citeshttps://doi.org/10.1145/3725398openalex-snapshot
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns
inferred← citeshttps://doi.org/10.1162/dint_a_00209openalex-snapshot
MillenniumDB: An Open-Source Graph Database System
inferred← citeshttps://doi.org/10.1162/dint_a_00229openalex-snapshot
MillenniumDB: An Open-Source Graph Database System
inferred← citeshttps://doi.org/10.14778/3510397.3510400openalex-snapshot
Making RDBMSs efficient on graph workloads through predefined joins
inferred← citeshttps://doi.org/10.14778/3523210.3523218openalex-snapshot
An in-depth study of continuous subgraph matching
inferred← citeshttps://doi.org/10.14778/3554821.3554894openalex-snapshot
Modern techniques for querying graph-structured relations
inferred← citeshttps://doi.org/10.14778/3681954.3681963openalex-snapshot
TC-Match: Fast Time-Constrained Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.3233/sw-212864openalex-snapshot
Continuous multi-query optimization for subgraph matching over dynamic graphs
inferred← citeshttps://doi.org/10.3390/technologies13080335openalex-snapshot
Temporal Multi-Query Subgraph Matching in Cybersecurity
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.