2010年8月
Compact representation for answer sets of n-ary regular queries
THEORETICAL COMPUTER SCIENCE
- ,
- 巻
- 411
- 号
- 38-39
- 開始ページ
- 3481
- 終了ページ
- 3492
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.tcs.2010.05.026
- 出版者・発行元
- ELSEVIER SCIENCE BV
An n-ary query over trees takes an input tree t and returns a set of n-tuples of the nodes of t. In this paper, a compact data structure is introduced for representing the answer sets of n-ary queries defined by tree automata. Despite that the number of the elements of the answer set can be as large as vertical bar t vertical bar(n), our representation allows storing the set using only O(vertical bar t vertical bar) space. Several basic operations on the sets are shown to be efficiently executable on the representation. (C) 2010 Elsevier B.V. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.tcs.2010.05.026
- ISSN : 0304-3975
- Web of Science ID : WOS:000282151100009