Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...