627 search results - page 37 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
246
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
158
click to vote
SSD
2007
Springer
16 years 3 days ago
2007
Springer
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
263
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Similarity search in time series data is an active area of research. In this paper, we introduce the novel concept of threshold-similarity queries in time series databases which r...
184
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
158
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...