Autocompletion in full text transaction entry: a method for humanized input
CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Multidimensional access methods
ACM Computing Surveys (CSUR)
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Scalable browsing for large collections: a case study
DL '00 Proceedings of the fifth ACM conference on Digital libraries
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Placing search in context: the concept revisited
Proceedings of the 10th international conference on World Wide Web
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Two-dimensional substring indexing
Journal of Computer and System Sciences - Special issu on PODS 2001
A commonsense approach to predictive text entry
CHI '04 Extended Abstracts on Human Factors in Computing Systems
Type less, find more: fast autocompletion search with a succinct index
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Learning to complete sentences
ECML'05 Proceedings of the 16th European conference on Machine Learning
ESTER: efficient search on text, entities, and relations
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Output-sensitive autocompletion search
Information Retrieval
Efficient interactive fuzzy keyword search
Proceedings of the 18th international conference on World wide web
Efficient interactive smart keyword search
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Efficient fuzzy full-text type-ahead search
The VLDB Journal — The International Journal on Very Large Data Bases
Space-efficient algorithms for document retrieval
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hi-index | 0.00 |
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query word that would lead to the best hits, and also display the best such hits. The following problem is at the core of this feature: for a fixed document collection, given a set D of documents, and an alphabetical range W of words, compute the set of all word-in-document pairs (w,d) from the collection such that w ∈W and d∈D. We present a new data structure with the help of which such autocompletion queries can be processed, on the average, in time linear in the input plus output size, independent of the size of the underlying document collection. At the same time, our data structure uses no more space than an inverted index. Actual query processing times on a large test collection correlate almost perfectly with our theoretical bound.