Efficient Skyline Computation in Structured Peer-to-Peer Systems
An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this paper, we investigate the multidimensional skyline...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on knowledge and data engineering 2009-07, Vol.21 (7), p.1059-1072 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1072 |
|---|---|
| container_issue | 7 |
| container_start_page | 1059 |
| container_title | IEEE transactions on knowledge and data engineering |
| container_volume | 21 |
| creator | Cui, Bin Chen, Lijiang Xu, Linhao Lu, Hua Song, Guojie Xu, Quanqing |
| description | An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this paper, we investigate the multidimensional skyline computation problem on a structured peer-to-peer network. In order to achieve low communication cost and quick response time, we utilize the iMinMax(\theta ) method to transform high-dimensional data to one-dimensional value and distribute the data in a structured peer-to-peer network called BATON. Thereafter, we propose a progressive algorithm with adaptive filter technique for efficient skyline computation in this environment. We further discuss some optimization techniques for the algorithm, and summarize the key principles of our algorithm into a query routing protocol with detailed analysis. Finally, we conduct an extensive experimental evaluation to demonstrate the efficiency of our approach. |
| doi_str_mv | 10.1109/TKDE.2008.235 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_875016187</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4731252</ieee_id><sourcerecordid>2543469351</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-640ada21f8652a7c46b34d2a7d0f86226adf0085f78a446504427441496e54d3</originalsourceid><addsrcrecordid>eNpdkEtLAzEUhQdRsFaXrtwMgrhKzc1jJrNTan1gQaHdh5hJIHUeNcks-u_N0NKFq3O497uXw8mya8AzAFw9rD-eFzOCsZgRyk-yCXAuEIEKTpPHDBCjrDzPLkLY4ESVAibZ48Jap53pYr762TWuM_m8b7dDVNH1Xe66fBX9oOPgTZ1_GeNR7NGo-WoXomnDZXZmVRPM1UGn2fplsZ6_oeXn6_v8aYk0FTyigmFVKwJWFJyoUrPim7I6uRqnESGFqm3KxG0pFGMFx4yRkjFgVWE4q-k0u9-_3fr-dzAhytYFbZpGdaYfghQlx1CAKBN5-4_c9IPvUjZZAcEUBMMJQntI-z4Eb6zcetcqv5OA5VimHMuUY5kylZn4u8NTFbRqrFedduF4REDgAihJ3M2ec8aY45qVFAgn9A854Hpy</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>912031840</pqid></control><display><type>article</type><title>Efficient Skyline Computation in Structured Peer-to-Peer Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Cui, Bin ; Chen, Lijiang ; Xu, Linhao ; Lu, Hua ; Song, Guojie ; Xu, Quanqing</creator><creatorcontrib>Cui, Bin ; Chen, Lijiang ; Xu, Linhao ; Lu, Hua ; Song, Guojie ; Xu, Quanqing</creatorcontrib><description>An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this paper, we investigate the multidimensional skyline computation problem on a structured peer-to-peer network. In order to achieve low communication cost and quick response time, we utilize the iMinMax(\theta ) method to transform high-dimensional data to one-dimensional value and distribute the data in a structured peer-to-peer network called BATON. Thereafter, we propose a progressive algorithm with adaptive filter technique for efficient skyline computation in this environment. We further discuss some optimization techniques for the algorithm, and summarize the key principles of our algorithm into a query routing protocol with detailed analysis. Finally, we conduct an extensive experimental evaluation to demonstrate the efficiency of our approach.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2008.235</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Adaptive filters ; Algorithms ; Applied sciences ; Computation ; Computer architecture ; Computer networks ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Costs ; Data processing. List processing. Character string processing ; database management ; Delay ; Distributed networks ; Exact sciences and technology ; Information systems. Data bases ; Large-scale systems ; Memory organisation. Data processing ; Multidimensional systems ; Networks ; Optimization ; Peer to peer computing ; Query processing ; Routing (telecommunications) ; Routing protocols ; Software ; Transforms</subject><ispartof>IEEE transactions on knowledge and data engineering, 2009-07, Vol.21 (7), p.1059-1072</ispartof><rights>2009 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-640ada21f8652a7c46b34d2a7d0f86226adf0085f78a446504427441496e54d3</citedby><cites>FETCH-LOGICAL-c385t-640ada21f8652a7c46b34d2a7d0f86226adf0085f78a446504427441496e54d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4731252$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4731252$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21806132$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Cui, Bin</creatorcontrib><creatorcontrib>Chen, Lijiang</creatorcontrib><creatorcontrib>Xu, Linhao</creatorcontrib><creatorcontrib>Lu, Hua</creatorcontrib><creatorcontrib>Song, Guojie</creatorcontrib><creatorcontrib>Xu, Quanqing</creatorcontrib><title>Efficient Skyline Computation in Structured Peer-to-Peer Systems</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this paper, we investigate the multidimensional skyline computation problem on a structured peer-to-peer network. In order to achieve low communication cost and quick response time, we utilize the iMinMax(\theta ) method to transform high-dimensional data to one-dimensional value and distribute the data in a structured peer-to-peer network called BATON. Thereafter, we propose a progressive algorithm with adaptive filter technique for efficient skyline computation in this environment. We further discuss some optimization techniques for the algorithm, and summarize the key principles of our algorithm into a query routing protocol with detailed analysis. Finally, we conduct an extensive experimental evaluation to demonstrate the efficiency of our approach.</description><subject>Adaptive filters</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computation</subject><subject>Computer architecture</subject><subject>Computer networks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Costs</subject><subject>Data processing. List processing. Character string processing</subject><subject>database management</subject><subject>Delay</subject><subject>Distributed networks</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Large-scale systems</subject><subject>Memory organisation. Data processing</subject><subject>Multidimensional systems</subject><subject>Networks</subject><subject>Optimization</subject><subject>Peer to peer computing</subject><subject>Query processing</subject><subject>Routing (telecommunications)</subject><subject>Routing protocols</subject><subject>Software</subject><subject>Transforms</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkEtLAzEUhQdRsFaXrtwMgrhKzc1jJrNTan1gQaHdh5hJIHUeNcks-u_N0NKFq3O497uXw8mya8AzAFw9rD-eFzOCsZgRyk-yCXAuEIEKTpPHDBCjrDzPLkLY4ESVAibZ48Jap53pYr762TWuM_m8b7dDVNH1Xe66fBX9oOPgTZ1_GeNR7NGo-WoXomnDZXZmVRPM1UGn2fplsZ6_oeXn6_v8aYk0FTyigmFVKwJWFJyoUrPim7I6uRqnESGFqm3KxG0pFGMFx4yRkjFgVWE4q-k0u9-_3fr-dzAhytYFbZpGdaYfghQlx1CAKBN5-4_c9IPvUjZZAcEUBMMJQntI-z4Eb6zcetcqv5OA5VimHMuUY5kylZn4u8NTFbRqrFedduF4REDgAihJ3M2ec8aY45qVFAgn9A854Hpy</recordid><startdate>20090701</startdate><enddate>20090701</enddate><creator>Cui, Bin</creator><creator>Chen, Lijiang</creator><creator>Xu, Linhao</creator><creator>Lu, Hua</creator><creator>Song, Guojie</creator><creator>Xu, Quanqing</creator><general>IEEE</general><general>IEEE Computer Society</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20090701</creationdate><title>Efficient Skyline Computation in Structured Peer-to-Peer Systems</title><author>Cui, Bin ; Chen, Lijiang ; Xu, Linhao ; Lu, Hua ; Song, Guojie ; Xu, Quanqing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-640ada21f8652a7c46b34d2a7d0f86226adf0085f78a446504427441496e54d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Adaptive filters</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computation</topic><topic>Computer architecture</topic><topic>Computer networks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Costs</topic><topic>Data processing. List processing. Character string processing</topic><topic>database management</topic><topic>Delay</topic><topic>Distributed networks</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Large-scale systems</topic><topic>Memory organisation. Data processing</topic><topic>Multidimensional systems</topic><topic>Networks</topic><topic>Optimization</topic><topic>Peer to peer computing</topic><topic>Query processing</topic><topic>Routing (telecommunications)</topic><topic>Routing protocols</topic><topic>Software</topic><topic>Transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cui, Bin</creatorcontrib><creatorcontrib>Chen, Lijiang</creatorcontrib><creatorcontrib>Xu, Linhao</creatorcontrib><creatorcontrib>Lu, Hua</creatorcontrib><creatorcontrib>Song, Guojie</creatorcontrib><creatorcontrib>Xu, Quanqing</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cui, Bin</au><au>Chen, Lijiang</au><au>Xu, Linhao</au><au>Lu, Hua</au><au>Song, Guojie</au><au>Xu, Quanqing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Skyline Computation in Structured Peer-to-Peer Systems</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2009-07-01</date><risdate>2009</risdate><volume>21</volume><issue>7</issue><spage>1059</spage><epage>1072</epage><pages>1059-1072</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this paper, we investigate the multidimensional skyline computation problem on a structured peer-to-peer network. In order to achieve low communication cost and quick response time, we utilize the iMinMax(\theta ) method to transform high-dimensional data to one-dimensional value and distribute the data in a structured peer-to-peer network called BATON. Thereafter, we propose a progressive algorithm with adaptive filter technique for efficient skyline computation in this environment. We further discuss some optimization techniques for the algorithm, and summarize the key principles of our algorithm into a query routing protocol with detailed analysis. Finally, we conduct an extensive experimental evaluation to demonstrate the efficiency of our approach.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TKDE.2008.235</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1041-4347 |
| ispartof | IEEE transactions on knowledge and data engineering, 2009-07, Vol.21 (7), p.1059-1072 |
| issn | 1041-4347 1558-2191 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_875016187 |
| source | IEEE Electronic Library (IEL) |
| subjects | Adaptive filters Algorithms Applied sciences Computation Computer architecture Computer networks Computer science control theory systems Computer systems and distributed systems. User interface Costs Data processing. List processing. Character string processing database management Delay Distributed networks Exact sciences and technology Information systems. Data bases Large-scale systems Memory organisation. Data processing Multidimensional systems Networks Optimization Peer to peer computing Query processing Routing (telecommunications) Routing protocols Software Transforms |
| title | Efficient Skyline Computation in Structured Peer-to-Peer Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T20%3A55%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20Skyline%20Computation%20in%20Structured%20Peer-to-Peer%20Systems&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Cui,%20Bin&rft.date=2009-07-01&rft.volume=21&rft.issue=7&rft.spage=1059&rft.epage=1072&rft.pages=1059-1072&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2008.235&rft_dat=%3Cproquest_RIE%3E2543469351%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=912031840&rft_id=info:pmid/&rft_ieee_id=4731252&rfr_iscdi=true |