Sciweavers

386 search results - page 3 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 7 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002
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
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
13 years 8 months ago
Evaluating Query Result Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
Markus Ojala, Gemma C. Garriga, Aristides Gionis, ...
SIGIR
2010
ACM
13 years 4 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...
PVLDB
2010
158views more  PVLDB 2010»
13 years 5 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb