A file search method based on intertask relationships derived from access frequency and RMC operations on files

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The tremendous growth in the number of files stored in filesystems makes it increasingly difficult to find desired files. Traditional keyword-based search engines are incapable of retrieving files that do not include keywords. To tackle this problem, we use file-access logs to derive intertask relationships for file search. Our observations are that 1) files related to the same task are frequently used together, and 2) a set of Rename, Move, and Copy (RMC) operations tends to initiate a new task. We have implemented a system named SUGOI, which detects two types of task, FI tasks and RMC tasks, from file-access logs. An FI task corresponds to a group of files frequently accessed together. An RMC task is generated by RMC operations and then constructs a graph of intertask relationships based on the influence of RMC operations and the similarity between tasks. In utilizing detected tasks and intertask relationships, our system expands the search results of a keyword-based search engine. Experiments using actual file-access logs indicate that the proposed approach significantly improves search results. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wu, Y., Otagiri, K., Watanabe, Y., & Yokota, H. (2011). A file search method based on intertask relationships derived from access frequency and RMC operations on files. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6860 LNCS, pp. 364–378). https://doi.org/10.1007/978-3-642-23088-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free