76 search results - page 7 / 16 » Boolean ranking: querying a database by k-constrained opti... |
156
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
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...
114
click to vote
EDBT
2011
ACM
14 years 28 days ago
2011
ACM
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
163
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
SEMWEB
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...