Compact Representation for Answer Sets of n-ary Regular Queries Kazuhiro Inabaa , Haruo Hosoyab a National Institute of Informatics, 2-1-1, Hitotsubashi, Chiyoda-ku, Tokyo, Japan University of Tokyo, 7-3-1 Hongo, Bunkyo- - Bunkyo, Tokyo - Document - PDFSEARCH.IO

First Page	Meta Content
	Compact Representation for Answer Sets of n-ary Regular Queries Kazuhiro Inabaa , Haruo Hosoyab a National Institute of Informatics, 2-1-1, Hitotsubashi, Chiyoda-ku, Tokyo, Japan University of Tokyo, 7-3-1 Hongo, Bunkyo- Add to Reading List Document Date: 2010-06-08 09:56:29 Open Document File Size: 196,24 KB Share Result on Facebook City Tokyo / / Company Chiyoda / / Country Japan / / / Event Delayed Filing / Reorganization / / Facility Japan University of Tokyo / / IndustryTerm basic bottom-up algorithm / finite applications / na¨ıve algorithm / ∗-product / inefficient algorithm / / Organization University of Tokyo / National Institute of Informatics / / Person Kazuhiro Inaba / / Position rt / / ProgrammingLanguage XPath / XML / Datalog / / Technology main algorithm / N-ary Query Algorithm / XML / QUERY-RUNA algorithm / basic bottom-up algorithm / same algorithm / na¨ıve algorithm / FFG algorithm / previous na¨ıve algorithm / / SocialTag Lowest common ancestor Theoretical computer science Tree traversal Rope Eval Graph theory Computing Binary trees

Compact Representation for Answer Sets of n-ary Regular Queries Kazuhiro Inabaa , Haruo Hosoyab a National Institute of Informatics, 2-1-1, Hitotsubashi, Chiyoda-ku, Tokyo, Japan University of Tokyo, 7-3-1 Hongo, Bunkyo-Add to Reading List