17049 search results - page 3108 / 3410 » cans 2007 |
262
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
246
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
275
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
251
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...