Detecting densely distributed graph patterns for fine-grained image categorization
Fine-grained image categorization is a challenging task aiming at distinguishing objects
belonging to the same basic-level category, eg, leaf or mushroom. It is a useful technique …
belonging to the same basic-level category, eg, leaf or mushroom. It is a useful technique …
Query optimization of distributed pattern matching
J Huang, K Venkatraman… - 2014 IEEE 30th …, 2014 - ieeexplore.ieee.org
Greedy algorithms for subgraph pattern matching operations are often sufficient when the
graph data set can be held in memory on a single machine. However, as graph data sets …
graph data set can be held in memory on a single machine. However, as graph data sets …
Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms
To help compute shortest path distances over large graphs efficiently, 2-hop labeling has
emerged as a major tool, with Pruned Landmark Labeling (PPL) as a popular algorithm. This …
emerged as a major tool, with Pruned Landmark Labeling (PPL) as a popular algorithm. This …
An efficient approach for faster matching of approximate patterns in graphs
Graphs have proven to be an efficient problem representation scheme in many real-world
applications and can serve to address mining of patterns in large volumes of data. This work …
applications and can serve to address mining of patterns in large volumes of data. This work …
A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphs
Graph pattern matching is a fundamental operation for exploring and analyzing large
graphs, which are widely used to represent entities and their relationships in a plethora of …
graphs, which are widely used to represent entities and their relationships in a plethora of …
Adding logical operators to tree pattern queries on graph-structured data
As data are increasingly modeled as graphs for expressing complex relationships, the tree
pattern query on graph-structured data becomes an important type of queries in real-world …
pattern query on graph-structured data becomes an important type of queries in real-world …
Leveraging double simulation to efficiently evaluate hybrid patterns on data graphs
Labeled graphs are used to represent entities and their relationships in a plethora of Web
applications. Graph pattern matching is a fundamental operation for the analysis and …
applications. Graph pattern matching is a fundamental operation for the analysis and …
[HTML][HTML] Distance-aware selective online query processing over large distributed graphs
Performing online selective queries against graphs is a challenging problem due to the
unbounded nature of graph queries which leads to poor computation locality. It becomes …
unbounded nature of graph queries which leads to poor computation locality. It becomes …
Scaling hop-based reachability indexing for fast graph pattern query processing
Graphs are becoming increasingly dominant in modeling real-life networked data including
social and biological networks, the WWW and the Semantic Web, etc. Graph pattern queries …
social and biological networks, the WWW and the Semantic Web, etc. Graph pattern queries …
Comments on" Stack-based Algorithms for Pattern Matching on DAGs"
Q Zeng, H Zhuge - Proceedings of the VLDB Endowment, 2012 - dl.acm.org
The paper" Stack-based Algorithms for Pattern Matching on DAGs" generalizes the classical
holistic twig join algorithms and proposes PathStackD, TwigStackD and DagStackD to …
holistic twig join algorithms and proposes PathStackD, TwigStackD and DagStackD to …