Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra...
This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel r...
Sandra de F. Mendes Sampaio, Norman W. Paton, Paul...
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...