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

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Reachability Problems

• Publication date

  2018-07-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-030-00250-3_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Foundations of Modern Graph Query Languages

  2016cited by this paper
• Transforming XML Streams with References

  2015cited by this paper
• A Functional Language for Hyperstreaming XSLT

  2013cited by this paper
• Early nested word automata for XPath query answering on XML streams

  2013cited by this paper
• High-performance complex event processing over XML streams

  2012cited by this paper
• The complexity of intersecting finite automata having few final states

  2012cited by this paper
• Streamable Fragments of Forward XPath

  2011influential reference
• Queries on Xml streams with bounded delay and concurrency

  2011cited by this paper
• Incremental XPath evaluation

  2010cited by this paper
• Certain answers for XML queries

  2010cited by this paper
• A Streaming XSLT Processor

  2010cited by this paper
• Random access to grammar-compressed strings

  2010cited by this paper
• Earliest Query Answering for Deterministic Nested Word Automata

  2009influential reference
• Incremental XPath evaluation

  2009cited by this paper
• Stream firewalling of xml constraints

  2008influential reference
• Context Matching for Compressed Terms

  2008cited by this paper
• Visibly pushdown automata for streaming XML

  2007cited by this paper
• SPEX: Streamed and Progressive Evaluation of XPath

  2007cited by this paper
• Combined Static and Dynamic Analysis for Effective Buffer Minimization in Streaming XQuery Evaluation

  2007cited by this paper
• Processing XML streams with deterministic automata and stream indexes

  2004cited by this paper
• Model Checking of Safety Properties

  1999cited by this paper
• The Complexity of the Morphism Equivalence Problem for Context-Free Languages

  1995cited by this paper
• Finite Automata, Formal Logic, and Circuit Complexity

  1994cited by this paper
• On the Complexity of Matrix Group Problems I

  1984cited by this paper
• Finding Patterns Common to a Set of Strings

  1980cited by this paper
• Lower bounds for natural proof systems

  1977influential reference
• "PROOF"

  1934cited by this paper

• Regular matching and inclusion on compressed tree patterns with constrained context variables

  2021cites this paper
• Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables

  2019cites this paper