In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, w...
Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkov...
With the total energy consumption of computing systems increasing in a steep rate, much attention has been paid to the design of energy-efficient computing systems and applications...
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...