610 search results - page 33 / 122 » Efficient Query Evaluation on Probabilistic Databases |
218
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
143
click to vote
DIS
2006
Springer
15 years 6 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
122
click to vote
SSDBM
1998
IEEE
15 years 7 months ago
1998
IEEE
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
119
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
133
click to vote
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...