1890 search results - page 151 / 378 » Querying Big Data by Accessing Small Data |
165
click to vote
EDBT
2010
ACM
15 years 9 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...
303
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
175
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
215
click to vote
IS
2011
14 years 10 months ago
2011
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
138
click to vote
ER
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we present a volume data model amenable to querying volumes in databases. Unlike most existing volume models, which are directed towards specific applications (notab...