Sciweavers

211 search results - page 10 / 43
» Ranked Query Processing in Uncertain Databases
Sort
View
CIDM
2007
IEEE
13 years 11 months ago
An Efficient Distance Calculation Method for Uncertain Objects
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
Lurong Xiao, Edward Hung
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
14 years 7 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 7 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
FUIN
2006
139views more  FUIN 2006»
13 years 7 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
PPAM
2005
Springer
14 years 1 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale