Back to Results
First PageMeta Content
Binary trees / Trie / Tree traversal / Rope / Tree / Pruning / B-tree / Sorting algorithms / Directed acyclic word graph / Graph theory / Computing / Computer programming


The VLDB Journal DOIs00778REGULAR PAPER Trie-join: a trie-based method for efficient string similarity joins
Add to Reading List

Document Date: 2014-11-20 04:14:00


Open Document

File Size: 2,51 MB

Share Result on Facebook

City

Trie / /

Company

Microsoft / /

Country

China / /

/

Facility

Tsinghua University / /

IndustryTerm

trie-based algorithms / trie-join algorithms / straightforward trie-search-based method / above-mentioned incremental algorithm / naïve solution / incremental similarity-join algorithm / query log mining / incremental algorithm / straightforward algorithm / dynamic-programming algorithm / computing / incremental trie-join algorithm / /

Organization

IDF / Tsinghua University / Beijing / U.S. Securities and Exchange Commission / G. Li Department of Computer Science and Technology / /

Product

A2 / Trie-PathStack / /

Technology

3 Trie-based algorithms / above-mentioned incremental algorithm / 4 Trie-Traverse algorithm / 11 Incremental Trie-PathStack algorithm / dynamic-programming algorithm / incremental trie-join algorithm / Av / incremental similarity-join algorithm / Trie-PathStack algorithm / 3.1 Trie-traverse algorithm / TriePathStack algorithm / 3.2 Trie-dynamic algorithm / trie-based algorithms / TrieTraverse algorithm / 3.3 Trie-PathStack algorithm / dynamicprogramming algorithm / trie-join algorithms / straightforward algorithm / Trie-Traverse algorithm / string-similarity-join algorithm / Trie-Dynamic algorithm / three trie-based algorithms / incremental algorithm / /

SocialTag