651 search results - page 1 / 131 » Algebraic Query Optimization for Distributed Top-k Queries |
255
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
135
Voted
SSDBM
2005
IEEE
15 years 9 months ago
2005
IEEE
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
156
Voted
DC
2008
15 years 3 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
139
Voted
PVLDB
2010
15 years 1 months ago
2010
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
171
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
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 ...