Back to Results
First PageMeta Content
Search algorithms / B-tree / N-gram / Speech recognition / Hash function / Suffix tree / Trie / B+ tree / Binary search algorithm / Information science / Science / Logic


AS-Index: A Structure For String Search Using n-grams and Algebraic Signatures. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY : 1– Jul[removed]Camelia Constantin1 , C´edric du Mouza2 , Witold Litwin3 , Philippe Rigaux2 , T
Add to Reading List

Document Date: 2015-01-29 05:43:09

Open Document

File Size: 388,77 KB

Share Result on Facebook

/

Facility

University Paris Dauphine / University Paris-Dauphine / L AMSADE laboratory / France C EDRIC laboratory / D ICC laboratory / University Paris Dauphine Record R / /

IndustryTerm

text search needs / visited entry processing cost / search method / deployed systems / storage media / search performance / suffix array search / probabilistic search / slower search times / search runs / binary search / pattern search / index-based full-text search / search procedure / search performances / search cost / countless applications / post-processing / disk search time / search algorithm first prepocesses / asymptotic search time / Search speed / actual search time / search algorithm / search time / keyword search / search algorithm picks / generic solution / /

Person

Patricia Tries / Tree Tries / Marie Curie / /

Position

administrator / straight-forward / /

ProgrammingLanguage

L / C / /

ProvinceOrState

Manitoba / /

Technology

RAM / search algorithm / Device Access time Processor / ASCII / paging / JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY / Caching / random access / Flash / /

SocialTag