Approximate string matching in LDAP based on edit distance

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 222-

  Pan, Chi Chien ^a   Yang, Kai Hsiang ^a   Lee, Tzao Lin ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966651002     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016638     Document Type: Conference Paper

References (22)

1. L. Gravano and P. G. Ipeirotis and H. V. Jagadish and N. Koudas and S. Muthukrishnan and D. Srivastava. Approximate String Joins in a Database (Almost) for Free. In Proceedings of the 27th VLDB Conference, 2001.
2. Gartner's site: (http://gartner4.gartnerweb.com/).
3. Lightweight Directory Access Protocol (V2) RFC 1777 (V3) RFC2251.
4. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. In Journal of Molecular Biology, 147: pages 195-197, 1981.
5. U. Manber and S. Wu. Glimpse: A tool to search through entire file system. In Proceedings of USENIX Technical Conference, pages 23-32, 1994.
6. E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In Proceedings of Third Annual European Symposium, pages 327-340, 1995.
7. Levenshtein Distance method to compute the real distance. (http://www.merriampark.com/ld.htm).
8. P. Sellers. The theory and computation of evolutionary distances. In pattern recognition. Journal of Algorithms, 1:359-373, 1980.
9. W. Masek and M. Paterson. A faster algorithm for computing string edit distances. In Journal of Computer and System Sciences, 20:18-31, 1980.
10. G. Landau, E. Myers, and J. Schmidt. Incremental string comparison. In SIAM Journal on Computing, 27(2):557-582, 1998.
11. R. Cole and R. Hariharan. Approximate string matching: a simpler faster algorithm. In Proceedings of ACM-SIAM SODA'98, pages 463-472, 1998.
12. G. Myers. Incremental alignment algorithms and their applications. In Technical Report 86-22, Dept. of Computer Science, University of Arizona, 1986.
13. W. Chang and E. Lawler. Sublinear approximate string matching and biological applications. In Algorithmica, 12(4/5):327-344, 1994.
14. Preliminary version in FOCS'90, 1990.
15. T. Bozkaya and Z. M. Ozsoyoglu. Distance based indexing for high dimensional metric spaces. In Proceedings of String Processing and Information Retrieval Symposium (SPIRE'99), pages 16-23, 1999.
16. S.Brin. Near neighbor search in large metric spaces. In Proceedings of the 21st International Conference on Very Large Databases (VLDB'95), pages 574-584, 1995.
17. The Soundex Indexing System. (http://www.nara.gov/genealogy/soundex/soundex.html).
18. "iPlanet" Directory Server. (http://www.iplanet.com/products/iplanet-directory/home-2-1-1z.html).
19. Gonzalo Navarro, Erkki Sutinen, Jani Tanninen and Jorrna Tatbio. Indexing Text with Approximate q-grams. In Proceedings of CPM'2000,LNCS 1848. P. 350-363,2000.
20. G. Navarro and R. Baeza Yates. A new indexing method for approximate string matching. In Proceedings of CPM'99,LNCS 1645, pages 163-186, 1999.
21. Gonzalo Navarro. A Guided Tour to Approximate String Matching. In ACM Computing Surveys 33(1):31-88, 2001.
22. Gonzalo Navarro and Ricardo Baeza-Yates. Improving an Algorithm for Approximate String Matching. Algorithmica 30(4):473-502, 2001.