902 search results - page 96 / 181 » Efficient and Extensible Algorithms for Multi Query Optimiza... |
187
click to vote
ICDE
2008
IEEE
16 years 2 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...
103
Voted
EDBT
2006
ACM
16 years 23 days ago
2006
ACM
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
217
click to vote
GIS
2006
ACM
16 years 1 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
103
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
223
click to vote
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...