398 search results - page 28 / 80 » Query by output |
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
73
Voted
SSDBM
2007
IEEE
15 years 3 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
COMAD
2008
14 years 11 months ago
2008
In data stream processing systems, Quality of Service (or QoS) requirements, as specified by users, are extremely important. Unlike in a database management system (DBMS), a query...
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...