Sciweavers

386 search results - page 8 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 11 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
CVPR
2010
IEEE
14 years 3 months ago
Improving web-image search results using query-relative classifiers
Web image search using text queries has received considerable attention. However, current state-of-the-art approaches require training models for every new query, and are therefore...
Josip Krapac, Moray Allan, Jakob Verbeek, Frédér...
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 10 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 2 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
14 years 1 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...