NDLI: 3-Hop: A Novel Hop-Based Reachability Index

Content Provider	IEEE Xplore Digital Library
Author	Xiaorui Jiang Xiaoping Sun Qiang Zeng Hai Zhuge
Copyright Year	2013
Description	Author affiliation: Sch. of Inf. Eng., Zhejiang Univ. of Technol., Hangzhou, China (Xiaorui Jiang) \|\| Inst. of Comput. Technol., Beijing, China (Xiaoping Sun; Hai Zhuge) \|\| Dept. of Comput. Sci., Univ. of Wisconsin-Madison, Madison, WI, USA (Qiang Zeng)
Abstract	A reachability query is to ask whether there exists a path between two nodes in a directed graph. To build a compact index for efficiently handling reachability queries, most existing approaches label the nodes of a small induced subgraph as the base index to cover a portion of transitive information and then either explicitly store or encode the remaining transitive information into a complementary index. Although hop-based methods have the most compact index size, they inevitably suffer from big index construction costs in terms of long indexing time and huge memory consumption. This paper proposes a new hop-based indexing scheme 3-Hop* that greatly reduces index construction costs than state-of-the-art hop-based indices. 3-Hop* first extracts a planar induces subgraph which consists of a spanning tree and the set of short non-tree edges to label graph nodes for covering more reachability information in the base index as well as providing more hop choices for building the complementary index. Then, an efficient labeling algorithm is proposed for encoding the remaining transitive information with a smaller index size based on the up-per-bound density heuristic and early-stop hop selection strategy. Extensive experiments over real and synthetic datasets show that 3-Hop* is the most efficient and effective hop-based reachability indexing method scalable for large sparse graphs.
Starting Page	157
Ending Page	164
File Size	1432002
Page Count	8
File Format	PDF
ISBN	9781479930128
DOI	10.1109/SKG.2013.21
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-10-03
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Query processing Memory management Solids Labeling Indexing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in