3341 search results - page 377 / 669 » On Bounded Queries and Approximation |
251
click to vote
SIGMOD
2005
ACM
16 years 6 months 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...
190
click to vote
EDBTW
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
208
click to vote
DEBS
2009
ACM
16 years 1 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
169
click to vote
VLDB
2007
ACM
16 years 24 days ago
2007
ACM
An increasing number of enterprises outsource their IT services to third parties who can offer these services for a much lower cost due to economy of scale. Quality of service is ...
186
click to vote
COMPGEOM
2006
ACM
16 years 20 days ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...