{
 "id": "stanford-star/dbinfer",
 "owner": "stanford-star",
 "name": "dbinfer",
 "downloads": 4168,
 "likes": 2,
 "last_modified": "2026-10-15T23:53:55.000Z",
 "stated_licence": "other",
 "stated_from": "tag",
 "licence_name": "per-database",
 "licence_link": "LICENSE.md",
 "file_licence": null,
 "licence_files": [
  "LICENSE.md"
 ],
 "sources": [],
 "gated": false,
 "tasks": [],
 "citation": "@inproceedings{wang2024fourdbinfer,\n  title     = {{4DBInfer}: A {4D} Benchmarking Toolbox for Graph-Centric Predictive Modeling on Relational Databases},\n  author    = {Wang, Minjie and Gan, Quan and Wipf, David and Cai, Zhenkun and Li, Ning and Tang, Jianheng and Zhang, Yanlin and Zhang, Zizhao and Mao, Zunyao and Song, Yakun and Wang, Yanbo and Li, Jiahang and Zhang, Han and Yang, Guang and Qin, Xiao and Lei, Chuan and Zhang, Muhan and Zhang, Weinan and Faloutsos, Christos and Zhang, Zheng},\n  booktitle = {Advances in Neural Information Processing Systems 37 (NeurIPS 2024) Datasets and Benchmarks Track},\n  year      = {2024}\n}\n\n@inproceedings{relbenchv2,\n  title={RelBench v2: A Large-Scale Benchmark and Repository for Relational Data},\n  author={Gu, Justin and Ranjan, Rishabh and Kanatsoulis, Charilaos and Tang, Haiming and Jurkovic, Martin and Hudovernik, Valter and Znidar, Mark and Chaturvedi, Pranshu and Shroff, Parth and Li, Fengyu and Leskovec, Jure},\n  booktitle={3rd Workshop on Navigating and Addressing Data Problems for Foundation Models (DATA-FM) at ICLR 2026},\n  year={2026},\n  note={arXiv:2602.12606 [cs.LG]},\n  url={https://arxiv.org/abs/2602.12606}\n}",
 "signal": "unclear",
 "reason": "The checks could not identify a recognised licence ID in the dataset's metadata.",
 "revision": "5d4c4722b4c856897423f4201e9049164a2f7ce8",
 "stated_evidence": "https://huggingface.co/datasets/stanford-star/dbinfer/blob/5d4c4722b4c856897423f4201e9049164a2f7ce8/README.md",
 "file_evidence": "https://huggingface.co/datasets/stanford-star/dbinfer/blob/5d4c4722b4c856897423f4201e9049164a2f7ce8/LICENSE.md",
 "card_nc": false
}