Abstract
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 |t|n, our representation allows to store the set using only O(3n |t|) space. Several basic operations on the sets are shown to be efficiently executable on the representation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. Journal of Functional Programming 13, 961–1004 (2003)
Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2, 57–811 (1968)
Niwinski, D.: Fixed points vs. infinite generation. In: LICS, pp. 402–409 (1988)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems 30, 444–491 (2005)
Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for Web information extraction. Journal of the ACM 51, 74–113 (2004)
Neven, F., Bussche, J.V.D.: Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM 49, 56–100 (2002)
Meuss, H., Schulz, K.U., Bry, F.: Towards aggregated answers for semistructured data. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 346–360. Springer, Heidelberg (2000)
Filiot, E., Tison, S.: Regular n-ary queries in trees and variable independence. In: International Conference on Theoretical Computer Science (TCS), pp. 429–443 (2008)
Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. Journal of the ACM 49, 716–752 (2002)
Dietz, P.F.: Maintaining order in a linked list. In: STOC, pp. 122–127 (1982)
Inaba, K., Hosoya, H.: XML transformation language based on monadic second order logic. In: Programming Language Technologies for XML (PLAN-X), pp. 49–60 (2007)
Berlea, A., Seidl, H.: Binary queries for document trees. Nordic Journal of Computing 11, 41–71 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inaba, K., Hosoya, H. (2009). Compact Representation for Answer Sets of n-ary Regular Queries. In: Maneth, S. (eds) Implementation and Application of Automata. CIAA 2009. Lecture Notes in Computer Science, vol 5642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02979-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02979-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02978-3
Online ISBN: 978-3-642-02979-0
eBook Packages: Computer ScienceComputer Science (R0)