610 search results - page 19 / 122 » Efficient Query Evaluation on Probabilistic Databases |
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
148
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
MDM
2009
Springer
15 years 4 months ago
2009
Springer
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...