Large-scale information processing environments must rapidly search through massive streams of raw data to locate useful information. These data streams contain textual and numeri...
Ian Gorton, Justin Almquist, Nick Cramer, Jereme H...
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
In this paper, we propose a simple framework to characterize the switching behavior between search engines based on click streams. We segment users into a number of categories bas...