6004 search results - page 713 / 1201 » Parallelizing query optimization |
152
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
215
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
220
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Searching for all occurrences of a twig pattern in an XML document is an important operation in XML query processing. Recently a holistic method TwigStack [2] has been proposed. T...
141
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
While the XML Stylesheet Language for Transformations (XSLT) was not designed as a query language, it is well-suited for many query-like operations on XML documents including sele...
148
click to vote
PODS
2002
ACM
16 years 4 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...