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
The input/output complexity of sorting and related problems
Communications of the ACM
Multidimensional access methods
ACM Computing Surveys (CSUR)
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
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
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
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Inverted files versus suffix arrays for locating patterns in primary memory
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Output-Sensitive autocompletion search
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Learning to complete sentences
ECML'05 Proceedings of the 16th European conference on Machine Learning
The myriad virtues of wavelet trees
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
DBLP-SSE: A DBLP Search Support Engine
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Extracting authoring information based on keywords and semantic search
Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications
Engineering basic algorithms of an in-memory text search engine
ACM Transactions on Information Systems (TOIS)
COMMA: A Result-Oriented Composite Autocompletion Method for E-marketplaces
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Web Intelligence and Agent Systems
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.