A System for Virtual Directories Using Euler Diagrams

In this paper, we describe how to use Euler Diagrams to represent virtual directories. i.e. collection of files that are computed on demand and satisfy a number of constraints. We, then, briefly describe the state of VennFS project that is currently modified to include this new capability. In particular, we show a data structure designed to answer queries about a given Euler Diagram and its sets. The data structure EulerTree described here is based on the R-Tree (see [Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar and Herman J. Haverkort, Box-trees and R-trees with near-optimal query time, in: Symposium on Computational Geometry, 2001, pp. 124-133]), a data structure designed for answering range queries over a family of shapes in the 2-dimensional space.