Peer-to-Peer Computing, IEEE International Conference on (2007)
Sept. 2, 2007 to Sept. 5, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2007.20
M. Tamer Ozsu , Univ. of Waterloo, Canada
Qiang Wang , Univ. of Waterloo, Canada
Many emerging applications that use XML are distributed, usually over large peer-to-peer (P2P) networks on the Internet. The deployment of an XML query shipping system over P2P networks requires a specialized synopsis to capture XML data in routing tables. In this paper, we propose a novel eigenvalue-based routing synopsis for deployment over unstructured P2P networks. Based on well-established Cauchy?s Interlacing Theorem, our approach employs multiple eigenvalues as routing synopsis and facilitates query routing process with computationally-inexpensive range inequality checking. Through extensive experiments, we demonstrate the effectiveness of our approach.
M. Tamer Ozsu, Qiang Wang, "An Efficient Eigenvalue-based P2P XML Routing Framework", Peer-to-Peer Computing, IEEE International Conference on, vol. 00, no. , pp. 105-112, 2007, doi:10.1109/P2P.2007.20