Repairing vertex labels under neighborhood constraints

Proceedings of the VLDB Endowment

Volumn 7, Issue 11, 2014, Pages 987-998

  Song, Shaoxu ^a   Cheng, Hong ^b   Yu, Jeffrey Xu ^b   Chen, Lei ^c  

^a TSINGHUA UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS;

APPLICATION NETWORKS; APPROXIMATION METHODS; EXPERIMENTAL EVALUATION; GREEDY HEURISTICS; HYBRID APPROACH; SCIENTIFIC EXPERIMENTS; SIMILARITY NETWORK; SYNTHETIC AND REAL DATA;

GRAPH THEORY;

EID: 84904621873     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2732967.2732974     Document Type: Conference Paper

References (30)

1. M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68-79, 1999.
2. M. Bellare, S. Goldwasser, C. Lund, and A. Russeli. Efficient probabilistically checkable proofs and applications to approximations. In STOC, pages 294-304, 1993.
3. P. Bohannon, M. Flaster, W. Fan, and R. Rastogi. A cost-based model and effective heuristic for repairing constraints by value modification. In SIGMOD Conference, pages 143-154, 2005.
4. A. Bonifati, F. Casati, U. Dayal, and M.-C. Shan. Warehousing workflow data: Challenges and opportunities. In VLDB, pages 649-652, 2001.
5. J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu. Finding maximal cliques in massive networks by h*-graph. In SIGMOD Conference, pages 447-458, 2010.
6. J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In SIGMOD Conference, pages 857-872, 2007.
7. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In ICDE, pages 913-922, 2008.
8. J. Chomicki and J. Marcinkowski. Minimal-change integrity maintenance using tuple deletions. Inf. Comput., 197(1-2):90-121, 2005.
9. A. Conesa, S. Götz, J. M. García-Gómez, J. Terol, M. Tal ón, and M. Robles. Blast2go: a universal tool for annotation, visualization and analysis in functional genomics research. Bioinformatics, 21(18):3674-3676, 2005.
10. D. Deutch and T. Milo. A quest for beauty and wealth (or, business processes for database researchers). In PODS, pages 1-12, 2011.
11. W. Fan, J. Li, J. Luo, Z. Tan, X. Wang, and Y. Wu. Incremental graph pattern matching. In SIGMOD Conference, pages 925-936, 2011.
12. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph pattern matching: From intractable to polynomial time. PVLDB, 3(1):264-275, 2010.
13. Full Version. Repairing vertex labels under neighborhood constraints. http://ise.thss.tsinghua.edu.cn/sxsong/doc/grelabel.pdf.
14. M. A. Gilchrist, L. A. Salter, and A. Wagner. A statistical framework for combining and interpreting proteomic datasets. Bioinformatics, 20(5):689-700, 2004.
15. O. Hassanzadeh, F. Chiang, R. J. Miller, and H. C. Lee. Framework for evaluating clustering algorithms in duplicate detection. PVLDB, 2(1):1282-1293, 2009.
16. R. Isele and C. Bizer. Learning expressive linkage rules using genetic programming. PVLDB, 5(11):1638-1649, 2012.
17. C. Jin, S. S. Bhowmick, X. Xiao, J. Cheng, and B. Choi. Gblender: towards blending visual query formulation and query processing in graph databases. In SIGMOD Conference, pages 111-122, 2010.
18. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
19. S. Kolahi and L. V. S. Lakshmanan. On approximating optimum repairs for functional dependency violations. In ICDT, pages 53-62, 2009.
20. V. Kumar. Algorithms for constraint-satisfaction problems:A survey. AI Magazine, 13(1):32-44, 1992.
21. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Solving large-scale constraint-satisfaction and scheduling problems using a heuristic repair method. In AAAI, pages 17-24, 1990.
22. G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001.
23. S. Song and L. Chen. Differential dependencies: Reasoning and discovery. ACM Trans. Database Syst., 36(3):16, 2011.
24. S. Song, L. Chen, and H. Cheng. Parameter-free determination of distance thresholds for metric distance constraints. In ICDE, pages 846-857, 2012.
25. W. M. P. van der Aalst and et al. Process mining manifesto. In Business Process Management Workshops (1), pages 169-194, 2011.
26. W. M. P. van der Aalst, A. H. M. ter Hofstede, B. Kiepuszewski, and A. P. Barros. Workflow patterns. Distributed and Parallel Databases, 14(1):5-51, 2003.
27. C. J. van Rijsbergen. Information Retrieval. Butterworth, 1979.
28. J. Wang, S. Song, X. Zhu, and X. Lin. Efficient recovery of missing events. PVLDB, 6(10):841-852, 2013.
29. J. Wijsen. Database repairing using updates. ACM Trans. Database Syst., 30(3):722-768, 2005.
30. B. Zhang, B.-H. Park, T. V. Karpinets, and N. F. Samatova. From pull-down data to protein interaction networks and complexes with biological relevance. Bioinformatics, 24(7):979-986, 2008.