Presentation 2008-06-19
A study on fast search of the nearest string in edit distance
Hiroyuki HANADA, Mineichi KUDO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The problem is finding the nearest string, measured by edit distance, to a query string q from a set T of strings. Here indexing of T is assumed. Conventional indexing methods construct indexes mainly from the distances between elements in T. In the proposed method, the nature of strings is introduced to enhancing indexing and searching. We introduce n-gram distance as an approximation of edit distance for faster construction of the VP-trees which are search trees in metric spaces. The method succeeded to speed up the construction of VP-trees at a factor of 1/8, without increasing searching time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) String / Edit Distance / Nearest Neighbor Method / Indexing / Search Tree
Paper # DE2008-8,PRMU2008-26
Date of Issue

Conference Information
Committee DE
Conference Date 2008/6/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A study on fast search of the nearest string in edit distance
Sub Title (in English)
Keyword(1) String
Keyword(2) Edit Distance
Keyword(3) Nearest Neighbor Method
Keyword(4) Indexing
Keyword(5) Search Tree
1st Author's Name Hiroyuki HANADA
1st Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University()
2nd Author's Name Mineichi KUDO
2nd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
Date 2008-06-19
Paper # DE2008-8,PRMU2008-26
Volume (vol) vol.108
Number (no) 93
Page pp.pp.-
#Pages 5
Date of Issue