SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
StreaMon is the adaptive query processing engine of the STREAM prototype Data Stream Management System (DSMS) [4]. A fundamental challenge in many DSMS applications (e.g., network...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
Sovereign information sharing allows autonomous entities to compute queries across their databases in such a way that nothing apart from the result is revealed. We describe an imp...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a relational database system that significantly imp...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an or...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
SIGMOD
2004
ACM
14 years 11 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...