610 search results - page 16 / 122 » Efficient Query Evaluation on Probabilistic Databases |
100
click to vote
DAGSTUHL
1998
14 years 11 months ago
1998
Hypothetical queries are queries embedding hypotheses about the database. The embedded hypothesis in a hypothetical query indicates, so to say, a state of the database intended for...
WAIM
2010
Springer
14 years 7 months ago
2010
Springer
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
ICDE
2010
IEEE
15 years 9 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...
167
click to vote
ICDE
2009
IEEE
15 years 11 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...
167
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...