论文信息 - Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams

Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams

A complete inverted file is an abstract data type that provides functions for text retrieval. Using it, we can retrieve frequencies and occurrences of strings for given texts. There have been various complete inverted files for texts. However, complete inverted files for graphs have not been studied. In this paper, we define complete inverted files based on sequence binary decision diagrams (SDD) for directed acyclic graphs (DAG). Directed acyclic graphs are given as sequence binary decision diagrams. We propose new complete inverted files called PosFSDD and PosFSDDdag for a text and a DAG, respectively. We also present algorithms to construct them and to retrieve occurrence information from them. Computational experiments are executed to show the efficiency of PosFSDDs.

Hiroki Arimura | Koji Tsuda | Shin-ichi Minato | Shuhei Denzumi

[1] Shin-ichi Minato,et al. An efficient algorithm for constructing a Sequence Binary Decision Diagram representing a set of reversed sequences , 2011, 2011 IEEE International Conference on Granular Computing.

[2] David Haussler,et al. Complete inverted files for efficient text retrieval and analysis , 1987, JACM.

[3] James Bailey,et al. A binary decision diagram based approach for mining frequent subsequences , 2010, Knowledge and Information Systems.

[4] Mehryar Mohri,et al. Factor Automata of Automata and Applications , 2007, CIAA.

[5] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Dominique Perrin,et al. Finite Automata , 1958, Philosophy.

[8] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[9] W. Marsden. I and J , 2012 .

[10] Shin-ichi Minato,et al. Zero-suppressed BDDs and their applications , 2001, International Journal on Software Tools for Technology Transfer.

[11] Donald E. Knuth,et al. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[12] Hiroki Arimura,et al. Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations , 2011, Stringology.