Abstract
Ensuring the provision of consistent and irredundant data sets remains essential to minimize bugs, promote maintainable application code and obtain dependable results in data analytics. A major challenge in achieving consistency is handling incomplete data, i.e., missing information that may be provided later, comes from the fact that, the use of marked (or linked) nulls is required in many applications to express unknown but connected information. In this context, it is well known that maintaining the data consistent and irredundant is not an easy task. This paper proposes a query-driven incremental maintenance approach for consistent and irredundant incomplete databases. Can graph databases improve the efficiency of this operation? How can graph databases manipulate linked nulls? What is the impact of using graph databases on other essential maintenance operations? This paper presents an innovative approach to answering these questions, highlighting the proposal’s strengths and weaknesses and offering avenues for further research.
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
Similar content being viewed by others
Notes
- 1.
If an update is not rejected, the updated database contains the inserted data and does not contain the deleted ones.
- 2.
- 3.
- 4.
References
Abiteboul, S., Grahne, G.: Mise-à-jour des bases de données contenant de l’information incomplète. In: Journées Bases de Données Avancés, 6–8 Mars 1985, St. Pierre de Chartreuse (Informal Proceedings) (1985)
Aho, A.V., Sagiv, Y., Ullman, J.D.: Efficient optimization of a class of relational expressions. ACM Trans. Database Syst. 4(4), 435–454 (1979)
Angles, R., et al.: PG-Keys: keys for property graphs. In: SIGMOD Conference, pp. 2423–2436. ACM (2021)
Bonifati, A., Fletcher, G., Voigt, H., Yakovets, N.: Querying Graphs. Synthesis Lectures on Data Management, Morgan & Claypool Publishers (2018)
Chabin, J., Halfeld Ferrari, M., Hiot, N., Laurent, D.: Incremental consistent updating of incomplete databases (extended version - technical report). Technical report, LIFO- Université d’Orléans, (2023). www.hal.science/hal-03982841
Chabin, J., Halfeld Ferrari, M., Laurent, D.: Consistent updating of databases with marked nulls. Knowl. Inf. Syst. 62(4), 1571–1609 (2020)
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Symposium on the Theory of Computing (1977)
Console, M., Guagliardo, P., Libkin, L., Toussaint, E.: Coping with incomplete data: recent advances. In: PODS, pp. 33–47. ACM (2020)
Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1), 174–210 (2005)
Fagin, R., Kuper, G.M., Ullman, J.D., Vardi, M.Y.: Updating Logical Databases. Advances in Computing Research, vol. 3, pp. 1–18 (1986)
Fagin, R., Ullman, J.D., Vardi, M.Y.: On the semantics of updates in databases. In: Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Atlanta, Georgia, USA, pp. 352–365 (1983)
Fan, W., Fan, Z., Tian, C., Dong, X.L.: Keys for graphs. Proc. VLDB Endow. 8(12), 1590–1601 (2015)
Fan, W., Lu, P.: Dependencies for graphs. In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS, Chicago, USA, pp. 403–416 (2017)
Grahne, G.: The Problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science, vol. 554. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-54919-6
Alves, M.H.F., Laurent, D., Spyratos, N.: Update rules in datalog programs. J. Log. Comput. 8(6), 745–775 (1998)
Hassan, M.S., Kuznetsova, T., Jeong, H.C., Aref, W.G., Sadoghi, M.: GRFusion: graphs as first-class citizens in main-memory relational database systems. In: SIGMOD Conference, pp. 1789–1792. ACM (2018)
Hiot, N., Moret-Bailly, L., Chabin, J.: www.gitlab.com/jacques-chabin/UpdateChase (2023)
Imielinski, T., Lipski, W., Jr.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)
Onet, A.: The chase procedure and its applications in data exchange. In: Data Exchange, Integration, and Streams, pp. 1–37 (2013)
Reiter, R.: A sound and sometimes complete query evaluation algorithm for relational databases with null values. J. ACM 33(2), 349–370 (1986)
Schewe, K., Thalheim, B.: Limitations of rule triggering systems for integrity maintenance in the context of transition specifications. Acta Cybern. 13(3), 277–304 (1998)
Sirangelo, C.: Representing and querying incomplete information: a data interoperability perspective (2014). www.tel.archives-ouvertes.fr/tel-01092547
Winslett, M.: Updating Logical Databases. Cambridge University Press, New York (1990)
Zaniolo, C.: Database relations with null values. J. Comput. Syst. Sci. 28(1), 142–166 (1984)
Acknowledgements
Work partially supported by projet SENDUP (ANR-18-CE23-0010) and developed in the context of the DOING action (MADICS and DIAMS). We express our gratitude to the interns who contributed to this project, in particular Lucas Moret-Bailly for his valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chabin, J., Halfeld-Ferrari, M., Hiot, N., Laurent, D. (2023). Managing Linked Nulls in Property Graphs: Tools to Ensure Consistency and Reduce Redundancy. In: Abelló, A., Vassiliadis, P., Romero, O., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2023. Lecture Notes in Computer Science, vol 13985. Springer, Cham. https://doi.org/10.1007/978-3-031-42914-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-031-42914-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-42913-2
Online ISBN: 978-3-031-42914-9
eBook Packages: Computer ScienceComputer Science (R0)