1018 search results - page 119 / 204 » On the minimization of XPath queries |
120
Voted
EDBT
2011
ACM
14 years 5 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...
85
Voted
DCC
2008
IEEE
16 years 1 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
123
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
113
click to vote
IDEAS
2005
IEEE
15 years 7 months ago
2005
IEEE
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
121
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: The most renowned biological ontology, Gene Ontology (GO) is widely used for annotations of genes and gene products of different organisms. However, there are shortcom...