We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...