메뉴 건너뛰기




Volumn 11, Issue 4, 2008, Pages 485-510

Coding-based join algorithms for structural queries on graph-structured XML document

Author keywords

Coding; Query processing; Structural join; Subgraph query; XML

Indexed keywords

AS GRAPHS; CODING; DESIGN GRAPHS; EFFICIENT DATA STRUCTURES; EXTENDING; JOIN ALGORITHMS; OF GRAPHS; REACHABILITY; STRUCTURAL JOIN; STRUCTURAL JOINS; STRUCTURAL QUERIES; SUBGRAPH; SUBGRAPH QUERY; XML DOCUMENTS;

EID: 54249141400     PISSN: 1386145X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11280-008-0050-4     Document Type: Article
Times cited : (6)

References (29)
  • 2
    • 27844551194 scopus 로고    scopus 로고
    • XQBE: A graphical environment to query xml data
    • 3
    • D. Braga A. Campi 2005 XQBE: a graphical environment to query xml data World Wide Web 8 3 287 316
    • (2005) World Wide Web , vol.8 , pp. 287-316
    • Braga, D.1    Campi, A.2
  • 5
    • 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, pp. 493-504 (2005)
    • (2005) VLDB , pp. 493-504
    • Chen, L.1    Gupta, A.2    Kurul, M.E.3
  • 6
    • 33745613502 scopus 로고    scopus 로고
    • Fast computation of reachability labeling for large graphs
    • Ioannidis, Y.E., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT Springer
    • Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In: Ioannidis, Y.E., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT. Lecture Notes in Computer Science, vol. 3896, pp. 961-979. Springer (2006)
    • (2006) Lecture Notes in Computer Science , vol.3896 , pp. 961-979
    • Cheng, J.1    Yu, J.X.2    Lin, X.3    Wang, H.4    Yu, P.S.5
  • 8
    • 0003213917 scopus 로고    scopus 로고
    • XML path language (XPath)
    • 16 November 1999
    • Clark, J., DeRose, S.: XML path language (XPath). In W3C recommendation, 16 November 1999. http://www.w3.org/TR/xpath (1999)
    • (1999) W3C Recommendation
    • Clark, J.1    Derose, S.2
  • 9
    • 84968911272 scopus 로고    scopus 로고
    • Reachability and distance queries via 2-hop labels
    • Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937-946 (2002)
    • (2002) SODA , pp. 937-946
    • Cohen, E.1    Halperin, E.2    Kaplan, H.3    Zwick, U.4
  • 11
    • 33745782353 scopus 로고    scopus 로고
    • Compact reachability labeling for graph-structured data
    • Herzog, O., Schek, H.-J., Fuhr, N., Chowdhury, A., Teiken, W. (eds.) Bremen, Germany, October 31-November 5,2005 ACM
    • He, H., Wang, H., Yang, J., Yu, P.S.: Compact reachability labeling for graph-structured data. In: Herzog, O., Schek, H.-J., Fuhr, N., Chowdhury, A., Teiken, W. (eds.) Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management (CIKM2005), Bremen, Germany, October 31-November 5, 2005, pp. 594-601. ACM (2005)
    • (2005) Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management (CIKM2005) , pp. 594-601
    • He, H.1    Wang, H.2    Yang, J.3    Yu, P.S.4
  • 13
    • 0016426544 scopus 로고
    • On the vector representation of the reachability in planar directed graphs
    • 3
    • T. Kameda 1975 On the vector representation of the reachability in planar directed graphs Information Process Letters 3 3 78 80
    • (1975) Information Process Letters , vol.3 , pp. 78-80
    • Kameda, T.1
  • 22
    • 35448951817 scopus 로고    scopus 로고
    • Fast and practical indexing and querying of very large graphs
    • Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD Conference, pp. 845-856 (2007)
    • (2007) SIGMOD Conference , pp. 845-856
    • Trißl, S.1    Leser, U.2
  • 24
    • 33749621067 scopus 로고    scopus 로고
    • Dual labeling: Answering graph reachability queries in constant time
    • Liu, L., Reuter, A., Whang, K.-Y., Zhang, J. (eds.) ICDE 2006, 3-8 April 2006, Atlanta, GA, USA Liu, L., Reuter, A., Whang, K.-Y., Zhang, J. (eds.) 3-8 April 2006, Atlanta, GA, USA IEEE Computer Society
    • Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: answering graph reachability queries in constant time. In: Liu, L., Reuter, A., Whang, K.-Y., Zhang, J. (eds.) Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, p 75. IEEE Computer Society (2006)
    • (2006) Proceedings of the 22nd International Conference on Data Engineering , pp. 75
    • Wang, H.1    He, H.2    Yang, J.3    Yu, P.S.4    Yu, J.X.5    Wang, H.6    He, H.7    Yang, J.8    Yu, P.S.9    Yu, J.X.10
  • 25
    • 38349118281 scopus 로고    scopus 로고
    • Clustered chain path index for xml document: Efficiently processing branch queries
    • 1
    • H. Wang J. Li H. Wang 2008 Clustered chain path index for xml document: efficiently processing branch queries World Wide Web 11 1 153 168
    • (2008) World Wide Web , vol.11 , pp. 153-168
    • Wang, H.1    Li, J.2    Wang, H.3
  • 27
    • 33749018197 scopus 로고    scopus 로고
    • Answering xml queries using path-based indexes: A survey
    • 3
    • K.-F. Wong J.X. Yu N. Tang 2006 Answering xml queries using path-based indexes: a survey World Wide Web 9 3 277 299
    • (2006) World Wide Web , vol.9 , pp. 277-299
    • Wong, K.-F.1    Yu, J.X.2    Tang, N.3


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