This position paper provides an overview of our recent advances in the study of big graphs,
from theory to systems to applications. We introduce a theory of bounded evaluability, to …

Answering 2ueries Using Views Page 1 173 CHAPTER 7 Answering 2ueries Using Views he
problem of answering queries using views suggests several theoretical questions. In this …

This paper proposes BEAS, a resource-bounded scheme for querying relations. It is
parameterized with a resource ratio α∈(0, 1], indicating that given a big dataset D, we can …

We demonstrate BEAS, a prototype system for querying relations with bounded resources.
BEAS advocates an unconventional query evaluation paradigm under an access schema A …

A mechanism for rewriting a bounded query onto a view is disclosed. A query, access
constraints, and cached view (s) are obtained. The cached view (s) contain results of the …

The increasing number of network-shaped domains calls for the use of graph database
technology, where there are continuous efforts to develop mechanisms to address domain …

The increasing number of network-shaped domains calls for the use of graph database
technology, where there are continuous efforts to develop mechanisms to address domain …

Big data is not new to us. Many efforts are devoted to efficient and parallel query processing
of big data. Nevertheless there are still some missing pieces in the technical stack. Existing …

It could be prohibitively costly to query big relations, even with the power of parallel
processing on clusters containing thousands of machines. The tremendous resource burden …

Bounded evaluation using views is to compute the answers Q (D) to a query Q in a dataset D
by accessing only cached views and a small fraction D_Q of D such that the size| D_Q| of …