메뉴 건너뛰기




Volumn , Issue , 2009, Pages 839-850

Finding frequent co-occurring terms in relational keyword search

Author keywords

[No Author keywords available]

Indexed keywords

EFFECTIVE TOOL; KEYWORD SEARCH;

EID: 70349092549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516456     Document Type: Conference Paper
Times cited : (28)

References (22)
  • 6
    • 34548795315 scopus 로고    scopus 로고
    • Finding top-k min-cost connected trees in databases
    • B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding top-k min-cost connected trees in databases. In ICDE, pages 836-845, 2007.
    • (2007) ICDE , pp. 836-845
    • Ding, B.1    Yu, J.X.2    Wang, S.3    Qin, L.4    Zhang, X.5    Lin, X.6
  • 13
    • 0344496685 scopus 로고    scopus 로고
    • Keyword proximity search on xml graphs
    • V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword proximity search on xml graphs. In ICDE, pages 367-378, 2003.
    • (2003) ICDE , pp. 367-378
    • Hristidis, V.1    Papakonstantinou, Y.2    Balmin, A.3


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