We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile s...
Vladimir Zadorozhny, Divyasheel Sharma, Prashant K...
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 algorithm due to M...