610 search results - page 113 / 122 » Efficient Query Evaluation on Probabilistic Databases |
112
click to vote
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
Re-occurrence of the same problem is very common in many large software products. By matching the symptoms of a new problem to those in a database of known problems, automated dia...
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
135
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
145
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
122
click to vote
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...