zbMATH — the first resource for mathematics

Supporting data-driven mathematics: database and interface generation. (English) Zbl 1433.68587
Summary: Easier access to computation is turning mathematics into an at least a partially data-driven discipline. But it does not use the tools of the data trade: a majority of datasets are still shared in an ad hoc manner. We contribute an automated database setup process which builds a complete website stack, from the database schema to a web interface, from a dataset declaration.
68V35 Digital mathematics libraries and repositories
68P15 Database theory
DiscreteZOO; QMT
Full Text: Link
[1] L. Babai and E. M. Luks. “Canonical Labeling of Graphs”.Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing. STOC ’83. New York, NY: ACM, 1983, pp. 171- 183.Link.
[2] K. Berˇciˇc, M. Kohlhase, and F. Rabe. “Towards a Unified Mathematical Data Infrastructure: Database and Interface Generation”.Intelligent Computer Mathematics (CICM) 2019. Conferences on Intelligent Computer Mathematics. Ed. by C. Kaliszyck, E. Brady, C. SacerdotiCoen, and A. Kohlhase. In preparation. 2019.Link.
[3] S. Bernstein Joseph Gelbart, ed.An Introduction to the Langlands Program. Birkhäuser, 2003. · Zbl 1112.11028
[4] K. Berˇciˇc.Math Databases Living Survey.Link(visited on 03/19/2019).
[5] K. Berˇciˇc and J. Vidali. “DiscreteZOO: a Fingerprint Database of Discrete Objects”. 2018. Link. · Zbl 1395.68108
[6] DiscreteZOO website.Link(visited on 03/19/2019).
[7] MBGen description, links demos and code repositories.Link(visited on 03/19/2019).
[8] B. McKay. “Description of graph6, sparse6 and digraph6 encodings”.Link.
[9] F. Rabe. “A Query Language for Formal Mathematical Libraries”.Intelligent Computer Mathematics. Springer Berlin Heidelberg, 2012, pp. 143-158.arXiv:1204.4685. · Zbl 1359.68272
[10] T.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.