skip to main content
research-article

Towards a Generalised Semistructured Data Model and Query Language

Published:01 August 2023Publication History
Skip Abstract Section

Abstract

Although current efforts are all aimed at re-defining new ways to harness old data representations, possibly with new schema features, the challenges still open provide evidence of the need for a "diametrically opposite" approach: in fact, all information generated in real contexts is to be understood lacking of any form of schema, where the schema associated with such data is only determined a posteriori based on either a specific application context, or from some data's facets of interest. This solution should still enable recommendation systems to manipulate the aforementioned data semantically. After providing evidence of these limitations from current literature, we propose a new Generalized Semistructured data Model that makes possible queries expressible in any data representation through a Generalised Semistructured Query Language, both relying upon script v2.0 as a MetaModel language manipulating types as terms as well as allowing structural aggregation functions.

References

  1. Appleby, S., Bergami, G., and Morgan, G. 2023. Enhancing declarative temporal model mining in relational databases: A preliminary study. In Proceedings of the International Database Engineered Applications Symposium Conference, IDEAS 2023, Heraklion, Crete, Greece, May 5--7, 2023, R. Chbeir, M. Ivanovic, Y. Manolopoulos, and P. Z. Revesz, Eds. ACM, 34--42.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Asperti, A., Ricciotti, W., and Coen, C. S. 2014. Matita tutorial. J. Formaliz. Reason. 7, 2, 91--199.Google ScholarGoogle Scholar
  3. Asperti, A., Ricciotti, W., Sacerdoti Coen, C., and Tassi, E. 2009. A compact kernel for the calculus of inductive constructions. Sadhana 34, 1 (Feb), 71--144.Google ScholarGoogle ScholarCross RefCross Ref
  4. Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., and Patel-Schneider, P. F. 2010. The Description Logic Handbook: Theory, Implementation and Applications, 2nd ed. Cambridge University press, New York, NY, USA.Google ScholarGoogle Scholar
  5. Baazizi, M. A., Colazzo, D., Ghelli, G., and Sartiani, C. 2019. Parametric schema inference for massive JSON datasets. VLDB J. 28, 4, 497--521.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Bergami, G. 2018. A new nested graph model for data integration. Ph.D. thesis, University of Bologna, Italy.Google ScholarGoogle Scholar
  7. Bergami, G., Appleby, S., and Morgan, G. 2023. Quickening data-aware conformance checking through temporal algebras. Inf. 14, 3, 173.Google ScholarGoogle Scholar
  8. Bergami, G., Bertini, F., and Montesi, D. 2019. On approximate nesting of multiple social network graphs: a preliminary study. In Proceedings of the 23rd International Database Applications & Engineering Symposium, IDEAS 2019, Athens, Greece, June 10--12, 2019, B. C. Desai, D. Anagnostopoulos, Y. Manolopoulos, and M. Nikolaidou, Eds. ACM, 40:1--40:5.Google ScholarGoogle Scholar
  9. Bergami, G., Bertini, F., and Montesi, D. 2020. Hierarchical embedding for DAG reachability queries. In IDEAS 2020: 24th International Database Engineering & Applications Symposium, Seoul, Republic of Korea, August 12--14, 2020, B. C. Desai and W. Cho, Eds. ACM, 24:1--24:10.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Bergami, G., Petermann, A., and Montesi, D. 2018. THoSP: an algorithm for nesting property graphs. In Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Houston, TX, USA, June 10, 2018, A. A. A. Bhattacharya, G. H. L. Fletcher, J. L. Larriba-Pey, S. Roy, and R. West, Eds. ACM, 8:1--8:10.Google ScholarGoogle Scholar
  11. Cabibbo, L. 1998. The expressive power of stratified logic programs with value invention. Inf. Comput. 147, 1, 22--56.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Calders, T., Lakshmanan, L. V., Ng, R. T., and Paredaens, J. 2006. Expressive power of an algebra for data mining. ACM Trans. on Database Systems 31, 4, 1169--1214.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Chatterjee, P. 2019. Strengths and weaknesses of relational DBMSs. https://web.archive.org/web/20190908194656/http://www.cems.uwe.ac.uk/~pchatter/2011/dm/readings/rdb_strengths_weaknesses.html. Accessed: 2019-09-08.Google ScholarGoogle Scholar
  14. Chen, C., Yan, X., Zhu, F., Han, J., and Yu, P. S. 2008. Graph OLAP: towards online analytical processing on graphs. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15--19, 2008, Pisa, Italy. IEEE Computer Society, 103--112.Google ScholarGoogle Scholar
  15. Chen, Y., Goldberg, S., Wang, D. Z., and Johri, S. S. 2016. Ontological pathfinding. In Proceedings of the 2016 International Conference on Management of Data. SIGMOD '16. Association for Computing Machinery, New York, NY, USA, 835--846.Google ScholarGoogle Scholar
  16. Codd, E. F. 1970. A relational model of data for large shared data banks. Commun. ACM 13, 6, 377--387.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Elmasri, R. and Navathe, S. B. 2015. Fundamentals of Database Systems, 7th ed. Pearson.Google ScholarGoogle Scholar
  18. Fionda, V., Pirrò, G., and Gutierrez, C. 2015. NautiLOD: A formal language for the web of data graph. ACM Trans. Web 9, 1, 5:1--5:43.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Ghrab, A., Romero, O., Skhiri, S., Vaisman, A. A., and Zimányi, E. 2015. A framework for building OLAP cubes on graphs. In Advances in Databases and Information Systems - 19th East European Conference, ADBIS 2015, Poitiers, France, September 8--11, 2015, Proceedings, T. Morzy, P. Valduriez, and L. Bellatreche, Eds. Lecture Notes in Computer Science, vol. 9282. Springer, 92--105.Google ScholarGoogle Scholar
  20. He, D., Nakandala, S. C., Banda, D., Sen, R., Saur, K., Park, K., Curino, C., Camacho-Rodríguez, J., Karanasos, K., and Interlandi, M. 2022. Query processing on tensor computation runtimes. Proc. VLDB Endow. 15, 11 (jul), 2811--2825.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Henderson-Sellers, B. 2012. On the Mathematics of Modelling, Metamodelling, Ontologies and Modelling Languages. Springer Briefs in Computer Science. Springer.Google ScholarGoogle Scholar
  22. Hosoya, H., Vouillon, J., and Pierce, B. C. 2005. Regular expression types for XML. ACM Trans. Program. Lang. Syst. 27, 1, 46--90.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Kühne, T. 2006. Matters of (meta-)modeling. Softw. Syst. Model. 5, 4, 369--385.Google ScholarGoogle ScholarCross RefCross Ref
  24. Li, J. and Gao, H. 2003. Hierarchical data cube for range queries and dynamic updates. In Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Dresden, Germany, September 3--6, 2003, Proceedings, L. A. Kalinichenko, R. Manthey, B. Thalheim, and U. Wloka, Eds. Lecture Notes in Computer Science, vol. 2798. Springer, 61--75.Google ScholarGoogle Scholar
  25. Magnani, M. and Montesi, D. 2006. A unified approach to structured and XML data modeling and manipulation. Data Knowl. Eng. 59, 1, 25--62.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Parra, V. M., Syed, A., Azeem, M., and Halgamuge, M. N. 2016. Pentaho and jaspersoft: A comparative study of business intelligence open source tools processing big data to evaluate performances. In International Journal of Advanced Computer Science and Applications. Vol. 7(10). 3--61.Google ScholarGoogle Scholar
  27. Petermann, A., Junghanns, M., Müller, R., and Rahm, E. 2014. Graph-based data integration and business intelligence with BIIIG. Proc. VLDB Endow. 7, 13, 1577--1580.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Petermann, A., Micale, G., Bergami, G., Pulvirenti, A., and Rahm, E. 2017. Mining and ranking of generalized multi-dimensional frequent subgraphs. In Twelfth International Conference on Digital Information Management, ICDIM 2017, Fukuoka, Japan, September 12--14, 2017. IEEE, 236--245.Google ScholarGoogle Scholar
  29. Pierce, B. C. 2002. Types and programming languages. MIT Press.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Plump, D. 1999. Term graph rewriting. In Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 2. 3--61.Google ScholarGoogle Scholar
  31. Rabbani, K., Lissandrini, M., and Hose, K. 2023. Shactor: Improving the quality of large-scale knowledge graphs with validating shapes. In Companion of the 2023 International Conference on Management of Data. SIGMOD/PODS '23. Association for Computing Machinery, New York, NY, USA, 151--154.Google ScholarGoogle Scholar
  32. Raedt, L. D. 2008. Logical and relational learning. Cognitive Technologies. Springer.Google ScholarGoogle Scholar
  33. Rensink, A. 2003. Model checking graph grammars. Tech. rep., Department of Computer Science, University of Twente, Netherlands.Google ScholarGoogle Scholar
  34. Vaisman, A. and Zimányi, E. 2014. Data Warehouse Systems. Design and Implementation. Springer.Google ScholarGoogle Scholar
  35. Vasilyeva, E., Thiele, M., Bornhövd, C., and Lehner, W. 2013. Leveraging flexible data management with graph databases. In First International Workshop on Graph Data Management Experiences and Systems, GRADES 2013, co-located with SIGMOD/PODS 2013, New York, NY, USA, June 24, 2013, P. A. Boncz and T. Neumann, Eds. CWI/ACM, 12.Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Zegadło, W. 2023. Exploring the potential of general semi-structured model for managing and querying data.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGWEB Newsletter
    ACM SIGWEB Newsletter  Volume 2023, Issue Summer
    Summer 2023
    45 pages
    ISSN:1931-1745
    EISSN:1931-1435
    DOI:10.1145/3609429
    Issue’s Table of Contents

    Copyright © 2023 Copyright is held by the owner/author(s)

    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 August 2023

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader