Advertisement

Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams

  • Iovka Boneva
  • Joachim Niehren
  • Momar SakhoEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11123)

Abstract

We study the problem of certain query answering (Cqa) on compressed string patterns. These are incomplete singleton context-free grammars, that can model systems of multiple streams with references to others, called hyperstreams more recently. In order to capture regular path queries on strings, we consider nondeterministic finite automata (Nfas) for query definition. It turns out that Cqa for Boolean Nfa queries is equivalent to regular string pattern inclusion, i.e., whether all strings completing a compressed string pattern belong to a regular language. We prove that Cqa on compressed string patterns is PSpace-complete for Nfa queries. The PSpace-hardness even applies to Boolean queries defined by deterministic finite automata (Dfas) and without compression. We also show that Cqa on compressed linear string patterns can be solved in PTime for Dfa queries.

Notes

Acknowledgments

We are thankful to C. Paperman, who saw the PSpace-hardness of regular string pattern matching in a discussion on the topic. We thank S. Salvati and S. Tison for discussions on regular string pattern matching. It is a pleasure to thank all the anonymous reviewers for their extraordinary helpful feedback.

References

  1. 1.
    Angles, R., Arenas, M., Barceló, P., Hogan, A., Reutter, J.L., Vrgoc, D.: Foundations of modern graph query languages. CoRR, abs/1610.06264 (2016)Google Scholar
  2. 2.
    Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46–62 (1980)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Babai, L., Szemeredi, E.: On the complexity of matrix group problems i. In: Proceedings of the 25th Annual Symposium on Foundations of Computer Science, SFCS 1984, pp. 229–240. IEEE Computer Society, Washington, DC (1984)Google Scholar
  4. 4.
    Benedikt, M., Jeffrey, A., Ley-Wild, R.: Stream firewalling of XML constraints. In: ACM SIGMOD International Conference on Management of Data, pp. 487–498. ACM-Press (2008)Google Scholar
  5. 5.
    Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513–539 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Björklund, H., Gelade, W., Martens, W.: Incremental XPath evaluation. ACM Trans. Database Syst. 35(4), 29 (2010)CrossRefGoogle Scholar
  7. 7.
    Blondin, M., Krebs, A., McKenzie, P.: The complexity of intersecting finite automata having few final states. Comput. Complex. 25(4), 775–814 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Boneva, I., Niehren, J., Sakho, M.: Approximating certain query answering on hyperstreams. Technical report, June 2018Google Scholar
  9. 9.
    David, C., Libkin, L., Murlak, F.: Certain answers for XML queries. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, Indianapolis, Indiana, USA, 6–11 June 2010, pp. 191–202. ACM (2010)Google Scholar
  10. 10.
    Debarbieux, D., Gauwin, O., Niehren, J., Sebastian, T., Zergaoui, M.: Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578, 100–125 (2015)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Gascón, A., Godoy, G., Schmidt-Schauß, M.: Context matching for compressed terms. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, Pittsburgh, PA, USA, 24–27 June 2008, pp. 93–102. IEEE Computer Society (2008)Google Scholar
  12. 12.
    Gauwin, O., Niehren, J.: Streamable fragments of forward XPath. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 3–15. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-22256-6_2CrossRefzbMATHGoogle Scholar
  13. 13.
    Gauwin, O., Niehren, J., Tison, S.: Earliest query answering for deterministic nested word automata. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 121–132. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-03409-1_12CrossRefGoogle Scholar
  14. 14.
    Gauwin, O., Niehren, J., Tison, S.: Queries on XML streams with bounded delay and concurrency. Inf. Comput. 209, 409–442 (2011)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Green, T.J., Gupta, A., Miklau, G., Onizuka, M., Suciu, D.: Processing XML streams with deterministic automata and stream indexes. ACM Trans. Database Syst. 29(4), 752–788 (2004)CrossRefGoogle Scholar
  16. 16.
    Kay, M.: A streaming XSLT processor. In: Balisage: The Markup Conference 2010. Balisage Series on Markup Technologies, vol. 5 (2010)Google Scholar
  17. 17.
    Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977, pp. 254–266. IEEE Computer Society (1977)Google Scholar
  18. 18.
    Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: 16th International Conference on World Wide Web, pp. 1053–1062. ACM-Press (2007)Google Scholar
  19. 19.
    Kupferman, O., Vardi, M.Y.: Model checking of safety properties. Form. Methods Syst. Des. 19(3), 291–314 (2001)CrossRefGoogle Scholar
  20. 20.
    Labath, P., Niehren, J.: A functional language for hyperstreaming XSLT. Technical report, INRIA Lille (2013)Google Scholar
  21. 21.
    Maneth, S., Ordóñez, A., Seidl, H.: Transforming XML streams with references. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 33–45. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-23826-5_4CrossRefGoogle Scholar
  22. 22.
    Mozafari, B., Zeng, K., Zaniolo, C.: High-performance complex event processing over XML streams. In: Candan, K.S., et al. (eds.) SIGMOD Conference, pp. 253–264. ACM (2012)Google Scholar
  23. 23.
    Olteanu, D.: SPEX: streamed and progressive evaluation of XPath. IEEE Trans. Know. Data Eng. 19(7), 934–949 (2007)CrossRefGoogle Scholar
  24. 24.
    Plandowski, W.: The complexity of the morphism equivalence problem for context-free languages. Ph.D. thesis. Department of Informatics, Mathematics, and Mechanics, Warsaw University (1995)Google Scholar
  25. 25.
    Schmidt, M., Scherzinger, S., Koch, C.: Combined static and dynamic analysis for effective buffer minimization in streaming XQuery evaluation. In: 23rd IEEE International Conference on Data Engineering, pp. 236–245 (2007)Google Scholar
  26. 26.
    Straubing, H.: Finite Automata, Formal Logic and Circuit Complexity. Progress in Computer Science and Applied Series. Birkhäuser, Basel (1994)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Université de LilleLilleFrance
  2. 2.Inria LilleLilleFrance

Personalised recommendations