Performance and usability enhancements for continuous subgraph matching queries on graph-structured data
A query graph, which includes vertices and edges, represents a query on graph-structured data. The query graph is decomposed into query subgraphs. A network analysis tool performs continuous subgraph matching queries to facilitate analysis of computer network traffic, social media events, or other streams of data represented as a dynamic data graph (graph-structured data). This can help identify emerging trends in the data. Some features of the network analysis tool enhance performance by effectively utilizing distributed computing resources (including processing cores and memory at different nodes of a cluster) to speed up the process of updating the dynamic data graph and detecting matches of query subgraphs. Features of a query graph building tool enhance usability by providing intuitive ways to specify query graphs and their subgraphs. Features of a results visualization tool enhance usability by providing an intuitive way to present the results of continuous subgraph matching queries.
- Research Organization:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- Assignee:
- Battelle Memorial Institute (Richland, WA)
- Patent Number(s):
- 10,810,210
- Application Number:
- 15/594,376
- OSTI ID:
- 1771538
- Country of Publication:
- United States
- Language:
- English
Aurora: a new model and architecture for data stream management
|
journal | August 2003 |
Accelerating semantic graph databases on commodity clusters
|
conference | October 2013 |
STINGER: High performance data structure for streaming graphs
|
conference | September 2012 |
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks
|
conference | June 2007 |
TALE: A Tool for Approximate Large Graph Matching
|
conference | April 2008 |
Continuous pattern detection over billion-edge graph using distributed framework
|
conference | March 2014 |
Scaling Irregular Applications through Data Aggregation and Software Multithreading
|
conference | May 2014 |
Scaling Semantic Graph Databases in Size and Performance
|
journal | July 2014 |
Enabling Real-Time Querying of Live and Historical Stream Data
|
conference | July 2007 |
Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams
|
journal | August 2010 |
A (sub)graph isomorphism algorithm for matching large graphs
|
journal | October 2004 |
A Model of Computation for MapReduce
|
conference | December 2013 |
Thirty Years of Graph Matching in Pattern Recognition
|
journal | May 2004 |
Eldorado
|
conference | January 2005 |
Productivity and performance using partitioned global address space languages
|
conference | January 2007 |
Fast best-effort pattern matching in large attributed graphs
|
conference | January 2007 |
Skip graphs
|
journal | November 2007 |
DOULION: counting triangles in massive graphs with a coin
|
conference | January 2009 |
Predicate migration: optimizing queries with expensive predicates
|
journal | June 1993 |
Optimizing joins in a map-reduce environment
|
conference | January 2010 |
Counting triangles and the curse of the last reducer
|
conference | January 2011 |
Neighborhood based fast graph search in large networks
|
conference | January 2011 |
Incremental graph pattern matching
|
conference | January 2011 |
Streaming graph partitioning for large distributed graphs
|
conference | January 2012 |
StreamWorks: a system for dynamic graph search
|
conference | January 2013 |
Turbo iso: towards ultrafast and robust subgraph isomorphism search in large graph databases
|
conference | January 2013 |
Massive scale cyber traffic analysis: a driver for graph database research
|
conference | June 2013 |
A space efficient streaming algorithm for triangle counting using the birthday paradox
|
conference | January 2013 |
Fast search for dynamic multi-relational graphs
|
conference | January 2013 |
Incremental graph pattern matching
|
journal | August 2013 |
EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs
|
conference | June 2014 |
Predicting and detecting emerging cyberattack patterns using StreamWorks
|
conference | January 2014 |
Parasol: An Architecture for Cross-Cloud Federated Graph Querying
|
conference | January 2014 |
CASQD: continuous detection of activity-based subgraph pattern queries on dynamic graphs
|
conference | June 2016 |
An Algorithm for Subgraph Isomorphism
|
journal | January 1976 |
NiagaraCQ: a scalable continuous query system for Internet databases
|
journal | June 2000 |
Skip lists: a probabilistic alternative to balanced trees
|
journal | June 1990 |
TelegraphCQ: continuous dataflow processing
|
conference | January 2003 |
On graph query optimization in large networks
|
journal | September 2010 |
gSketch: on query estimation in graph streams
|
journal | November 2011 |
Efficient subgraph matching on billion node graphs
|
journal | May 2012 |
| New Streaming Algorithms for Fast Detection of Superspreaders | report | April 2004 |
Similar Records
QLiG: Query Like a Graph For Subgraph Matching
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs