735 search results - page 43 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
SSD
2007
Springer
15 years 6 months ago
2007
Springer
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
123
click to vote
DLOG
2011
2011
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
14 years 3 months ago
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
177
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
153
click to vote
SIGMOD
2005
ACM
16 years 1 days ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
PVLDB
2008
14 years 11 months ago
2008
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...