89 search results - page 10 / 18 » Efficient Aggregation of Ranked Inputs |
164
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
SIGMOD
2000
ACM
15 years 1 months ago
2000
ACM
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
CPM
2007
Springer
15 years 1 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
162
click to vote
ICDE
2004
IEEE
15 years 10 months ago
2004
IEEE
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
151
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...