627 search results - page 26 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
174
click to vote
ICDE
1995
IEEE
15 years 11 months ago
1995
IEEE
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
195
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
71
Voted
SSDBM
2006
IEEE
15 years 3 months ago
2006
IEEE
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
174
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
COMAD
2008
14 years 11 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...