dc.contributor.author |
Li, Wentao |
|
dc.contributor.author |
Qiao, Miao |
|
dc.contributor.author |
Qin, Lu |
|
dc.contributor.author |
Zhang, Ying |
|
dc.contributor.author |
Chang, Lijun |
|
dc.contributor.author |
Lin, Xuemin |
|
dc.coverage.spatial |
ELECTR NETWORK |
|
dc.date.accessioned |
2022-04-12T04:08:30Z |
|
dc.date.available |
2022-04-12T04:08:30Z |
|
dc.date.issued |
2020-6-11 |
|
dc.identifier.isbn |
9781450367356 |
|
dc.identifier.issn |
0730-8078 |
|
dc.identifier.uri |
https://hdl.handle.net/2292/58689 |
|
dc.description.abstract |
In indexing a graph for distance queries, distance labeling is a common practice; in particular, 2-hop labeling which guarantees the exactness of the query results is widely adopted. When it comes to a massive real graph with a relatively large treewidth such as social networks and web graphs, however, 2-hop labeling can hardly be constructed due to the oversized index. This paper discloses the theoretical relationships between the graph treewidth and 2-hop labeling's index size and query time. To scale up distance labeling, this paper proposes Core-Tree (CT) Index to facilitate a critical and effective trade-off between the index size and query time. The reduced index size enables CT-Index to handle massive graphs that no existing approaches can process while the cost in the query time is negligible: the query time is below 0.4 milliseconds on all tested graphs including one graph with 5.5 billion edges. |
|
dc.publisher |
ACM |
|
dc.relation.ispartof |
SIGMOD/PODS '20: International Conference on Management of Data |
|
dc.relation.ispartofseries |
Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data |
|
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
|
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
|
dc.subject |
Science & Technology |
|
dc.subject |
Technology |
|
dc.subject |
Computer Science, Information Systems |
|
dc.subject |
Computer Science |
|
dc.subject |
2-hop Labeling |
|
dc.subject |
Tree Decomposition |
|
dc.subject |
Shortest Distance |
|
dc.subject |
Indexing |
|
dc.subject |
Algorithm |
|
dc.subject |
Treewidth |
|
dc.subject |
QUERIES |
|
dc.title |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
|
dc.type |
Conference Item |
|
dc.identifier.doi |
10.1145/3318464.3389748 |
|
pubs.begin-page |
1367 |
|
dc.date.updated |
2022-03-14T10:34:58Z |
|
dc.rights.holder |
Copyright: The author |
en |
pubs.author-url |
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000644433700091&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=6e41486220adb198d0efde5a3b153e7d |
|
pubs.end-page |
1381 |
|
pubs.finish-date |
2020-6-19 |
|
pubs.publication-status |
Published |
|
pubs.start-date |
2020-6-14 |
|
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.elements-id |
804861 |
|
pubs.online-publication-date |
2020-6-11 |
|