Executing OBSearch with TED
April 7th, 2008 Filed Under OBSearch
In the next few days, I am going to run OBSearch with the tree edit distance function defined by Tai in the 70s. The fastest algorithm available is O(n^3). In sequential mode last time I ran it, it took 3 days to answer 1000 queries. With the new pivot selection strategies I added, I am hoping to reduce considerably this time. I will post the results when I complete the tests.
Post Links
Permalink | Trackback |
|
Print This Article |
Comments
Leave a Reply