Abstract
We formally define the Formal-Language-Constrained Graph Minimization problem. The goal is to minimize the amount of data associated to the edges of a graph database, while preserving its utility, defined as a conjunctive path query. We show that the problem is NP-hard. A solution to this problem contributes to balancing the trade-off between privacy protection and utility when publishing a graph database.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Consider \(w_i=1\) as the default value.
References
Anciaux, N., Nguyen, B., Vazirgiannis, M.: Miminum exposure in classification scenarios. Research report (2011)
Grau, B.C., Kostylev, E.V.: Logical foundations of privacy-preserving publishing of linked data. In: 30th AAAI Conference on Artificial Intelligence, pp. 52–95 (2016)
Delanaux, R., Bonifati, A., Rousset, M.-C., Thion, R.: RDF graph anonymization robust to data linkage. In: Cheng, R., Mamoulis, N., Sun, Y., Huang, X. (eds.) WISE 2020. LNCS, vol. 11881, pp. 491–506. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34223-4_31
Ji, S., Mittal, P., Beyah, R.: Graph data anonymization, de-anonymization attacks, and de-anonymizability quantification: a survey. IEEE Commun. Surv. Tutor. 19(2), 1305–1326 (2017)
Medeiros, C.M., Musicante, M.A., Costa, U.S.: An algorithm for context-free path queries over graph databases. In: Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity, SBLP 2020, New York, NY, USA, pp. 40–47. ACM (2020)
Anciaux, N., Nguyen, B., Vazirgiannis, M.: Limiting data collection in online forms. IEEE PST (2012)
Alimonti, P., Ausiello, G., Giovaniello, L., Protasi, M.: On the complexity of approximating weighted satisfiability problems (extended abstract) (1997)
Medeiros, C.M., Musicante, M.A., Costa, U.S.: LL-based query answering over RDF databases. J. Comput. Lang. 51, 75–87 (2019)
Li, Y., Zhang, Q., Reps, T.: Fast graph simplification for interleaved Dyck-reachability. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 780–793 (2020)
Acknowledgements
Work partly supported by INES (CNPq/465614/2014-0), CAPES - Finance Code 001. Participation in the ANR-SendUp project and DOING action (DIAMS, MADICS).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Medeiros, C., Musicante, M., Halfeld-Ferrari, M. (2021). The Formal-Language-Constrained Graph Minimization Problem. In: Bellatreche, L., et al. New Trends in Database and Information Systems. ADBIS 2021. Communications in Computer and Information Science, vol 1450. Springer, Cham. https://doi.org/10.1007/978-3-030-85082-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-85082-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85081-4
Online ISBN: 978-3-030-85082-1
eBook Packages: Computer ScienceComputer Science (R0)