We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...