1018 search results - page 96 / 204 » On the minimization of XPath queries |
CGF
2004
15 years 1 months ago
2004
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
109
click to vote
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
132
Voted
ICDE
2011
IEEE
14 years 5 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
141
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
145
Voted
PODS
2003
ACM
16 years 1 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...