342 search results - page 25 / 69 » Branch-and-bound processing of ranked queries |
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
DEBU
2010
13 years 7 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
DMSN
2005
ACM
13 years 9 months ago
2005
ACM
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...