NDLI: The Reachability Query over Distributed Uncertain Graphs

Content Provider	IEEE Xplore Digital Library
Author	Yurong Cheng Ye Yuan Lei Chen Guoren Wang
Copyright Year	2015
Description	Author affiliation: Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China (Yurong Cheng; Ye Yuan; Guoren Wang) \|\| Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China (Lei Chen)
Abstract	Reachability, one of the most fundamental queries over uncertain graphs, which asks the probability that two given query vertices are reachable over an uncertain graph. Although this problem has been widely studied, the existing works are all processed in a single server. However, as graph data becomes larger, it usually cannot be stored in a single server. Moreover, processing probabilistic reachability queries is #P-complete, so the calculation is very expensive even on small graphs. Thus, in this paper, our purpose is to develop efficient distributed strategies to firstly pick out all the maximal subgraphs whose reachability probabilities can be calculated in polynomial time efficiently. After this step, only a small graph remains, and we provide an approximate method. Extensive experimental studies show that our distributed algorithms are efficient and have a low communication cost.
Starting Page	786
Ending Page	787
File Size	158239
Page Count	2
File Format	PDF
ISBN	9781467372145
ISSN	10636927
DOI	10.1109/ICDCS.2015.109
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-29
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Servers Probability Polynomials Distributed databases Distributed algorithms Master-slave Conferences
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

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

Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data

Controlled Information Sharing in Collaborative Distributed Query Processing

Improving data freshness in lazy master schemes

Design of a distributed neuro-genetic learning architecture

Growing Secure Distributed Systems from a Spore

On Server Provisioning for Distributed Interactive Applications

Partial database replication using epidemic communication

Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases

The Client Assignment Problem for Continuous Distributed Interactive Applications

The Reachability Query over Distributed Uncertain Graphs

Similar Documents

Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data

Controlled Information Sharing in Collaborative Distributed Query Processing

Improving data freshness in lazy master schemes

Design of a distributed neuro-genetic learning architecture

Growing Secure Distributed Systems from a Spore

On Server Provisioning for Distributed Interactive Applications

Partial database replication using epidemic communication

Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases

The Client Assignment Problem for Continuous Distributed Interactive Applications

The Reachability Query over Distributed Uncertain Graphs