This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
ConQueSt is a constraint-based querying system devised with the aim of supporting the intrinsically exploratory nature of pattern discovery. It provides users with an expressive c...
Francesco Bonchi, Fosca Giannotti, Claudio Lucches...
The proliferation of the World Wide Web has brought information retrieval (IR) techniques to the forefront of search technology. To the average computer user, “searching” now ...
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Paralleldatabasesystemshaveto supportboth inter-transaction as well as intra-transaction parallelism. Inter-uansaction parahelism (multi-user mode) is required to achieve high thr...