610 search results - page 40 / 122 » Efficient Query Evaluation on Probabilistic Databases |
104
Voted
SIGMOD
2004
ACM
16 years 20 days ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
109
Voted
SSD
2009
Springer
15 years 7 months ago
2009
Springer
Outsourcing data to third party data providers is becoming a common practice for data owners to avoid the cost of managing and maintaining databases. Meanwhile, due to the populari...
204
click to vote
SIGMOD
2009
ACM
16 years 22 days ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
127
click to vote
SSDBM
1999
IEEE
15 years 4 months ago
1999
IEEE
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
CORR
2010
Springer
15 years 18 days ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...