XGossip is a novel gossip algorithm for estimating the number of XML documents that contain a match for an XPath query in a large-scale network.
XGossip uses the Chord DHT to route gossip messages. The source code of Chord (including minor changes to it) is also included.
-
Vasil Slavov, Anas Katib, and Praveen Rao. ``Tool for Internet-Scale Cardinality Estimation of XPath Queries over Distributed Semistructured Data." Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE 2014), Chicago, IL, April 2014. (Demo)
-
Vasil Slavov and Praveen Rao. ``A Gossip-Based Approach for Internet-Scale Cardinality Estimation of XPath Queries over Distributed Semistructured Data." The International Journal on Very Large Databases (VLDB Journal 2014), Volume 23, Issue 1, 2014, pp. 56-71.
-
Vasil Slavov. ``A Study of Gossip Algorithms for Internet-Scale Cardinality Estimation of Distributed XML Data." (Master's thesis), ProQuest Dissertations and Theses, 2012, pp. 82.
-
Vasil Slavov and Praveen Rao. ``Towards Internet-Scale Cardinality Estimation of XPath Queries over Distributed XML Data." Proceedings of the 6th International Workshop on Networking Meets Databases (NetDB 2011), Athens, Greece, June 2011, pp. 1-8.
This work was supported by the National Science Foundation under Grant No. 1115871, IBM Smarter Planet Faculty Innovation Award, University of Missouri Research Board, and Amazon Web Services (AWS) Education Research Grant.