Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

A Logic File System

On the one hand, hierarchical organizations are rigid in the sense that there is only one path to each document. On the other hand, keyword-based search is flexible because many sets of keywords may lead to the same document, but it lacks a navigation mechanism. We present the new paradigm of a logic file system, which integrates navigation and classification, and the possibility of expressive queries. This paradigm associates logical descriptions to files, and logical deduction serves as a basis for navigation and querying; paths are formulas. A key notion is the extension of a logical formula: i.e., the set of all files whose description satisfies the formula. The root directory is determined by formula $\mathit{true}$, and sub-directories of a directory are determined by formulas whose extension strictly intersects the directory extension. This gives a logical ground for considering navigation as computing relevant hints to help refining a query. A prototype implementation demonstrates encouraging performances.

Yoann Padioleau, IRISA / University of Rennes

Olivier Ridoux, IRISA / University of Rennes

BibTeX
@inproceedings {270239,
author = {Yoann Padioleau and Olivier Ridoux},
title = {A Logic File System},
booktitle = {2003 USENIX Annual Technical Conference (USENIX ATC 03)},
year = {2003},
address = {San Antonio, TX},
url = {https://www.usenix.org/conference/2003-usenix-annual-technical-conference/logic-file-system},
publisher = {USENIX Association},
month = jun
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/usenix03/tech/full_papers/padioleau/padioleau.pdf
Paper (HTML): 
http://usenix.org/publications/library/proceedings/usenix03/tech/full_papers/padioleau/padioleau_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us