Sciweavers

586 search results - page 33 / 118
» Ranking queries on uncertain data
Sort
View
DCC
2006
IEEE
14 years 7 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 2 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
WWW
2009
ACM
14 years 8 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 7 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
CIKM
2009
Springer
14 years 6 days ago
Data extraction from the web using wild card queries
This paper presents an overview of our framework for searching and retrieving facts and relationships within natural language text sources. In this framework, an extraction task o...
Davood Rafiei, Haobin Li