File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICDE.2019.00142
- Scopus: eid_2-s2.0-85066899178
- WOS: WOS:000477731600135
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Efficient Batch One-Hop Personalized PageRanks
Title | Efficient Batch One-Hop Personalized PageRanks |
---|---|
Authors | |
Keywords | Personalized PageRank Graph Algorithm Query Processing Social Networks Indexing |
Issue Date | 2019 |
Publisher | IEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000178 |
Citation | The 35th IEEE International Conference on Data Engineering (ICDE 2019), Macau, China, 8-11 April 2019, p. 1562-1565 How to Cite? |
Abstract | Personalized PageRank (PPR) is a classic measure of the relevance among different nodes in a graph. Existing work on PPR has mainly focused on three general types of queries, namely, single-pair PPR, single-source PPR, and all-pair PPR. However, there are applications that rely on a new query type (referred to as batch one-hop PPR), which takes as input a set S of source nodes and, for each node s in S and each of s's neighbor v, asks for the PPR value of v with respect to s. None of the existing PPR algorithms is able to efficiently process batch one-hop queries, due to the inherent differences between batch one-hop PPR and the three general query types. To address the limitations of existing algorithms, this paper presents Baton, an algorithm for batch one-hop PPR that offers strong practical efficiency. |
Description | Poster Presentation - Short Papers: Session 1 – no. 39 |
Persistent Identifier | http://hdl.handle.net/10722/261933 |
ISSN | 2023 SCImago Journal Rankings: 1.306 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Luo, S | - |
dc.contributor.author | Xiao, X | - |
dc.contributor.author | Lin, W | - |
dc.contributor.author | Kao, CM | - |
dc.date.accessioned | 2018-09-28T04:50:34Z | - |
dc.date.available | 2018-09-28T04:50:34Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | The 35th IEEE International Conference on Data Engineering (ICDE 2019), Macau, China, 8-11 April 2019, p. 1562-1565 | - |
dc.identifier.issn | 1084-4627 | - |
dc.identifier.uri | http://hdl.handle.net/10722/261933 | - |
dc.description | Poster Presentation - Short Papers: Session 1 – no. 39 | - |
dc.description.abstract | Personalized PageRank (PPR) is a classic measure of the relevance among different nodes in a graph. Existing work on PPR has mainly focused on three general types of queries, namely, single-pair PPR, single-source PPR, and all-pair PPR. However, there are applications that rely on a new query type (referred to as batch one-hop PPR), which takes as input a set S of source nodes and, for each node s in S and each of s's neighbor v, asks for the PPR value of v with respect to s. None of the existing PPR algorithms is able to efficiently process batch one-hop queries, due to the inherent differences between batch one-hop PPR and the three general query types. To address the limitations of existing algorithms, this paper presents Baton, an algorithm for batch one-hop PPR that offers strong practical efficiency. | - |
dc.language | eng | - |
dc.publisher | IEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000178 | - |
dc.relation.ispartof | International Conference on Data Engineering. Proceedings | - |
dc.rights | International Conference on Data Engineering. Proceedings. Copyright © IEEE Computer Society. | - |
dc.rights | ©20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | Personalized PageRank | - |
dc.subject | Graph Algorithm | - |
dc.subject | Query Processing | - |
dc.subject | Social Networks | - |
dc.subject | Indexing | - |
dc.title | Efficient Batch One-Hop Personalized PageRanks | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Kao, CM: kao@cs.hku.hk | - |
dc.identifier.authority | Kao, CM=rp00123 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICDE.2019.00142 | - |
dc.identifier.scopus | eid_2-s2.0-85066899178 | - |
dc.identifier.hkuros | 292742 | - |
dc.identifier.spage | 1562 | - |
dc.identifier.epage | 1565 | - |
dc.identifier.isi | WOS:000477731600135 | - |
dc.publisher.place | United States | - |