709 search results - page 7 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...