Sciweavers

176 search results - page 7 / 36
» Supporting ranking queries on uncertain and incomplete data
Sort
View
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 7 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic ranking over relations
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...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
CIKM
2009
Springer
14 years 2 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang
ECWEB
2004
Springer
97views ECommerce» more  ECWEB 2004»
14 years 26 days ago
Supporting User Query Relaxation in a Recommender System
This paper presents a new technology for supporting flexible query management in recommender systems. It is aimed at guiding a user in refining her query when it fails to return ...
Nader Mirzadeh, Francesco Ricci, Mukesh Bansal
EDBT
2009
ACM
207views Database» more  EDBT 2009»
13 years 10 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...