d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Ni...
Recently, there have been proposals for scaling-up a database system using lazy replication. In these proposals, system scale-up is achieved through the addition of secondary site...
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
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...
Business rules are often implemented as stored procedures in a database server. These procedures are triggered by various clients, but the execution load is fully centralized on th...