Distance-join: pattern match query in a large graph database
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest-path query, reachability verification, and pattern match. Among these, a pattern match query is more flexible compared to a subgraph search and more informative compared to a shortest-path or reachability query. In this paper, we address pattern match problems over a large data graph G. Specifically, given a pattern graph (i.e., query Q ), we want to find all matches (in G ) that have the similar connections as those in Q. In order to reduce the search space significantly, we first transform the vertices into points in a vector space via graph embedding techniques, coverting a pattern match query into a distance-based multi-way join problem over the converted vector space. We also propose several pruning strategies and a join order selection method to process join processing efficiently. Extensive experiments on both real and synthetic datasets show that our method outperforms existing ones by orders of magnitude.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reachability and Distance Queries via 2-Hop Labels
Cohen, E., Halperin, E., Kaplan, H., & Zwick, U. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403098 · Cited by 518 · cited 5×
“These are well-studied problems, with a number of vertex labeling-based solutions [7].”
BackgroundMethodInfluential
Cited by
Scalable SPARQL querying of large RDF graphs
Huang, J., Abadi, D. J., & Ren, K. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402747 · Cited by 461
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
GraMi: frequent subgraph and pattern mining in a single large graph
Elseidy, M., Abdelhamid, E., Skiadopoulos, S., & Kalnis, P. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732286.2732289 · Cited by 315
A distributed graph engine for web scale RDF data
Zeng, K., Yang, J., Wang, H., Shao, B., & Wang, Z. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535570.2488333 · Cited by 314
POIROT: Aligning Attack Behavior with Kernel Audit Records for Cyber Threat Hunting
Milajerdi, S. M., Eshete, B., Gjomemo, R., & Venkatakrishnan, V. N. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363217 · Cited by 300
Metadata
- Authors
- Zou, L., Chen, L., & Özsu, M. T.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2009-08
- Volume
- 2
- Issue
- 1
- Pages
- 886-897
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2111607365
- Cited by
- 200
- References
- 1
- FWCI
- 15.03
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.