Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
In a previous paper, we laid out the vision of declarative datadriven coordination (D3C) where users are provided with novel abstractions that enable them to communicate and coord...
Nitin Gupta 0003, Lucja Kot, Gabriel Bender, Sudip...
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...