610 search results - page 10 / 122 » Efficient Query Evaluation on Probabilistic Databases |
SYRCODIS
2007
14 years 11 months ago
2007
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and pr...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...
191
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
PODS
2010
ACM
14 years 11 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
DASFAA
2010
IEEE
14 years 10 months ago
2010
IEEE
Achieving data security over cooperating web services is becoming a reality, but existing XML access control architectures do not consider this federated service computing. In this...