415 search results - page 20 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
111
click to vote
APWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
93
Voted
CAISE
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...
111
click to vote
COMAD
2008
15 years 1 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
EDBT
2004
ACM
15 years 12 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
GIS
1999
ACM
15 years 4 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...