polynomial-time greedy approximation algorithm / search focus / search on-the-fly / search box / incremental-search algorithm / Precise search paradigm / backend server / information search / online template suggestion / incremental search algorithms / Web browser / search-based systems / keyword-search methods / incremental search algorithm / fuzzy search / you-type and faceted search / binary-search method / assistant tools / search speed / relational database management systems / keyword search / search algorithms / merge-join algorithm / search-as-you-type and tolerating errors / search method / keyword-search approaches / search performance / search paradigm / search-as-you-type and tolerating minor errors / form-based search systems / search-asresults / binary search / search-as-you-type works / search engines / basic search / search uses / overall search time / average search time / autocomplete search / form-based search / search-as-you-type based system / booktitle id=pid Online matchings SQL Generator name id Paper Observed / threshold algorithm / conventional keyword search / search efficiency / incremental search / /
OperatingSystem
Ubuntu / /
Organization
Tsinghua University / Beijing / Databases User-friendly and Easily Accessible Guoliang Li Ju Fan Hao Wu Jiannan Wang Jianhua Feng Department of Computer Science / Stanford / /
Person
Bill Cropp / Beng Chin Ooi / Luis Gravano / Arvind Hulgeri / Min-Cost Connected Trees / Gaurav Bhalotia / Abdur Chowdhury / Hao He / Shan Wang / Yannis Papakonstantinou / Wang Jianhua Feng / Gautam Das / Xiao Zhang / Jun Yang / Clement T. Yu / Sanjay Agrawal / Philip S. Yu / Weixing Wang / Wei Wang / William Kropp / Hao Wu Jiannan Wang Jianhua / /
Position
W.aid Author / Translator / database author / author / count database author / Data Source Raw data Schema Author / Forward / assistant / programmer / id title name id booktitle Paper id=pid Write aid=id Author / /
DBease: Making Databases User-friendly and Easily Accessible Guoliang Li Ju Fan