.tabbox {width:400px; margin-top: 15px;margin-bottom: 5px} .tabmenu {width:400px;height:28px;border-left:1px solid #CCC;border-top:1px solid #ccc;} .tabmenu ul {margin:0;padding:0;list-style-type: none;} .tabmenu li { text-align:center; float:left; display:block; width:99px; overflow:hidden; background-color: #f1f1f1; line-height:27px; border-right:#ccc 1px solid; border-bottom:#ccc 1px solid; display:inline;} .tabmenu .cli {text-align:center;float:left;display:block;width:99px;overflow:hidden;background-color: #fff;line-height:27px;border-right:#ccc 1px solid;border-bottom:#fff 1px solid;display:inline; cursor:pointer; color: #810505; font-weight:bold} #tabcontent {width:399px;background-color:#fff;border-left:#CCC 1px solid;border-right:#CCC 1px solid;border-bottom:#CCC 1px solid; height:60px;} #tabcontent ul {margin:0;padding:5px;list-style-type: none;} #tabcontent .hidden {display:none;} Search Browse by Issue Fig/Tab Adv Search
 HOME ABOUT JCST AUTHORS REVIEWERS PUBLISHED PAPERS FORTHCOMING PAPERS

Journal of Computer Science and Technology ›› 2019, Vol. 34 ›› Issue (6): 1203-1216.

Special Issue: Data Management and Data Mining

• Data Management and Data Mining •

### Interval Estimation for Aggregate Queries on Incomplete Data

An-Zhen Zhang, Jian-Zhong Li, Fellow, CCF, Member, ACM, Hong Gao, Senior Member, CCF, Member, ACM

1. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
• Received:2018-12-26 Revised:2019-09-12 Online:2019-11-16 Published:2019-11-16
• About author:An-Zhen Zhang is a lecturer at Shenyang Aerospace University, Shenyang. She received her Ph.D. degree in computer software and theory from Harbin Institute of Technology, Harbin, in 2019. Her research interests include data quality and cloud computing.
• Supported by:
This work was supported by the Young Scientists Fund of the National Natural Science Foundation of China under Grant No. 61702344.

Incomplete data has been a longstanding issue in the database community, and the subject is yet poorly handled by both theories and practices. One common way to cope with missing values is to complete their imputation (filling in) as a preprocessing step before analyses. Unfortunately, not a single imputation method could impute all missing values correctly in all cases. Users could hardly trust the query result on such complete data without any confidence guarantee. In this paper, we propose to directly estimate the aggregate query result on incomplete data, rather than to impute the missing values. An interval estimation, composed of the upper and the lower bound of aggregate query results among all possible interpretations of missing values, is presented to the end users. The ground-truth aggregate result is guaranteed to be among the interval. We believe that decision support applications could benefit significantly from the estimation, since they can tolerate inexact answers, as long as there are clearly defined semantics and guarantees associated with the results. Our main techniques are parameter-free and do not assume prior knowledge about the distribution and missingness mechanisms. Experimental results are consistent with the theoretical results and suggest that the estimation is invaluable to better assess the results of aggregate queries on incomplete data.

 [1] Osborne J W. Best Practices in Data Cleaning:A Complete Guide to Everything You Need to Do Before and After Collecting Your Data (1st edition). SAGE Publications, Inc., 2012.[2] Rahm E, Do H H. Data cleaning:Problems and current approaches. IEEE Data Eng. Bull., 2000, 23(4):3-13.[3] Little R J, Rubin D B. Statistical Analysis with Missing Data (2nd Edition, Kindle Edition). Wiley-Interscience, 2014.[4] Zhang A, Wang J, Li J, Gao H. Aggregate query processing on incomplete data. In Proc. the 2nd International Joint Conference on Web and Big Data, July 2018, pp.286-294.[5] Jr W L. On semantic issues connected with incomplete information databases. ACM Trans. Database Syst., 1979, 4(3):262-296.[6] Reiter R. On closed world data bases. In Proc. the 1977 Symposium on Logic and Data Bases, November 1977, pp.55-76.[7] Codd E. Extending the database relational model to capture more meaning. ACM Trans. Database Syst., 1979, 4(4):397-434.[8] Lakshminarayan K, Harp S A, Samad T. Imputation of missing data in industrial databases. Appl. Intell., 1999, 11(3):259-275.[9] Mayfield C, Neville J, Prabhakar S. ERACER:A database approach for statistical inference and data cleaning. In Proc. the ACM SIGMOD International Conference on Management of Data, June 2010, pp.75-86.[10] Abiteboul S, Hull R, Vianu V. Foundations of Databases. Addison-Wesley, 1995.[11] Grahne G. The Problem of Incomplete Information in Relational Databases. Springer, 1991.[12] Imielinski T, Jr W L. Incomplete information in relational databases. J. ACM, 1984, 31(4):761-791.[13] van der Meyden R. Logical approaches to incomplete information:A survey. In Logics for Databases and Information Systems, Chomicki J, Saake G (eds.), Springer, 1998, pp.307-356.[14] Codd E F. Understanding relations (Installment #6). FDT-Bulletin of ACM SIGMOD, 1975, 7(1):1-4.[15] Date C J. Database in Depth Relational Theory for Practitioners. O'Reilly, 2005.[16] Date C. A critique of Claude Rubinson's paper nulls, threevalued logic, and ambiguity in SQL:Critiquing date's critique. SIGMOD Record, 2008, 37(3):20-22.[17] Date C J, Darwen H. A Guide to SQL Standard (4th edition). Addison-Wesley, 1997.[18] Grant J. Null values in a relational data base. Inf. Process. Lett., 1977, 6(5):156-157.[19] Abiteboul S, Kanellakis P C, Grahne G. On the representation and querying of sets of possible worlds. Theor. Comput. Sci., 1991, 78(1):158-187.[20] Sarle W S. Prediction with missing inputs. In Proc. the 4th Joint Conference on Information Sciences, October 1998, pp.399-402.[21] Feelders A. Handling missing data in trees:Surrogate splits or statistical imputation? In Proc. the 3rd European Conference on Principles of Data Mining and Knowledge Discovery, September 1999, pp.329-334.[22] Sande I G. Hot-deck imputation procedures. Incomplete Data in Sample Surveys, 1983, 3:339-349.[23] Buck S F. A method of estimation of missing values in multivariate data suitable for use with an electronic computer. Journal of the Royal Statistical Society. Series B (Methodological), 1960, 22(2):302-306.[24] Duda R O, Hart P E. Pattern Classification and Scene Analysis (1st edition). Wiley, 1973.[25] Ghahramani Z, Jordan M I. Mixture models for learning from incomplete data. Computational Learning Theory and Natural Learning Systems, 1997, 4:67-85.[26] van Buuren S, Mulligen E V, Brand J P L. Routine multiple imputation in statistical databases. In Proc. the 7th International Working Conference on Scientific and Statistical Database Management, September 1994, pp.74-78.[27] Rubin D B. Multiple imputation after 18+ years. Journal of the American statistical Association, 1996, 91(434):473-489.[28] Li K H. Imputation using Markov chains. Journal of Statistical Computation and Simulation, 1988, 30(1):57-79.[29] Rubin D B. Multiple Imputation for Nonresponse in Surveys. John Wiley & Sons, 2004.[30] Schafer J L. Analysis of Incomplete Multivariate Data (1st edition). Chapman and Hall/CRC, 1997.
 [1] Zhi-Xin Qi, Hong-Zhi Wang, An-Jie Wang. Impacts of Dirty Data on Classification and Clustering Models: An Experimental Evaluation [J]. Journal of Computer Science and Technology, 2021, 36(4): 806-821. [2] Yong-Nan Liu, Jian-Zhong Li, Zhao-Nian Zou. Determining the Real Data Completeness of a Relational Dataset [J]. , 2016, 31(4): 720-740. [3] Yue-Feng Du, De-Rong Shen, Tie-Zheng Nie, Yue Kou, Ge Yu. Content-Related Repairing of Inconsistencies in Distributed Data [J]. , 2016, 31(4): 741-758. [4] Wenfei Fan, Jin-Peng Huai. Querying Big Data: Bridging Theory and Practice [J]. , 2014, 29(5): 849-869. [5] Ai-Hua Wu, Zi-Jing Tan, and Wei Wang, Senior Member, CCF. Annotation Based Query Answer over Inconsistent Database [J]. , 2010, 25(3): 469-481. [6] Taghi M. Khoshgoftaar and Pierre Rebours. Improving Software Quality Prediction by Noise Filtering Techniques [J]. , 2007, 22(3): 387-396 .
Viewed
Full text

Abstract

Cited

Shared
Discussed
 [1] Jin Lan; Yang Yuanyuan;. A Modified Version of Chordal Ring[J]. , 1986, 1(3): 15 -32 . [2] Fan Zhihua;. Vectorization for Loops with Three-Forked Jumps[J]. , 1988, 3(3): 186 -202 . [3] Shen Li;. Testability Analysis at Switch Level for CMOS Circuits[J]. , 1990, 5(2): 197 -202 . [4] Guo Qingping; Y. Paker;. Communication Analysis and Granularity Assessment for a Transputer-Based System[J]. , 1990, 5(4): 347 -362 . [5] Harald E. Otto;. UNDO, An Aid for Explorative Learning?[J]. , 1992, 7(3): 226 -236 . [6] Gu Junzhong;. Modelling Enterprises with Object-Oriented Paradigm[J]. , 1993, 8(3): 80 -89 . [7] Jin Guohua; Chen Fujie;. On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies[J]. , 1994, 9(1): 1 -26 . [8] Zhou Yong; Tang Zesheng;. Constructing Isosurfaces from 3D Data Sets Taking Account of Depth Sorting of Polyhedra[J]. , 1994, 9(2): 117 -127 . [9] Zhou Jianqiang; Xie Li; Dai Fei; Sun Zhongxiu;. Adaptive Memory Coherence Algorithms in DSVM[J]. , 1994, 9(4): 365 -372 . [10] Xu Manwu; Lu Jianfeng; Zeng Fancong; Dai Jinwn;. A Formal Semantics for DAI Language NUML[J]. , 1995, 10(3): 227 -238 .
 ISSN 1000-9000(Print)          1860-4749(Online) CN 11-2296/TP Home Editorial Board Author Guidelines Subscription Journal of Computer Science and Technology Institute of Computing Technology, Chinese Academy of Sciences P.O. Box 2704, Beijing 100190 P.R. China Tel.:86-10-62610746 E-mail: jcst@ict.ac.cn