386 search results - page 41 / 78 » Probabilistic Ranking of Database Query Results |
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
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 ...
VLDB
2009
ACM
14 years 9 months ago
2009
ACM
Abstract The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it ...
ECIR
2003
Springer
13 years 10 months ago
2003
Springer
Uncertain inference is a probabilistic generalisation of the logical view on databases, ranking documents according to their probabilities that they logically imply the query. For ...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. In this paper, we propose a m...