Sciweavers

85 search results - page 17 / 17
» Top-k Query Processing in Uncertain Databases
Sort
View
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 5 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
DASFAA
2008
IEEE
116views Database» more  DASFAA 2008»
13 years 7 months ago
MBR Models for Uncertainty Regions of Moving Objects
The increase in the advanced location based services such as traffic coordination and management necessitates the need for advanced models tracking the positions of Moving Objects ...
Shayma Alkobaisi, Wan D. Bae, Seon Ho Kim, Byunggu...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 5 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
JASIS
2000
120views more  JASIS 2000»
13 years 5 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
13 years 10 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...