1445 search results - page 94 / 289 » XPath query containment |
119
click to vote
CCCG
2008
15 years 4 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
126
click to vote
PVLDB
2008
15 years 2 months ago
2008
Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem ...
132
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
130
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
107
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we address the issue of continuous keyword queries on multiple textual streams. This line of work represents a significant departure from previous keyword search mod...