Sciweavers

38 search results - page 4 / 8
» A probabilistic model for data cube compression and query ap...
Sort
View
120
Voted
WWW
2006
ACM
16 years 4 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
221
Voted
VLDB
2005
ACM
109views Database» more  VLDB 2005»
16 years 3 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
128
Voted
ICDT
2010
ACM
219views Database» more  ICDT 2010»
16 years 1 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
238
Voted
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 5 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...
128
Voted
SSD
2007
Springer
124views Database» more  SSD 2007»
15 years 9 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...