A System for Virtual Directories Using Euler Diagrams | Zendy

Rosario De Chiara | Zendy; Mikael Hammar | Zendy; Vittorio Scarano | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A System for Virtual Directories Using Euler Diagrams

Author(s) -

Rosario De Chiara,

Mikael Hammar,

Vittorio Scarano

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.02.019

Subject(s) - computer science , data structure , euler's formula , theoretical computer science , diagram , tree structure , range (aeronautics) , virtual space , tree (set theory) , combinatorics , mathematics , programming language , database , artificial intelligence , mathematical analysis , materials science , composite material

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research