1611 search results - page 128 / 323 » Queries Independent of Updates |
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
142
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
170
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
169
click to vote
SIGMOD
2007
ACM
15 years 10 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...