메뉴 건너뛰기




Volumn , Issue , 2011, Pages 325-330

An efficient approach for data-duplication detection based on RDBMS

Author keywords

detection; duplication; efficiency; query optimization; RDBMS

Indexed keywords

DATA SETS; DUPLICATION; INFORMATION SYSTEM MANAGEMENT; QUERY OPTIMIZATION; QUERY OPTIMIZER; RDBMS; REAL-WORLD OBJECTS; SINGLE OBJECT;

EID: 79960398890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/JCSSE.2011.5930142     Document Type: Conference Paper
Times cited : (1)

References (7)
  • 4
    • 0027113212 scopus 로고
    • Approximate string-matching with q-grams and maximal matches
    • Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theor. Comput. Sci. 92 (1992) 191-211
    • (1992) Theor. Comput. Sci. , vol.92 , pp. 191-211
    • Ukkonen, E.1
  • 6
    • 36348961379 scopus 로고    scopus 로고
    • Adaptive sorted neighborhood methods for efficient record linkage
    • DOI 10.1145/1255175.1255213, Proceedings of the 7th ACM/IEEE Joint Conference on Digital Libraries, JCDL 2007: Building and Sustaining the Digital Environment
    • Yan, S., Lee, D., Kan, M. Y., Giles, L. C.: Adaptive sorted neighborhood methods for efficient record linkage. In: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries. JCDL'07, New York, NY, USA, ACM (2007) 185-194 (Pubitemid 350157980)
    • (2007) Proceedings of the ACM International Conference on Digital Libraries , pp. 185-194
    • Yan, S.1    Lee, D.2    Kan, M.-Y.3    Giles, L.C.4
  • 7
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33 (2001) 31-88 (Pubitemid 33768480)
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1


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