2524 search results - page 191 / 505 » Numerical document queries |
136
click to vote
ERCIMDL
2010
Springer
15 years 5 months ago
2010
Springer
Given a set of keyphrases, we analyze how Web queries with these phrases can be formed that, taken altogether, return a specified number of hits. The use case of this problem is a ...
170
click to vote
NJC
2006
15 years 4 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
170
click to vote
JIDM
2010
14 years 11 months ago
2010
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
154
click to vote
JACM
2010
15 years 2 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
255
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...