Complexity of Decision Problems for Simple Regular Expressions

Martens, Wim; Neven, Frank; Schwentick, Thomas

doi:10.1007/978-3-540-28629-5_70

Cited by 43 publications

(46 citation statements)

References 23 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This proves that testing query-based restriction for non-recursive DTDs is in EXPTIME. PSPACE-hardness is proved by a simple reduction of containment of regular expressions [11]. Now, we show that if the conditions P 1 and P 2 are satisfied, then from B * we can construct a filter that proves A 1 ↕ …”

mentioning

confidence: 86%

See 1 more Smart Citation

XML Security Views Revisited

Groz

Staworko

Caron

et al. 2009

Database Programming Languages

View full text Add to dashboard Cite

Abstract. In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and the type of annotations used to define the view. First, we show that the full class of Regular XPath queries is closed under query rewriting. Next, we address the problem of constructing a DTD that describes the view schema, which in general needs not be regular. We propose three different methods of approximating the view schema and we show that the produced DTDs are indistinguishable from the exact schema (with queries from a class specific for each method). Finally, we investigate problems of static analysis of security access specifications.

show abstract

mentioning

confidence: 86%

“…We assume the DTD to be unchanged which allows to eliminate the factor of comparing DTDs from our analysis. We recall that testing equivalence and inclusion of DTDs is known to be PSPACE-complete [11]. Also, we use again arbitrary annotations.…”

Section: Static Analysis Of Security Access Specificationsmentioning

confidence: 99%

XML Security Views Revisited

Groz

Staworko

Caron

et al. 2009

Database Programming Languages

View full text Add to dashboard Cite

show abstract

“…(The problem of AxPRE containment is related to that of regular expression containment [14].) After finding the node, DescribeX proceeds to change α to α, which in fact modifies the description of the node and thus the neighbourhood it summarizes.…”

Section: From Xpath To Axpresmentioning

confidence: 99%

Fast Answering of XPath Query Workloads on Web Collections

Consens

Rizzolo

Database and XMLTechnologies

View full text Add to dashboard Cite

Abstract. Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively on increasingly larger web collections containing hundreds of thousands of XML documents. Even when tasks only need to deal with a single document at a time, developers benefit from understanding the behaviour of XPath expressions across multiple documents (e.g., what will a query return when run over the thousands of hourly feeds collected during the last few months?). Dealing with the (highly variable) structure of such web collections poses additional challenges. This paper introduces DescribeX, a powerful framework that is capable of describing arbitrarily complex XML summaries of web collections, enabling the efficient evaluation of XPath workloads (supporting all the axes and language constructs in XPath). Experiments validate that DescribeX enables existing document-at-a-time XPath tools to scale up to multi-gigabyte XML collections.

show abstract

“…The automaton is an extension of the Aho-Corasick [6], the de facto standard for fast keyword scanning. Finding every instance of a regular expression pattern, including overlaps, is a "complex" problem both in space and time [5]. Matching a complete set of regular expressions adds another level of complexity: DotStar employs a novel mechanism for combining several regular expressions into a single engine while keeping the complexity of the problem under control.…”

Section: High-level Protocol Processing With Dotstarmentioning

confidence: 99%

Faster FAST: multicore acceleration of streaming financial data

Agarwal

Bader

Lin

et al. 2009

Comp. Sci. Res. Dev.

View full text Add to dashboard Cite

By 2010, the global options and equity markets will average over 128 billion messages per day, amounting to trillions of dollars in trades. Trading systems, the backbone of the low-latency high-frequency business, need fundamental research and innovation to overcome their current processing bottlenecks. With market data rates rapidly growing, the financial community is demanding solutions that are extremely fast, flexible, adaptive, and easy to manage. This paper explores multiple avenues to deal with the decoding and normalization of Option Price Reporting Authority (OPRA) stock market data feeds encoded with FIX Adapted for Streaming (FAST) representation, on commodity multicore platforms, and describes a novel solution that encodes the OPRA protocol with a high-level description language. Our algorithm achieves a processing rate of 15 million messages per second in the fastest single socket configuration on an Intel Xeon E5472, which is an order of magnitude higher than the current needs of the financial systems. We also present an in-depth performance evaluation that exposes important properties of our OPRA parsing algorithm on a collection of multicore processors.

show abstract

Complexity of Decision Problems for Simple Regular Expressions

Cited by 43 publications

References 23 publications

XML Security Views Revisited

XML Security Views Revisited

Fast Answering of XPath Query Workloads on Web Collections

Faster FAST: multicore acceleration of streaming financial data

Contact Info

Product

Resources

About