Continuous subgraph pattern search over graph streams

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 393-404

  Wang, Changliang ^a   Chen, Lei ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE QUERY; COMPUTATIONAL COSTS; FEATURE STRUCTURE; GRAPH DATABASE; IN-NETWORK; LIGHT WEIGHT; MULTIPLE TARGETS; NP-COMPLETENESS; PATTERN SEARCH; QUERY PATTERNS; REAL APPLICATIONS; REAL TIME MONITORING; SUBGRAPH; SUBGRAPH ISOMORPHISM; VECTOR SPACES; WORK FOCUS;

CHEMICAL COMPOUNDS; COMPUTATIONAL COMPLEXITY; INTERNET; PATTERN MATCHING; SET THEORY;

INTRUSION DETECTION;

EID: 67649649608     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.132     Document Type: Conference Paper

References (29)

1. http://dtp.nci.nih.gov. Developmental Therapeutics Program.
2. http://reality.media.mit.edu. Reality Mining Dataset.
3. Chen et al. Towards graph containment search and indexing. VLDB '07.
4. Cheng et al. Fg-index: towards verification-free query processing on graph databases. SIGMOD '07.
5. Fortin et al. The graph isomorphism problem. Department of Computing Science, University of Alberta.
6. Gao et al. Continually evaluating similarity-based pattern queries on a streaming time series. SIGMOD '02.
7. He et al. Blinks: ranked keyword searches on graphs. SIGMOD '07.
8. He et al. Closure-tree: An index structure for graph queries. ICDE '06.
9. He et al. Graphs-at-a-time: Query language and access methods for graph databases. SIGMOD '08.
10. Hulgeri et al. Keyword searching and browsing in databases using banks. ICDE '02.
11. Jiang et al. Gstring: A novel approach for efficient search in graph databases. ICDE'07.
12. Kuramochi M. et al. Frequent subgraph discovery. ICDM 2001.
13. Lian et al. Similarity match over high speed time-series streams. ICDE '07.
14. Papadias et al. An optimal and progressive algorithm for skyline queries. SIGMOD '03.
15. Shamir et al. Faster subtree isomorphism. J. Algorithms, 33(2).
16. Shang et al. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. VLDB '08.
17. Shasha et al. Algorithmics and applications of tree and graph searching. PODS '02.
18. Sun et al. Graphscope: parameter-free mining of large time-evolving graphs. KDD '07.
19. Tian et al. Saga: a subgraph matching tool for biological graphs. Bioinformatics, 23(2).
20. Tian et al. Tale: A tool for approximate large graph matching. ICDE'08.
21. Trissl et al. Fast and practical indexing and querying of very large graphs. SIGMOD '07.
22. Wang et al. Dual labeling: Answering graph reachability queries in constant time. ICDE'06.
23. Williams D.W. et al. Graph database indexing using structured graph decomposition. ICDE'07.
24. Yan et al. Graph indexing: a frequent structure-based approach. SIGMOD '04.
25. Yan et al. Searching substructures with superimposed distance. ICDE '06.
26. Yan et al. Substructure similarity search in graph databases. SIGMOD '05.
27. Zhang et al. Treepi: A novel graph indexing method. ICDE'07.
28. Zhao et al. Graph indexing: tree + delta = graph. VLDB '07.
29. Zou et al. A novel spectral coding in a large graph database. EDBT'08.