Data generation using declarative constraints

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 685-696

  Arasu, Arvind ^a   Kaushik, Raghav ^a   Li, Jian ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

benchmarking; constraints; data generation; masking; testing

Indexed keywords

DATABASE SYSTEMS; QUERY PROCESSING;

APPLICATION TESTING; CARDINALITY CONSTRAINTS; CONSTRAINT; DATA CHARACTERISTICS; DATA GENERATION; DECLARATIVE CONSTRAINTS; MASKING; SYNTHETIC DATABASE; SYSTEM TESTING; TESTING DATA;

BENCHMARKING;

EID: 79959964845     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989395     Document Type: Conference Paper

References (33)

1. P. Abbeel, D. Koller, and A. Y. Ng. Learning factor graphs in polynomial time and sample complexity. J. of Machine Learning Research, 7:1743-1788, 2006. (Pubitemid 44274019)
2. A. Aboulnaga, J. F. Naughton, and C. Zhang. Generating synthetic complex-structured XML data. In WebDB, pages 79-84, 2001.
3. W. Aiello, F. Chung, and L. Lu. A random graph model for power law graphs. Experimental Mathematics, 10(1):53-66, 2001.
4. D. Barbosa, A. O. Mendelzon, J. Keenleyside, et al. ToXgene: An extensible template-based data generator for XML. In WebDB, pages 49-54, 2002.
5. C. Binnig, D. Kossmann, and E. Lo. Reverse query processing. In ICDE, pages 506-515, 2007.
6. C. Binnig, D. Kossmann, E. Lo, et al. QAGen: generating query-aware test databases. In SIGMOD, pages 341-352, 2007.
7. N. Bruno and S. Chaudhuri. Flexible database generators. In VLDB, pages 1097-1107, 2005.
8. N. Bruno, S. Chaudhuri, and L. Gravano. STHoles: A multidimensional workload-aware histogram. In SIGMOD, pages 211-222, 2001.
9. N. Bruno, S. Chaudhuri, and D. Thomas. Generating queries with cardinality constraints for dbms testing. IEEE Trans. Knowl. Data Eng., 18(12):1271-1275, 2006.
10. M. Castellanos, B. Zhang, I. Jimenez, et al. Data desensitization of customer data for use in optimizer performance experiments. In ICDE, pages 1081-1092, 2010.
11. S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. SIGMOD Record, 26(1):65-74, 1997. (Pubitemid 127458202)
12. S. Cohen. Generating XML structure using examples and constraints. PVLDB, 1(1):490-501, 2008.
13. C. Dwork. Differential privacy. In ICALP (2), pages 1-12, 2006.
14. L. Getoor, B. Taskar, and D. Koller. Selectivity estimation using probabilistic models. In SIGMOD, pages 461-472, 2001.
15. J. Gray, P. Sundaresan, S. Englert, et al. Quickly generating billion-record synthetic databases. In SIGMOD, pages 243-252, 1994.
16. J. M. Hammersley and P. Clifford. Markov fields on finite graphs and lattices. Unpublished manuscript.
17. K. Houkjaer, K. Torp, and R. Wind. Simple and realistic data generation. In VLDB, pages 1243-1246, 2006.
18. IBM DB2 test data generator. http://www.ibm.com/developerworks/data/ library/techarticle/dm-0706salkosuo/index.html.
19. B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer Verlag, 2005.
20. S. Lattanzi and D. Sivakumar. Affiliation networks. In Proceedings of the 41st annual ACM symposium on Theory of computing, pages 427-434. ACM, 2009.
21. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, et al. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In PKDD, pages 133-145, 2005.
22. E. Lo, N. Cheng, and W.-K. Hon. Generating databases for query workloads. In VLDB, pages 848-859, 2010.
23. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1):3, 2007.
24. H. Mannila and K.-J. Raiha. Automatic generation of test data for relational queries. J. Comp. Syst. Sci, 38(2):240-258, 1989.
25. C. Olston, S. Chopra, and U. Srivastava. Generating example data for dataflow programs. In SIGMOD, pages 245-256, 2009.
26. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
27. C. Re and D. Suciu. Understanding cardinality estimation using entropy maximization. In PODS, pages 53-64, 2010.
28. U. Srivastava, P. J. Haas, V. Markl, et al. ISOMER: consistent histogram construction using query feedback. In ICDE, 2006.
29. L. Sweeney. k-Anonymity: A Model for Protecting Privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst, 10(5):557-570, 2002.
30. T. Syrjanen. Logic Programs and Cardinality Constraints: Theory and Practice. PhD thesis, Helsinki University of Technology, 2009.
31. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. of Comput, 13(3):566-579, 1984. (Pubitemid 15514404)
32. J. Winick and S. Jamin. Inet-3.0: Internet topology generator, 2002. Technical Report CSE-TR-456-02, University of Michigan, Ann Arbor.
33. W. E. Winkler. Masking and re-identification methods for public-use microdata: Overview and research problems. In Privacy in Statistical Databases, pages 231-246, 2004.