735 search results - page 26 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
CDB
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
214
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
102
Voted
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better ...
IDEAS
2007
IEEE
15 years 6 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...