Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007) An Efficient Eigenvalue-based P2P XML Routing Framework Galway, Ireland September 02-September 05 ISBN: 0-7695-2986-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2007.20
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.
Citation:
Qiang Wang, M. Tamer Ozsu, "An Efficient Eigenvalue-based P2P XML Routing Framework," p2p, pp.105-112, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb