Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Scalable Filtering of XML Data for Web Services
IEEE Internet Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Scalable Protocol for Content-Based Routing in Overlay Networks
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Implementing a scalable XML publish/subscribe system using relational database systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Bloom Filter-Based XML Packets Filtering for Millions of Path Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Distributed XML Stream Filtering System with High Scalability
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Publish/subscribe functionality in IR environments using structured overlay networks
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
FiST: scalable XML document filtering by sequencing twig patterns
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Predicate-based Filtering of XPath Expressions
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Efficient xml data dissemination with piggybacking
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Towards an internet-scale XML dissemination service
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Early profile pruning on XML-aware publish-subscribe systems
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Xml data dissemination using automata on top of structured overlay networks
Proceedings of the 17th international conference on World Wide Web
Scalable Distribution of XML Content with XNet
IEEE Transactions on Parallel and Distributed Systems
Value-based predicate filtering of XML documents
Data & Knowledge Engineering
Routing of XML and XPath Queries in Data Dissemination Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Fine-grained parallel XML filtering for content-based publish/subscribe systems
Proceedings of the 5th ACM international conference on Distributed event-based system
FoXtrot: Distributed structural and value XML filtering
ACM Transactions on the Web (TWEB)
| Hi-index | 0.00 |
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it is considered equally important to deal with value-based predicates. In this paper, we propose methods to combine both structural and value XML filtering in a distributed environment based on distributed hash tables. Structural matching is performed using automata, while we study different methods for evaluating value-based predicates. As a result, our algorithms scale in both the size of the query set and the number of the predicates per query. We perform an experimental evaluation and demonstrate the strengths and weaknesses of the proposed methods in both a controlled environment of a cluster and on a real testbed provided by the PlanetLab network.