Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/F2852DF7-8D3C-42E0-B3E0-82B3A7D8DD83 | - |
| Identifier | https://doi.org/10.1109/ICDE.2007.368960 | - |
| Identifier | http://ieeexplore.ieee.org/document/4221750/ | - |
| Language | en | - |
| Title | Tree-pattern similarity estimation for scalable content-based routing | en |
| Creator | Chand Raphael | en |
| Creator | Felber Pascal | en |
| Creator | Garofalakis Minos | en |
| Creator | Γαροφαλακης Μινως | el |
| Publisher | Institute of Electrical and Electronics Engineers | en |
| Content Summary | With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important challenge. Content-based publish/subscribe systems offer a convenient design paradigm, as most of the complexity related to addressing and routing is encapsulated within the network infrastructure. To indicate the type of content that they are interested in, data consumers typically specify their subscriptions using a tree-pattern specification language (an important subset of XPath), while producers publish XML content without prior knowledge of any potential recipients. Discovering semantic communities of consumers with similar interests is an important requirement for scalable content-based systems: such "semantic clusters" of consumers play a critical role in the design of effective content-routing protocols and architectures. The fundamental problem underlying the discovery of such semantic communities lay in effectively evaluating the similarity of different tree-pattern subscriptions based on the observed document stream. In this paper, we propose a general framework and algorithmic tools for estimating different tree-pattern similarity metrics over continuous streams of XML documents. In a nutshell, our approach relies on continuously maintaining a novel, concise synopsis structure over the observed document stream that allows us to accurately estimate the fraction of documents satisfying various Boolean combinations of different tree-pattern subscriptions. To effectively capture different branching and correlation patterns within a limited amount of space, our techniques use ideas from hash-based sampling in a novel manner that exploits the hierarchical structure of our document synopsis. Experimental results with various XML data streams verify the effectiveness of our approach. | en |
| Type of Item | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Type of Item | Conference Full Paper | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-11-30 | - |
| Date of Publication | 2007 | - |
| Subject | Data engineering | en |
| Bibliographic Citation | R. Chand, P. Felber and M. Garofalakis, "Tree-pattern similarity estimation for scalable content-based routing", in IEEE 23rd International Conference on Data Engineering, 2007, pp. 1016-1025. doi: 10.1109/ICDE.2007.368960 | en |
Copyright © DIAS 2013
