The many faces of publish/subscribe

PT Eugster, PA Felber, R Guerraoui… - ACM computing surveys …, 2003 - dl.acm.org
Well adapted to the loosely coupled nature of distributed interaction in large-scale
applications, the publish/subscribe communication paradigm has recently received …

A subexponential algorithm for the discrete logarithm problem with applications to cryptography

L Adleman - 20th Annual Symposium on Foundations of Computer …, 1979 - computer.org
In this paper we describe a new method for encoding data streams on system buses in order
to reduce bus line transition activity. Our focus is on data streams whose statistical …

Path sharing and predicate evaluation for high-performance XML filtering

Y Diao, M Altinel, MJ Franklin, H Zhang… - ACM Transactions on …, 2003 - dl.acm.org
XML filtering systems aim to provide fast, on-the-fly matching of XML-encoded data to large
numbers of query specifications containing constraints on both structure and content. It is …

Efficient algorithms for processing XPath queries

G Gottlob, C Koch, R Pichler - ACM Transactions on Database Systems …, 2005 - dl.acm.org
Our experimental analysis of several popular XPath processors reveals a striking fact: Query
evaluation in each of the systems requires time exponential in the size of queries in the …

[PDF][PDF] Schema-free xquery

Y Li, C Yu, HV Jagadish - … of the Thirtieth international conference on Very …, 2004 - vldb.org
The widespread adoption of XML holds out the promise that document structure can be
exploited to specify precise database queries. However, the user may have only a limited …

Towards expressive publish/subscribe systems

A Demers, J Gehrke, M Hong, M Riedewald… - Advances in Database …, 2006 - Springer
Traditional content based publish/subscribe (pub/sub) systems allow users to express
stateless subscriptions evaluated on individual events. However, many applications such as …

Stream processing of XPath queries with predicates

AK Gupta, D Suciu - Proceedings of the 2003 ACM SIGMOD international …, 2003 - dl.acm.org
We consider the problem of evaluating large numbers of XPath filters, each with many
predicates, on a stream of XML documents. The solution we propose is to lazily construct a …

XPath satisfiability in the presence of DTDs

M Benedikt, W Fan, F Geerts - Journal of the ACM (JACM), 2008 - dl.acm.org
We study the satisfiability problem associated with XPath in the presence of DTDs. This is
the problem of determining, given a query p in an XPath fragment and a DTD D, whether or …

Processing XML streams with deterministic automata

TJ Green, G Miklau, M Onizuka, D Suciu - International Conference on …, 2002 - Springer
We consider the problem of evaluating a large number of XPath expressions on an XML
stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) …

Efficiently querying large XML data repositories: A survey

G Gou, R Chirkova - IEEE Transactions on Knowledge and …, 2007 - ieeexplore.ieee.org
Extensible markup language (XML) is emerging as a de facto standard for information
exchange among various applications on the World Wide Web. There has been a growing …