메뉴 건너뛰기




Volumn , Issue , 2005, Pages 728-735

Efficient evaluation of parameterized pattern queries

Author keywords

Parameterized patterns; Query evaluation

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; OPTIMIZATION; PARAMETER ESTIMATION;

EID: 33745766710     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (24)
  • 2
    • 0022663527 scopus 로고
    • The boyer-moore-galil string searching strategies revisited
    • A. Apostolico and R. Giancarlo. The boyer-moore-galil string searching strategies revisited. SIAM J. Comput., 15(1):98-105, 1986.
    • (1986) SIAM J. Comput. , vol.15 , Issue.1 , pp. 98-105
    • Apostolico, A.1    Giancarlo, R.2
  • 4
    • 0017547820 scopus 로고
    • A fast string searching algorithm
    • R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
    • (1977) Commun. ACM , vol.20 , Issue.10 , pp. 762-772
    • Boyer, R.S.1    Moore, J.S.2
  • 9
    • 33745784530 scopus 로고    scopus 로고
    • Mining Web sequential patterns incrementally with revised PLWAP tree
    • C. I. Ezeife and M. Chen. Mining Web Sequential Patterns Incrementally with Revised PLWAP Tree. In WAIM, pages 539-548, 2004.
    • (2004) WAIM , pp. 539-548
    • Ezeife, C.I.1    Chen, M.2
  • 12
    • 0000904908 scopus 로고
    • Fast pattern matching in strings
    • D. Knuth, J. Morris, and V. Pratt. Fast Pattern Matching in Strings. SIAM J. Computing, 6(2):323-350, 1977.
    • (1977) SIAM J. Computing , vol.6 , Issue.2 , pp. 323-350
    • Knuth, D.1    Morris, J.2    Pratt, V.3
  • 13
    • 0002193989 scopus 로고
    • Fast string matching with k differences
    • G. M. Landau and U. Vishkin. Fast string matching with k differences. J. Comput. Syst. Sci., 37(1):63-78, 1988.
    • (1988) J. Comput. Syst. Sci. , vol.37 , Issue.1 , pp. 63-78
    • Landau, G.M.1    Vishkin, U.2
  • 24
    • 0000386785 scopus 로고
    • Finding approximate patterns in strings
    • E. Ukkonen. Finding approximate patterns in strings. J. Algorithms, 6(1):132-137, 1985.
    • (1985) J. Algorithms , vol.6 , Issue.1 , pp. 132-137
    • Ukkonen, E.1


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