NDLI: Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling

Content Provider	IEEE Xplore Digital Library
Author	Rong-Hua Li Yu, J.X. Rui Mao Tan Jin
Copyright Year	2014
Description	Author affiliation: Chinese Univ. of Hong Kong, Hong Kong, China (Yu, J.X.) \|\| Northeastern Univ., Shenyang, China (Tan Jin) \|\| Guangdong Province Key Lab. of Popular High Performance Comput., Shenzhen Univ., Shenzhen, China (Rong-Hua Li; Rui Mao)
Abstract	In this paper, we introduce two types of query evaluation problems on uncertain graphs: expectation query evaluation and threshold query evaluation. Since these two problems are #P-complete, most previous solutions for these problems are based on naive Monte-Carlo (NMC) sampling. However, NMC typically leads to a large variance, which significantly reduces its effectiveness. To overcome this problem, we propose two classes of estimators, called class-I and class-II estimators, based on the idea of stratified sampling. More specifically, we first propose two classes of basic stratified sampling estimators, named BSS-I and BSS-II, which partition the entire population into $2^{r}$ and r+1 strata by picking r edges respectively. Second, to reduce the variance, we find that both BSS-I and BSS-II can be recursively performed in each stratum. Therefore, we propose two classes of recursive stratified sampling estimators called RSS-I and RSS-II respectively. Third, for a particular kind of problem, we propose two cut-set based stratified sampling estimators, named BCSS and RCSS, to further improve the accuracy of the class-I and class-II estimators. For all the proposed estimators, we prove that they are unbiased and their variances are significantly smaller than that of NMC. Moreover, the time complexity of all the proposed estimators are the same as the time complexity of NMC under a mild assumption. In addition, we also apply the proposed estimators to influence function evaluation and expected-reliable distance query problem, which are two instances of the query evaluation problems on uncertain graphs. Finally, we conduct extensive experiments to evaluate our estimators, and the results demonstrate the efficiency, accuracy, and scalability of the proposed estimators.
Sponsorship	IEEE Comput. Soc.
Starting Page	892
Ending Page	903
File Size	362540
Page Count	12
File Format	PDF
ISBN	9781479925551
DOI	10.1109/ICDE.2014.6816709
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-03-31
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Query processing Nickel Time complexity Accuracy Resource management Vectors Partitioning algorithms
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

Recursive Stratified Sampling: A New Framework for Query Evaluation on Uncertain Graphs

Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling,” Technical Report, Available at http://nhpcc.szu.edu.cn/icdeugsampler.pdf (2013)

Recursive Stratified Sampling: A New Framework for Query Evaluation on Uncertain Graphs

Efficient stratified sampling implementations in multiresponse simulation

Scalable Query Optimization for Efficient Data Processing Using MapReduce

Efficient SPARQL Query Evaluation in a Database Cluster

Towards efficient query processing on massive time-evolving graphs

Parallel scaling-free and area-time efficient CORDIC algorithm

Image congealing via efficient feature selection

Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling

Similar Documents

Recursive Stratified Sampling: A New Framework for Query Evaluation on Uncertain Graphs

Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling,” Technical Report, Available at http://nhpcc.szu.edu.cn/icdeugsampler.pdf (2013)

Recursive Stratified Sampling: A New Framework for Query Evaluation on Uncertain Graphs

Efficient stratified sampling implementations in multiresponse simulation

Scalable Query Optimization for Efficient Data Processing Using MapReduce

Efficient SPARQL Query Evaluation in a Database Cluster

Towards efficient query processing on massive time-evolving graphs

Parallel scaling-free and area-time efficient CORDIC algorithm

Image congealing via efficient feature selection

Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling