6905 search results - page 836 / 1381 » Querying Multidimensional Databases |
203
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
203
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
218
click to vote
DEBU
2000
15 years 7 months ago
2000
In a traditional information retrieval system, it is assumed that queries can be posed about any topic. In reality, a large fraction of web queries are posed about a relatively sm...
232
click to vote
VLDB
2002
ACM
15 years 7 months ago
2002
ACM
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
208
click to vote
CASCON
2001
15 years 9 months ago
2001
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...