Space-Bounded Query Approximation
نویسندگان
چکیده
When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identifies a part C of the data D that (i) fits in the available space budget; and (ii) provides accurate query results. That is, for a given query Q, the query result Q(C) is close to the exact answer Q(D). In this paper, we present the theoretical framework underlying our query approximation method and provide an experimental validation of the approach.
منابع مشابه
Approximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملBounded Queries, Approximations, and the Boolean Hierarchy
This paper investigates nondeterministic bounded query classes in relation to the complexity of NP-hard approximation problems and the Boolean Hierarchy. Nondeterministic bounded query classes turn out be rather suitable for describing the complexity of NP-hard approximation problems. The results in this paper take advantage of this machine-based model to prove that in many cases, NP-approximat...
متن کاملLearning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typically be performed eeciently if the theory is Horn. This suggests that it may be more eecient to answer queries using a \Horn approximation"; i.e., a horn theory that is semantically similar to the original theory. The utility of any such approximation depends on how often it produce...
متن کاملDistance Approximation in Bounded-Degree and General Sparse Graphs
We address the problem of approximating the distance of sparse graphs from having some predefined property P. The distance of G from having P is εP(G) if the minimum number of edge modifications needed in order to enforce P on G is εP(G) · m̄, where m̄ is an upper bound on the number of edges in the graph. When dealing with bounded-degree graphs of maximal degree d we take m̄ = dn, where n is the ...
متن کاملIncremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawback is that S can be exponentially larger than the size of the original function. To address this issue, we propose an incremental, approximate compilation technique that guarantees a sound and space-bounded compilatio...
متن کامل