Sciweavers

1038 search results - page 29 / 208
» Space-Bounded Query Approximation
Sort
View
PPAM
2005
Springer
15 years 5 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
178
Voted
ICDE
2004
IEEE
102views Database» more  ICDE 2004»
16 years 1 months ago
Approximate Temporal Aggregation
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
Yufei Tao, Dimitris Papadias, Christos Faloutsos
214
Voted
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
16 years 1 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 2 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 5 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou