1038 search results - page 39 / 208 » Space-Bounded Query Approximation |
112
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
DASFAA
2004
IEEE
15 years 3 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
115
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
110
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
197
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...