An Efficient Eigenvalue-based P2P XML Routing Framework

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 eigenvalu...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Qiang Wang, Ozsu, M.T.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Degradation Eigenvalues and eigenfunctions Encoding Indexing IP networks Peer to peer computing Query processing Routing Web services XML
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	112
container_issue
container_start_page	105
container_title
container_volume
creator	Qiang Wang Ozsu, M.T.
description	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.
doi_str_mv	10.1109/P2P.2007.20
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4343470</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4343470</ieee_id><sourcerecordid>4343470</sourcerecordid><originalsourceid>FETCH-LOGICAL-i105t-6e43851bb53e0123c7e8b3c9f28b3f74f860eeacbcdd5475b504450d423a17063</originalsourceid><addsrcrecordid>eNotjk1LAzEURQMqWGtXLt3kD6S-fLzJZFnK1AojFlFwV5KZlxJtpzIzVfz3BvReuGd3uIzdSJhLCe5uozZzBWDznLErsIVD5coCztlEyUIKjegu2WwY3iFHOyyNmjC76HgVY2oSdSOv0o66L78_kQh-oJZnKX97rPnz8TSmbsdXvT_Q97H_uGYX0e8Hmv1zyl5X1ctyLeqn-4flohZJAo6iIKNLlCGgJpBKN5bKoBsXVUa0JuaDRL4JTduisRgQjEFojdJeWij0lN3-eRMRbT_7dPD9z9boXAv6F6WqQ0I</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An Efficient Eigenvalue-based P2P XML Routing Framework</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Qiang Wang ; Ozsu, M.T.</creator><creatorcontrib>Qiang Wang ; Ozsu, M.T.</creatorcontrib><description>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.</description><identifier>ISSN: 2161-3559</identifier><identifier>ISBN: 0769529860</identifier><identifier>ISBN: 9780769529868</identifier><identifier>DOI: 10.1109/P2P.2007.20</identifier><language>eng</language><publisher>IEEE</publisher><subject>Degradation ; Eigenvalues and eigenfunctions ; Encoding ; Indexing ; IP networks ; Peer to peer computing ; Query processing ; Routing ; Web services ; XML</subject><ispartof>Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007, p.105-112</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4343470$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4343470$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Qiang Wang</creatorcontrib><creatorcontrib>Ozsu, M.T.</creatorcontrib><title>An Efficient Eigenvalue-based P2P XML Routing Framework</title><title>Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)</title><addtitle>P2P</addtitle><description>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.</description><subject>Degradation</subject><subject>Eigenvalues and eigenfunctions</subject><subject>Encoding</subject><subject>Indexing</subject><subject>IP networks</subject><subject>Peer to peer computing</subject><subject>Query processing</subject><subject>Routing</subject><subject>Web services</subject><subject>XML</subject><issn>2161-3559</issn><isbn>0769529860</isbn><isbn>9780769529868</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjk1LAzEURQMqWGtXLt3kD6S-fLzJZFnK1AojFlFwV5KZlxJtpzIzVfz3BvReuGd3uIzdSJhLCe5uozZzBWDznLErsIVD5coCztlEyUIKjegu2WwY3iFHOyyNmjC76HgVY2oSdSOv0o66L78_kQh-oJZnKX97rPnz8TSmbsdXvT_Q97H_uGYX0e8Hmv1zyl5X1ctyLeqn-4flohZJAo6iIKNLlCGgJpBKN5bKoBsXVUa0JuaDRL4JTduisRgQjEFojdJeWij0lN3-eRMRbT_7dPD9z9boXAv6F6WqQ0I</recordid><startdate>200709</startdate><enddate>200709</enddate><creator>Qiang Wang</creator><creator>Ozsu, M.T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200709</creationdate><title>An Efficient Eigenvalue-based P2P XML Routing Framework</title><author>Qiang Wang ; Ozsu, M.T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i105t-6e43851bb53e0123c7e8b3c9f28b3f74f860eeacbcdd5475b504450d423a17063</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Degradation</topic><topic>Eigenvalues and eigenfunctions</topic><topic>Encoding</topic><topic>Indexing</topic><topic>IP networks</topic><topic>Peer to peer computing</topic><topic>Query processing</topic><topic>Routing</topic><topic>Web services</topic><topic>XML</topic><toplevel>online_resources</toplevel><creatorcontrib>Qiang Wang</creatorcontrib><creatorcontrib>Ozsu, M.T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Qiang Wang</au><au>Ozsu, M.T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An Efficient Eigenvalue-based P2P XML Routing Framework</atitle><btitle>Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)</btitle><stitle>P2P</stitle><date>2007-09</date><risdate>2007</risdate><spage>105</spage><epage>112</epage><pages>105-112</pages><issn>2161-3559</issn><isbn>0769529860</isbn><isbn>9780769529868</isbn><abstract>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.</abstract><pub>IEEE</pub><doi>10.1109/P2P.2007.20</doi><tpages>8</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2161-3559
ispartof	Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007, p.105-112
issn	2161-3559
language	eng
recordid	cdi_ieee_primary_4343470
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Degradation Eigenvalues and eigenfunctions Encoding Indexing IP networks Peer to peer computing Query processing Routing Web services XML
title	An Efficient Eigenvalue-based P2P XML Routing Framework
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T07%3A21%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20Efficient%20Eigenvalue-based%20P2P%20XML%20Routing%20Framework&rft.btitle=Seventh%20IEEE%20International%20Conference%20on%20Peer-to-Peer%20Computing%20(P2P%202007)&rft.au=Qiang%20Wang&rft.date=2007-09&rft.spage=105&rft.epage=112&rft.pages=105-112&rft.issn=2161-3559&rft.isbn=0769529860&rft.isbn_list=9780769529868&rft_id=info:doi/10.1109/P2P.2007.20&rft_dat=%3Cieee_6IE%3E4343470%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4343470&rfr_iscdi=true