메뉴 건너뛰기




Volumn 22, Issue 8, 2010, Pages 1093-1109

Continuous subgraph pattern search over certain and uncertain graph streams

Author keywords

graph streams; node neighbor tree; Subgraph search; uncertain graph streams

Indexed keywords

ANSWERING QUERIES; CANDIDATE QUERY; COMPUTATIONAL COSTS; FEATURE STRUCTURE; GRAPH DATABASE; HIGH PROBABILITY; IN-NETWORK; MULTIPLE TARGETS; NP-COMPLETENESS; PATTERN SEARCH; PROBABILITY THRESHOLD; PRUNING TECHNIQUES; QUERY PATTERNS; REAL APPLICATIONS; REAL TIME MONITORING; SUBGRAPH ISOMORPHISM; SUBGRAPHS;

EID: 77954152099     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2010.67     Document Type: Article
Times cited : (55)

References (46)
  • 1
    • 77954154141 scopus 로고    scopus 로고
    • Developmental Therapeutics Program, http://dtp.nci.nih.gov, 2010.
    • (2010)
  • 3
    • 63449089680 scopus 로고    scopus 로고
    • Managing uncertainty in social networks
    • July
    • E. Adar and C. Re, "Managing Uncertainty in Social Networks," IEEE Data Eng. Bull., vol.30, no.2, pp. 23-31, July 2007.
    • (2007) IEEE Data Eng. Bull. , vol.30 , Issue.2 , pp. 23-31
    • Adar, E.1    Re, C.2
  • 5
    • 70350666219 scopus 로고    scopus 로고
    • A viewpoint-based approach for interaction graph analysis
    • S. Asur and S. Parthasarathy, "A Viewpoint-Based Approach for Interaction Graph Analysis," Proc. ACM SIGKDD, 2009.
    • (2009) Proc. ACM SIGKDD
    • Asur, S.1    Parthasarathy, S.2
  • 6
    • 0014814325 scopus 로고
    • Space/Time trade-offs in hash coding with allowable errors
    • B.H. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol.13, no.7, pp. 422-426, 1970.
    • (1970) Comm. ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 8
    • 35448982399 scopus 로고    scopus 로고
    • FG-Index: Towards verification-free query processing on graph databases
    • J. Cheng, Y. Ke, W. Ng, and A. Lu, "FG-Index: Towards Verification-Free Query Processing on Graph Databases," Proc. ACM SIGMOD, 2007.
    • (2007) Proc. ACM SIGMOD
    • Cheng, J.1    Ke, Y.2    Ng, W.3    Lu, A.4
  • 9
    • 0008690083 scopus 로고    scopus 로고
    • The graph isomorphism problem
    • Dept. of Computing Science, Univ. of Alberta
    • S. Fortin, "The Graph Isomorphism Problem," technical report, Dept. of Computing Science, Univ. of Alberta, 1996.
    • (1996) Technical Report
    • Fortin, S.1
  • 10
    • 0036372565 scopus 로고    scopus 로고
    • Continually evaluating similarity-based pattern queries on a streaming time series
    • L. Gao and X.S. Wang, "Continually Evaluating Similarity-Based Pattern Queries on a Streaming Time Series," Proc. ACM SIGMOD, 2002.
    • (2002) Proc. ACM SIGMOD
    • Gao, L.1    Wang, X.S.2
  • 11
    • 0021615874 scopus 로고
    • R-Trees: A dynamic index structure for spatial searching
    • A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, 1984.
    • (1984) Proc. ACM SIGMOD
    • Guttman, A.1
  • 13
    • 57149124877 scopus 로고    scopus 로고
    • Graphs-at-a-time: Query language and access methods for graph databases
    • H. He and A.K. Singh, "Graphs-at-a-Time: Query Language and Access Methods for Graph Databases," Proc. ACM SIGMOD, 2008.
    • (2008) Proc. ACM SIGMOD
    • He, H.1    Singh, A.K.2
  • 20
    • 0344983370 scopus 로고    scopus 로고
    • The city as a giant component: A random graph approach to zipf's law
    • R. Kali, "The City as a Giant Component: A Random Graph Approach to Zipf'S Law," Applied Economics Letters, vol.10, no.11, pp. 717-720, 2007.
    • (2007) Applied Economics Letters , vol.10 , Issue.11 , pp. 717-720
    • Kali, R.1
  • 23
    • 57149142762 scopus 로고    scopus 로고
    • Monochromatic and bichromatic reverse skyline search over uncertain databases
    • X. Lian and L. Chen, "Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases," Proc. ACM SIGMOD, 2008.
    • (2008) Proc. ACM SIGMOD
    • Lian, X.1    Chen, L.2
  • 24
    • 61449091346 scopus 로고    scopus 로고
    • Underground coal mine monitoring with wireless sensor networks
    • M. Li and Y. Liu, "Underground Coal Mine Monitoring with Wireless Sensor Networks," ACM Trans. Sensor Networks, vol.5, no.2, pp. 1-24, 2009.
    • (2009) ACM Trans. Sensor Networks , vol.5 , Issue.2 , pp. 1-24
    • Li, M.1    Liu, Y.2
  • 25
  • 27
    • 0036493195 scopus 로고    scopus 로고
    • Interaction generality, a measurement to assess the reliability of a protein-protein interaction
    • R. Saito, H. Suzuki, and Y. Hayashizaki, "Interaction Generality, a Measurement to Assess the Reliability of a Protein-Protein Interaction," Nucleic Acids Research, vol.30, no.5, pp. 1163-1168, 2002.
    • (2002) Nucleic Acids Research , vol.30 , Issue.5 , pp. 1163-1168
    • Saito, R.1    Suzuki, H.2    Hayashizaki, Y.3
  • 28
    • 0242614382 scopus 로고    scopus 로고
    • Faster subtree isomorphism
    • R. Shamir and D. Tsur, "Faster Subtree Isomorphism," J. Algorithms, vol.33, no.2, pp. 267-280, 1999.
    • (1999) J. Algorithms , vol.33 , Issue.2 , pp. 267-280
    • Shamir, R.1    Tsur, D.2
  • 32
    • 71049169334 scopus 로고    scopus 로고
    • Constant-factor approximation algorithms for identifying dynamic communities
    • C. Tantipathananandh and T. Berger-Wolf, "Constant-Factor Approximation Algorithms for Identifying Dynamic Communities," Proc. ACM SIGKDD, 2009.
    • (2009) Proc. ACM SIGKDD
    • Tantipathananandh, C.1    Berger-Wolf, T.2
  • 34
    • 33846662155 scopus 로고    scopus 로고
    • SAGA: A subgraph matching tool for biological graphs
    • Y. Tian, R.C. Mceachin, C. Santos, D.J. States, and J.M. Patel, "SAGA: A Subgraph Matching Tool for Biological Graphs," Bioinformatics, vol.23, no.2, pp. 232-239, 2007.
    • (2007) Bioinformatics , vol.23 , Issue.2 , pp. 232-239
    • Tian, Y.1    McEachin, R.C.2    Santos, C.3    States, D.J.4    Patel, J.M.5
  • 36
    • 35448951817 scopus 로고    scopus 로고
    • Fast and practical indexing and querying of very large graphs
    • S. TriBl and U. Leser, "Fast and Practical Indexing and Querying of Very Large Graphs," Proc. ACM SIGMOD, 2007.
    • (2007) Proc. ACM SIGMOD
    • Tribl, S.1    Leser, U.2
  • 41
    • 3142736597 scopus 로고    scopus 로고
    • Graph Indexing: A frequent structure-based approach
    • X. Yan, P.S. Yu, and J. Han, "Graph Indexing: A Frequent Structure-Based Approach," Proc. ACM SIGMOD, 2004.
    • (2004) Proc. ACM SIGMOD
    • Yan, X.1    Yu, P.S.2    Han, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.