3341 search results - page 148 / 669 » On Bounded Queries and Approximation |
LCC
1994
15 years 2 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
198
Voted
SDM
2011
SIAM
14 years 28 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
GRID
2007
Springer
15 years 2 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
ICDT
2007
ACM
15 years 4 months ago
2007
ACM
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...