4081 search results - page 416 / 817 » Metaprogramming for Relational Databases |
167
Voted
SIGMOD
2004
ACM
16 years 7 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...
185
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
169
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance b...
157
click to vote
PODS
2003
ACM
16 years 7 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
155
click to vote
PODS
2004
ACM
16 years 7 months ago
2004
ACM
d abstract) Michael Benedikt Bell Labs Jan Van den Bussche Limburgs Universitair Centrum Christof L?oding Lehrstuhl Informatik VII RWTH Aachen Thomas Wilke Institut f?ur Informatik...