On the public citation graph
Graph Pattern Matching: A Join/Semijoin Approach
0 signed · 66 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/11687238_56openalex-snapshot
Fast Computation of Reachability Labeling for Large Graphs
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-31849-1_28openalex-snapshot
Labeling Scheme and Structural Joins for Graph-Structured XML Data
inferredcites →https://doi.org/10.1007/978-3-540-71703-4_4openalex-snapshot
Cost-Based Query Optimization for Multi Reachability Joins
inferredcites →https://doi.org/10.1007/springerreference_64217openalex-snapshot
Resource Description Framework (RDF) Schema (RDFS)
inferredcites →https://doi.org/10.1109/69.224205openalex-snapshot
Combining joint and semi-join operations for distributed query processing
inferredcites →https://doi.org/10.1109/71.159044openalex-snapshot
Interleaving a join sequence with semijoins in distributed query processing
inferredcites →https://doi.org/10.1109/icde.2003.1260812openalex-snapshot
Structural join order selection for XML query optimization
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.1109/icde.2006.53openalex-snapshot
Dual Labeling: Answering Graph Reachability Queries in Constant Time
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/1247480.1247573openalex-snapshot
Fast and practical indexing and querying of very large graphs
inferredcites →https://doi.org/10.1145/128762.128764openalex-snapshot
Join processing in relational databases
inferredcites →https://doi.org/10.1145/1353343.1353370openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferredcites →https://doi.org/10.1145/1367497.1367611openalex-snapshot
On incremental maintenance of 2-hop labeling of graphs
inferredcites →https://doi.org/10.1145/1376616.1376677openalex-snapshot
Efficiently answering reachability queries on very large directed graphs
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/275487.275492openalex-snapshot
An overview of query optimization in relational systems
inferredcites →https://doi.org/10.1145/298514.298576openalex-snapshot
Graph-theoretic methods in database theory
inferredcites →https://doi.org/10.1145/319628.319650openalex-snapshot
Query processing in a system for distributed databases (SDD-1)
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/356924.356928openalex-snapshot
Query Optimization in Database Systems
inferredcites →https://doi.org/10.1145/371578.371598openalex-snapshot
The state of the art in distributed query processing
inferredcites →https://doi.org/10.1145/543613.543620openalex-snapshot
Algorithmics and applications of tree and graph searching
inferredcites →https://doi.org/10.1145/543619.543620openalex-snapshot
Algorithmics and applications of tree and graph searching
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
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.14778/1453856.1453909openalex-snapshot
Hash-base subgraph query processing method for graph-structured XML documents
inferredcites →https://doi.org/10.5555/1182635.1164153openalex-snapshot
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
inferredcites →https://doi.org/10.5555/545381.545503openalex-snapshot
Reachability and distance queries via 2-hop labels
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-030-18576-3_33openalex-snapshot
Evaluating Mixed Patterns on Large Data Graphs Using Bitmap Views
inferred← citeshttps://doi.org/10.1007/978-3-030-27520-4_20openalex-snapshot
Efficiently Computing Homomorphic Matches of Hybrid Pattern Queries on Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-55814-7_26openalex-snapshot
Exploring Citation Networks with Hybrid Tree Pattern Queries
inferred← citeshttps://doi.org/10.1007/978-3-030-62005-9_19openalex-snapshot
Leveraging Double Simulation to Efficiently Evaluate Hybrid Patterns on Data Graphs
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-96-0567-5_29openalex-snapshot
Scalable Optimization of Graph Pattern Queries Using Summary Graphs
inferred← citeshttps://doi.org/10.1007/s41019-016-0023-zopenalex-snapshot
Distance-Aware Selective Online Query Processing Over Large Distributed Graphs
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.knosys.2023.110770openalex-snapshot
An efficient approach for faster matching of approximate patterns in graphs
inferred← citeshttps://doi.org/10.1109/bdcloud.2014.101openalex-snapshot
Path Pattern Query Processing on Large Graphs
inferred← citeshttps://doi.org/10.1109/coginf.2011.6016163openalex-snapshot
A graph modeling and matching method for sketch-based garment panel design
inferred← citeshttps://doi.org/10.1109/fskd.2017.8393122openalex-snapshot
Querying RDF graphs over partitioned indexes
inferred← citeshttps://doi.org/10.1109/icde.2014.6816640openalex-snapshot
Query optimization of distributed pattern matching
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00093openalex-snapshot
Pilos: Scalable Large-Subgraph Matching by Online Spectral Filtering
inferred← citeshttps://doi.org/10.1109/tip.2015.2502147openalex-snapshot
Detecting Densely Distributed Graph Patterns for Fine-Grained Image Categorization
inferred← citeshttps://doi.org/10.1109/tkde.2014.2310207openalex-snapshot
Scaling Hop-Based Reachability Indexing for Fast Graph Pattern Query Processing
inferred← citeshttps://doi.org/10.1109/tkde.2014.2345383openalex-snapshot
Efficient Parallel Processing of Distance Join Queries Over Distributed Graphs
inferred← citeshttps://doi.org/10.1145/2671188.2749299openalex-snapshot
Fine-Grained Image Categorization by Localizing TinyObject Parts from Unannotated Images
inferred← citeshttps://doi.org/10.1145/3392717.3392745openalex-snapshot
Parallelizing pruned landmark labeling
inferred← citeshttps://doi.org/10.1145/3711896.3737006openalex-snapshot
Improving Subgraph Matching by Combining Algorithms and Graph Neural Networks
inferred← citeshttps://doi.org/10.14257/ijdta.2016.9.3.05openalex-snapshot
An Optimal Agent Based (Oab) Architecture for Web Service Discovery
inferred← citeshttps://doi.org/10.14778/2180912.2180919openalex-snapshot
Comments on "Stack-based Algorithms for Pattern Matching on DAGs"
inferred← citeshttps://doi.org/10.14778/2212351.2212355openalex-snapshot
Adding logical operators to tree pattern queries on graph-structured data
inferred← citeshttps://doi.org/10.34737/8yy53openalex-snapshot
Intuitionistic fuzzy XML query matching and rewriting
inferred← citeshttps://doi.org/10.4018/jssci.2012010104openalex-snapshot
Cognitive Garment Panel Design Based on BSG Representation and Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07749openalex-snapshot
A partition-based Summary-Graph-Driven Method for Efficient RDF Query Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1906.12018openalex-snapshot
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
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.