메뉴 건너뛰기




Volumn 7418 LNCS, Issue , 2012, Pages 284-295

Top-k graph pattern matching: A twig query approach

Author keywords

[No Author keywords available]

Indexed keywords

CITATION ANALYSIS; COLLABORATIVE WORK; COST-BASED OPTIMIZATION; CYCLIC GRAPH; DATA GRAPH; DATA SETS; GRAPH PATTERN MATCHING; GRAPH QUERIES; GRAPH-BASED; LARGE DATA; LINK ANALYSIS; PERFORMANCE STUDY; SPANNING TREE; TWIG QUERIES;

EID: 84865634680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32281-5_28     Document Type: Conference Paper
Times cited : (5)

References (33)
  • 1
    • 67649644375 scopus 로고    scopus 로고
    • Confidence-aware join algorithms
    • Agrawal, P., Widom, J.: Confidence-aware join algorithms. In: ICDE (2009)
    • (2009) ICDE
    • Agrawal, P.1    Widom, J.2
  • 3
    • 33745620796 scopus 로고    scopus 로고
    • Stack-based algorithms for pattern matching on DAGs
    • Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on DAGs. In: VLDB (2005)
    • (2005) VLDB
    • Chen, L.1    Gupta, A.2    Kurul, M.E.3
  • 4
    • 70349122425 scopus 로고    scopus 로고
    • On-line exact shortest distance query processing
    • Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In: EDBT (2009)
    • (2009) EDBT
    • Cheng, J.1    Yu, J.X.2
  • 7
    • 33845437482 scopus 로고    scopus 로고
    • BPEL Processes Matchmaking for Service Discovery
    • Meersman, R., Tari, Z. (eds.) OTM 2006. Springer, Heidelberg
    • Corrales, J.C., Grigori, D., Bouzeghoub, M.: BPEL Processes Matchmaking for Service Discovery. In: Meersman, R., Tari, Z. (eds.) OTM 2006. LNCS, vol. 4275, pp. 237-254. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4275 , pp. 237-254
    • Corrales, J.C.1    Grigori, D.2    Bouzeghoub, M.3
  • 9
    • 0034819889 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)
    • (2001) PODS
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 11
    • 79960006256 scopus 로고    scopus 로고
    • Graph pattern matching: From intractable to polynomial time
    • Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. In: VLDB (2010)
    • (2010) VLDB
    • Fan, W.1    Li, J.2    Ma, S.3    Tang, N.4    Wu, Y.5    Wu, Y.6
  • 12
    • 57149142231 scopus 로고    scopus 로고
    • Efficient algorithms for exact ranked twig-pattern matching over graphs
    • Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: SIGMOD (2008)
    • (2008) SIGMOD
    • Gou, G.1    Chirkova, R.2
  • 13
    • 35448999368 scopus 로고    scopus 로고
    • BLINKS: Ranked keyword searches on graphs
    • He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In: SIGMOD (2007)
    • (2007) SIGMOD
    • He, H.1    Wang, H.2    Yang, J.3    Yu, P.S.4
  • 14
    • 0344811244 scopus 로고    scopus 로고
    • Discover: Keyword search in relational databases
    • Hristidis, V., Papakonstantinou, Y.: Discover: keyword search in relational databases. In: VLDB (2002)
    • (2002) VLDB
    • Hristidis, V.1    Papakonstantinou, Y.2
  • 15
    • 34250677302 scopus 로고    scopus 로고
    • ObjectRank: A system for authority-based search on databases
    • Hwang, H., Hristidis, V., Papakonstantinou, Y.: ObjectRank: a system for authority-based search on databases. In: SIGMOD (2006)
    • (2006) SIGMOD
    • Hwang, H.1    Hristidis, V.2    Papakonstantinou, Y.3
  • 16
    • 6344287791 scopus 로고    scopus 로고
    • Supporting top-k join queries in relational databases
    • Ilyas, F., Aref, G., Elmagarmid, K.: Supporting top-k join queries in relational databases. The VLDB Journal 13(3), 207-221 (2004)
    • (2004) The VLDB Journal , vol.13 , Issue.3 , pp. 207-221
    • Ilyas, F.1    Aref, G.2    Elmagarmid, K.3
  • 17
    • 55349093583 scopus 로고    scopus 로고
    • A survey of top-k query processing techniques in relational database systems
    • Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 1-58 (2008)
    • (2008) ACM Comput. Surv. , vol.40 , Issue.4 , pp. 1-58
    • Ilyas, I.F.1    Beskales, G.2    Soliman, M.A.3
  • 18
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of influence through a social network
    • Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD (2003)
    • (2003) KDD
    • Kempe, D.1    Kleinberg, J.2    Tardos, E.3
  • 20
    • 33845937754 scopus 로고    scopus 로고
    • Effective keyword search in relational databases
    • Liu, F., Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: SIGMOD (2006)
    • (2006) SIGMOD
    • Liu, F.1    Yu, C.2    Meng, W.3    Chowdhury, A.4
  • 22
    • 84865632192 scopus 로고    scopus 로고
    • Taming verification hardness: An efficient algorithm for testing subgraph isomorphism
    • Haichuan, S., Ying, Z., Xuemin, L., Xu, Y.J.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: VLDB (2008)
    • (2008) VLDB
    • Haichuan, S.1    Ying, Z.2    Xuemin, L.3    Xu, Y.J.4
  • 23
    • 0036040082 scopus 로고    scopus 로고
    • Algorithmics and applications of tree and graph searching
    • Shasha, D.,Wang, J.T.L.,Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)
    • (2002) PODS
    • Shasha, D.1    Wang, J.T.L.2    Giugno, R.3
  • 24
    • 52649126146 scopus 로고    scopus 로고
    • TALE: A tool for approximate large graph matching
    • Tian, Y., Patel, J.: TALE: A tool for approximate large graph matching. In: ICDE (2008)
    • (2008) ICDE
    • Tian, Y.1    Patel, J.2
  • 25
    • 0016870630 scopus 로고
    • An algorithm for subgraph isomorphism
    • Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1) (1976)
    • (1976) J. ACM , vol.23 , Issue.1
    • Ullmann, J.R.1
  • 26
    • 77949516821 scopus 로고    scopus 로고
    • Hash-base subgraph query processing method for graphstructured XML documents
    • Wang, H., Li, J., Luo, J., Gao, H.: Hash-base subgraph query processing method for graphstructured XML documents. In: VLDB (2008)
    • (2008) VLDB
    • Wang, H.1    Li, J.2    Luo, J.3    Gao, H.4
  • 27
    • 78649766952 scopus 로고    scopus 로고
    • Matching dependence-related queries in the system dependence graph
    • Wang, X., Lo, D., Cheng, J., Zhang, L., Mei, H., Yu, J.X.: Matching dependence-related queries in the system dependence graph. In: ASE (2010)
    • (2010) ASE
    • Wang, X.1    Lo, D.2    Cheng, J.3    Zhang, L.4    Mei, H.5    Yu, J.X.6
  • 28
    • 34548740153 scopus 로고    scopus 로고
    • Graph database indexing using structured graph decomposition
    • Williams, D., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)
    • (2007) ICDE
    • Williams, D.1    Huan, J.2    Wang, W.3
  • 29
    • 3142736597 scopus 로고    scopus 로고
    • Graph indexing: A frequent structure-based approach
    • Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD (2004)
    • (2004) SIGMOD
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 30
    • 84863753859 scopus 로고    scopus 로고
    • Efficient subgraph search over large uncertain graphs
    • Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. In: VLDB (2011)
    • (2011) VLDB
    • Yuan, Y.1    Wang, G.2    Wang, H.3    Chen, L.4
  • 31
    • 84863730213 scopus 로고    scopus 로고
    • Mining top-k large structural patterns in a massive network
    • Zhu, F., Qu, Q., Lo, D., Yan, X., Han, J., Yu, P.S.:Mining top-k large structural patterns in a massive network. In: VLDB (2011)
    • (2011) VLDB
    • Zhu, F.1    Qu, Q.2    Lo, D.3    Yan, X.4    Han, J.5    Yu, P.S.6
  • 32
    • 79957815582 scopus 로고    scopus 로고
    • Distance-join: Pattern match query in a large graph database
    • Zou, L., Chen, L., Özsu, M.T.: Distance-join: Pattern match query in a large graph database. In: VLDB (2009)
    • (2009) VLDB
    • Zou, L.1    Chen, L.2    Özsu, M.T.3
  • 33
    • 80055033744 scopus 로고    scopus 로고
    • Gstore: Answering sparql queries via subgraph matching
    • Zou, L., Mo, J., Chen, L., Özsu, M.T., Zhao, D.: gstore: Answering sparql queries via subgraph matching. In: VLDB (2011)
    • (2011) VLDB
    • Zou, L.1    Mo, J.2    Chen, L.3    Özsu, M.T.4    Zhao, D.5


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