Sciweavers

211 search results - page 13 / 43
» Ranked Query Processing in Uncertain Databases
Sort
View
MDM
2004
Springer
110views Communications» more  MDM 2004»
14 years 27 days ago
Universal Trajectory Queries for Moving Object Databases
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
Hoda Mokhtar, Jianwen Su
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 10 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
INFORMATICALT
2008
162views more  INFORMATICALT 2008»
13 years 7 months ago
Vague Rough Set Techniques for Uncertainty Processing in Relational Database Model
Abstract. The study of databases began with the design of efficient storage and data sharing techniques for large amount of data. This paper concerns the processing of imprecision ...
Karan Singh, Samajh Singh Thakur, Mangi Lal
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 1 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
WWW
2009
ACM
14 years 8 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan