Filters








4,414 Hits in 6.2 sec

Efficient Top-k Query Processing in P2P Network [chapter]

Yingjie He, Yanfeng Shu, Shan Wang, Xiaoyong Du
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
However, top-k query processing in p2p systems is very challenging because the potentially large number of peers may contribute to the query results, which may induce a huge amount of network traffic and  ...  Top-k query is widely used in the search engine and gains great success, which perform the cooperative query by aggregating the database objects' degree of match for each different query predicate and  ...   H-TPUT: This is a varied TPUT algorithm for more efficient top-k query processing in hierarchical distributed networks such as p2p networks [9] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30075-5_37">doi:10.1007/978-3-540-30075-5_37</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i7xk75cod5hmbkzuuzmdctbwla">fatcat:i7xk75cod5hmbkzuuzmdctbwla</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130730035346/http://www.jatit.org/volumes/Vol49No3/43Vol49No3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/60/8f/608f66c35547dfb08f6f22bbc0ff96d3c7062d58.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30075-5_37"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Skyline-based Peer-to-Peer Top-k Query Processing

Akrivi Vlachou, Christos Doulkeridis, Kjetil Norvag, Michalis Vazirgiannis
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2008 IEEE 24th International Conference on Data Engineering</a> </i> &nbsp;
In this paper, we present a novel framework for top-k query processing in largescale P2P networks, where the dataset is horizontally distributed to peers.  ...  Therefore a challenging problem is to support best-match query processing in highly distributed environments.  ...  P2P TOP-k QUERY PROCESSING The overall aim is to provide an infrastructure for answering top-k queries in P2P networks, assuming a superpeer architecture.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2008.4497576">doi:10.1109/icde.2008.4497576</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/VlachouDNV08.html">dblp:conf/icde/VlachouDNV08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ry4hbh7h2fgn5e2m4z3xjey47u">fatcat:ry4hbh7h2fgn5e2m4z3xjey47u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120124181434/http://www.idi.ntnu.no/~noervaag/papers/ICDE2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0f/ad/0fad81b3f0a04c43d97f8d0728ac6c8e44d36288.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2008.4497576"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Semantic link based top-K join queries in P2P networks

Jie Liu, Liang Feng, Chao He
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s4hirppq3jalbopssw22crbwwa" style="color: black;">Proceedings of the 15th international conference on World Wide Web - WWW &#39;06</a> </i> &nbsp;
This paper resolves this issue by organizing peers in a Semantic Link Network Overlay, where semantic links are established to denote the semantic relationship between peers' data schemas.  ...  An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizing the number of objects  ...  Figure 1 . 1 An example of top-K join queries in P2P networks. Figure 2 . 2 General architecture of semantic-link-based top-K join queries in P2P networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1135777.1135987">doi:10.1145/1135777.1135987</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/www/LiuFH06.html">dblp:conf/www/LiuFH06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nvbs7xcprnevxpkldbh2lxwtvu">fatcat:nvbs7xcprnevxpkldbh2lxwtvu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809155913/http://www2006.org/programme/files/pdf/p54.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6b/d0/6bd070f693f883806388cc0b82ec9b3fb4f853f1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1135777.1135987"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Using semantic links to support top-K join queries in peer-to-peer networks

Jie Liu, Liang Feng, Hai Zhuge
<span title="">2007</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o454xj4tdjfllm3oragfkdrffi" style="color: black;">Concurrency and Computation</a> </i> &nbsp;
Secondly, we plan to apply the proposed approach to answering top-K join queries in XML. Finally, we plan to look for a good method of answering top-K join queries in structured P2P networks.  ...  Usually K is quite small compared to the total number of satisfactory answers. USING SEMANTIC LINKS TO SUPPORT TOP-K QUERIES IN P2P NETWORKS tuples and the top-K miss rate.  ...  CONCLUSION In this paper we have proposed a semantic-link-based infrastructure for efficiently processing top-K join queries in P2P networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/cpe.1145">doi:10.1002/cpe.1145</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c2vnwnrjlban7fq3vfi6uhgcz4">fatcat:c2vnwnrjlban7fq3vfi6uhgcz4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808151840/http://www.knowledgegrid.net/~H.Zhuge/data/CCPE%2007%20Using%20semantic%20links%20to%20support%20top-K%20join%20queries%20in%20peer-to-peer%20networks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/a3/cfa38c363464310659564ecae7ba2c58bfcd52e9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/cpe.1145"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Evaluation of top-k queries in peer-to-peer networks using threshold algorithms

Ioannis Chrysakis, Constantinos Chalkidis, Dimitris Plexousakis
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6g37zvjwwrhv3dizi6ffue642m" style="color: black;">Proceedings of the 19th ACM international conference on Information and knowledge management - CIKM &#39;10</a> </i> &nbsp;
In p2p networks, top-k query processing can provide a lot of advantages both in time and bandwidth consumption. Several algorithms have been proposed for the evaluation of top-k queries.  ...  Our experiments demonstrate that in some cases a threshold algorithm can improve top-k query processing, while in others it is far more costly.  ...  In this paper, we study the problem of answering top-k queries efficiently.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1871437.1871607">doi:10.1145/1871437.1871607</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cikm/ChrysakisCP10.html">dblp:conf/cikm/ChrysakisCP10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7izs4gapm5auvf2yckpygka3yi">fatcat:7izs4gapm5auvf2yckpygka3yi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811201530/http://www.ics.forth.gr/isl/publications/paperlink/cikm10_paper_final.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3c/6b/3c6b60907e989f6a2b2c197c9357db7b4d927e6f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1871437.1871607"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Efficient Early Top-k Query Processing in Overloaded P2P Systems [chapter]

William Kokou Dédzoé, Philippe Lamarre, Reza Akbarinia, Patrick Valduriez
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Top-k query processing in P2P systems has focused on efficiently computing the top-k results while reducing network traffic and query response time.  ...  In this paper, we address this problem, which we reformulate as early top-k query processing in P2P systems.  ...  Despite the fact that these top-k query processing solutions reduce network traffic, finding an exact top-k in overload P2P (as the result of very high query loads) with some peers taking a long time to  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23088-2_10">doi:10.1007/978-3-642-23088-2_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w32b4cp75vdrrblfn73phh3sny">fatcat:w32b4cp75vdrrblfn73phh3sny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140829062647/http://hal.inria.fr/docs/00/60/79/20/PDF/2011_-_DEXA_-_Effi_cient_Early_Top-k_Query_Processing_in_Overloaded_P2P_Systems.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ce/ba/ceba3c81ab0f7c9f8628f38e3b0ca064fda56655.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23088-2_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

SART

Spyros Sioutas, Alexandros Panaretos, Ioannis Karydis, Dimitrios Tsoumakos
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uo6yx5jpgnf2zl7mkrumytd4ti" style="color: black;">Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC &#39;12</a> </i> &nbsp;
The adaptation of the P2P index presented in [11] guarantees the best-known dynamic query performance of the above operation.  ...  On this purpose and based on the efficient P2P method presented in [11], we design a dynamic P2P overlay for Energy Level discovery in a sensornet, the so-called SART (Sensors' Autonomous Range Tree).  ...  We achieve these goals with our peer-topeer query processing model on top of a distributed index structure on wireless sensor networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2245276.2245442">doi:10.1145/2245276.2245442</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sac/SioutasPKT12.html">dblp:conf/sac/SioutasPKT12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yd7sw3ag7rhj5ns3rz3kz623kq">fatcat:yd7sw3ag7rhj5ns3rz3kz623kq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809073136/http://users.ionio.gr/~karydis/my_papers/SPKT2012%20-%20SART-Dynamic%20P2P%20Query%20Processing%20in%20Sensor%20Networks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/d9/a8d9f11baf1675cc5f4bc1875e402cb076385c4c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2245276.2245442"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Supporting ranked search in parallel search cluster networks

Fang Xiong, Qiong Luo, Dyce Jing Zhao
<span title="">2005</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6g37zvjwwrhv3dizi6ffue642m" style="color: black;">Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM &#39;05</a> </i> &nbsp;
We investigate how to support ranked keyword search in a Parallel Search Cluster Network, which is a newly proposed peer-to-peer network overlay.  ...  In particular, we study how to efficiently acquire and distribute the global information required by ranked keyword search by taking advantage of the architectural features of PSCNs.  ...  ., LSI, can be applied on top of TF×IDF, to improve the quality of query results and the efficiency of query processing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1099554.1099618">doi:10.1145/1099554.1099618</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cikm/XiongLZ05.html">dblp:conf/cikm/XiongLZ05</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qb7c7v6offayrjatkree2kbcmm">fatcat:qb7c7v6offayrjatkree2kbcmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031151913/http://www.cse.ust.hk/catalac/papers/p2prank_cikm05.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/f4/aef4ad63b83c36e9000c4605720059703c3a2da6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1099554.1099618"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Web text retrieval with a P2P query-driven index

Gleb Skobeltsyn, Toan Luu, Ivana Podnar Zarko, Martin Rajman, Karl Aberer
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ibcfmixrofb3piydwg5wvir3t4" style="color: black;">Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR &#39;07</a> </i> &nbsp;
In this paper, we present a query-driven indexing/retrieval strategy for efficient full text retrieval from large document collections distributed within a structured P2P network.  ...  in user queries.  ...  Acknowledgement: The work presented in this paper was (partly) carried out in the framework of the EPFL Center for Global Computing and supported by the Swiss National Funding Agency FER as part of the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1277741.1277857">doi:10.1145/1277741.1277857</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigir/SkobeltsynLZRA07.html">dblp:conf/sigir/SkobeltsynLZRA07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ltydmzendzgrlatxhkkdyl63ba">fatcat:ltydmzendzgrlatxhkkdyl63ba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812115050/http://www.gleb.ch/papers/Skobeltsyn-SIGIR07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/e8/84e8c7ce2faf6b688d763e9a0871436e8c6544e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1277741.1277857"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Peer-to-peer similarity search over widely distributed document collections

Christos Doulkeridis, Kjetil Nørvåg, Michalis Vazirgiannis
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6g37zvjwwrhv3dizi6ffue642m" style="color: black;">Proceeding of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval - LSDS-IR &#39;08</a> </i> &nbsp;
More importantly, we show how to efficiently process similarity queries capitalizing on the newly constructed, clustered super-peer network.  ...  Such an application is retrieval of the top-k most similar documents in a widely distributed document collection, as in the case of digital libraries.  ...  Our focus is on processing similarity queries q k for the top-k most similar documents to the query.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1458469.1458477">doi:10.1145/1458469.1458477</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cikm/DoulkeridisNV08.html">dblp:conf/cikm/DoulkeridisNV08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rajsws3sevhlzo4pzploisjdbu">fatcat:rajsws3sevhlzo4pzploisjdbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706055204/http://www.idi.ntnu.no/grupper/dif/research/conference_paper/2008/251_LSDS-IR2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/5f/965f889d80f440d5464a74afd283e53311eaa010.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1458469.1458477"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Data Sharing in P2P Systems [chapter]

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
<span title="2009-10-15">2009</span> <i title="Springer US"> Handbook of Peer-to-Peer Networking </i> &nbsp;
In this chapter, we survey P2P data sharing systems.  ...  We conclude by discussing the techniques proposed for processing complex queries (e.g. range and join queries).  ...  As for other complex queries, processing top-k queries in DHTs is quite challenging.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-09751-0_19">doi:10.1007/978-0-387-09751-0_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i5pyj3c53rc6lfdxiqnconhsiq">fatcat:i5pyj3c53rc6lfdxiqnconhsiq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170912174925/https://hal.archives-ouvertes.fr/hal-00379832/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b3/42/b34269f492225bf63de4a0b25d74f3626ef26813.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-09751-0_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Design of a Recommendation System Based on Top-k Query in a Pure P2P Environment

Ying Gao, Jiang Zhan
<span title="">2012</span> <i title="IEEE"> 2012 International Conference on Management of e-Commerce and e-Government </i> &nbsp;
of network topology; and exploits the recommendation information between users with similar interest to achieve the high-efficiency searching of files in the network.  ...  In the paper, we offer a file recommendation system based on pure peer-to-peer system, use the TOPK method to find similar interest peers in a way to realize the interest-based self-adaptive adjustment  ...  The entire query process goes on from bottom to the top until the root peer ultimately finds the top-k results.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icmecg.2012.58">doi:10.1109/icmecg.2012.58</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jrgcthbdabfzhb2ln5jrozx27a">fatcat:jrgcthbdabfzhb2ln5jrozx27a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810112309/http://naturalspublishing.com/files/published/u7v5451n54c5k9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/76/5a76e110c7f097cb43cce1a0fd69b1e1eb397c14.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icmecg.2012.58"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning [chapter]

Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu, Shaogang Qu, Ming Chen
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We propose in this paper a new index partitioning and building scheme, multi-level partitioning (MLP), and discuss its implementation on top of P2P networks.  ...  This paper discusses large scale keyword searching on top of peer-to-peer (P2P) networks.  ...  We will illustrate, in Section 3.2, how to achieve this on top of P2P networks. Query processing Take a query (initiated from node A) containing keyword w 1 and w 2 as an example.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30183-7_15">doi:10.1007/978-3-540-30183-7_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/23gie66hgvgpfki2lfqtz6pbba">fatcat:23gie66hgvgpfki2lfqtz6pbba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060920160234/http://iptps04.cs.ucsd.edu:80/papers/shi-keysearch.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/8c/fb8c62c73e529d3802eef81739fc8999087f456c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30183-7_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Full-text federated search of text-based digital libraries in peer-to-peer networks

Jie Lu, Jamie Callan
<span title="">2006</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qkuxm4jkpnclphpwzqgsg7qnae" style="color: black;">Information retrieval (Boston)</a> </i> &nbsp;
Experimental results demonstrate that the proposed approaches offer a better combination of accuracy and efficiency than more common alternatives for federated search of text-based digital libraries in  ...  This paper provides solutions to full-text federated search of text-based digital libraries in hierarchical peer-to-peer networks.  ...  Any opinions, findings, conclusions or recommendations expressed in this material are the authors', and do not necessarily reflect those of the sponsor.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10791-006-6388-2">doi:10.1007/s10791-006-6388-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eb6s3c7qmfbgtop6nv6qfvt3pi">fatcat:eb6s3c7qmfbgtop6nv6qfvt3pi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417185023/http://www.cs.cmu.edu/~jielu/Papers/jir_jielu_p2pir.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/78/1b/781bf6d5ef7a0be67ea74db2ef187145e4493d56.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10791-006-6388-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Query-driven indexing for peer-to-peer text retrieval

Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Rajman, Ivana Podnar Zarko
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s4hirppq3jalbopssw22crbwwa" style="color: black;">Proceedings of the 16th international conference on World Wide Web - WWW &#39;07</a> </i> &nbsp;
size storing only top-k ranked document references.  ...  We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks.  ...  CONCLUSION We presented a novel query-driven indexing strategy for P2P text retrieval with structured P2P networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1242572.1242757">doi:10.1145/1242572.1242757</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/www/SkobeltsynLARZ07.html">dblp:conf/www/SkobeltsynLARZ07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j75qmwpnlfh5xmlc7oaghbjpwi">fatcat:j75qmwpnlfh5xmlc7oaghbjpwi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081008183811/http://infoscience.epfl.ch/record/101298/files/pp1008-Skobeltsyn.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/c7/63c75b2f7aa2be5c926302455243ace52c61aa63.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1242572.1242757"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 4,414 results