610 search results - page 52 / 122 » Efficient Query Evaluation on Probabilistic Databases |
203
click to vote
SIGMOD
2008
ACM
16 years 21 days ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
112
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
148
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Abstract Current, data-driven applications have become more dynamic in nature, with the need to respond to events generated from distributed sources or to react to information extr...
183
Voted
SIGMOD
2006
ACM
16 years 21 days ago
2006
ACM
In outsourced database (ODB) systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to acce...
170
click to vote
SIGMOD
2009
ACM
16 years 23 days ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...