Efficient top-k string similarity query algorithms
Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to reduce the times of edit distance computation b...
| الحاوية / القاعدة: | Tongxin xuebao |
|---|---|
| المؤلفون الرئيسيون: | , , , |
| التنسيق: | مقال |
| اللغة: | الصينية |
| منشور في: |
Editorial Department of Journal on Communications
2014-12-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.joconline.com.cn/thesisDetails#10.3969/j.issn.1000-436x.2014.12.002 |