333 search results - page 27 / 67 » Read-Once Functions and Query Evaluation in Probabilistic Da... |
213
click to vote
VLDB
2004
ACM
16 years 3 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
133
Voted
ISPAN
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper is concerned with the transparent parallelisation of declarative database queries, based on theoretical principles. We have designed an entire database architecture sui...
KES
2007
Springer
15 years 9 months ago
2007
Springer
The current Information Retrieval Systems return hundreds or thousands of documents in response to a query. Users consider only the first 20 or 30, but documents are often sorted a...
230
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
156
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...