610 search results - page 37 / 122 » Efficient Query Evaluation on Probabilistic Databases |
123
Voted
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
197
Voted
SIGMOD
2009
ACM
16 years 22 days ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
214
Voted
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
125
click to vote
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
96
Voted
EDBT
2004
ACM
16 years 19 days ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...