Incremental maintenance of 2-Hop labeling of large graphs

Ramadhana Bramandia*, Koon Kau CHOI, Wee Keong Ng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Citations (Scopus)

Abstract

Recent interests on xml, the Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the reachability test of nodes. Recently, 2-hop labeling has been proposed to index a large collection of xml and/or graphs for efficient reachability tests. However, there has been few work on updates of 2-hop labeling. This is compounded by the fact that data may often change over time. In response to these, this paper studies incremental maintenance of 2-hop labeling. We identify the main reason for the inefficiency of updates of existing 2-hop labels. We propose three updatable 2-hop labelings, hybrids of 2-hop labeling, and their incremental maintenance algorithms. The proposed 2 - hop labeling is derived from graph connectivity, as opposed to set cover which is used by most previous works. Our experimental evaluation illustrates the space efficiency and update performance of various kinds of 2-hop labelings. Our results show that our incremental maintenance algorithm can be two orders of magnitude faster than previous methods and the size of our 2-hop labeling can be comparable to existing 2-hop labeling. We conclude that there is a natural way to spare some index size for update performance in 2-hop labeling.

Original languageEnglish
Article number4912201
Pages (from-to)682-698
Number of pages17
JournalIEEE Transactions on Knowledge and Data Engineering
Volume22
Issue number5
DOIs
Publication statusPublished - 2010

Scopus Subject Areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

User-Defined Keywords

  • Indexing methods
  • Query processing
  • XML/XSL/RDF

Fingerprint

Dive into the research topics of 'Incremental maintenance of 2-Hop labeling of large graphs'. Together they form a unique fingerprint.

Cite this