The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A comparison of a graph database and a relational database: a data provenance perspective
Abstract
Relational databases have been around for many decades and are the database technology of choice for most traditional data-intensive storage and retrieval applications. Retrievals are usually accomplished using SQL, a declarative query language. Relational database systems are generally efficient unless the data contains many relationships requiring joins of large tables. Recently there has been much interest in data stores that do not use SQL exclusively, the so-called NoSQL movement. Examples are Google's BigTable and Facebook's Cassandra. This paper reports on a comparison of one such NoSQL graph database called Neo4j with a common relational database system, MySQL, for use as the underlying technology in the development of a software system to record and query data provenance information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bigtable: A Distributed Storage System for Structured Data
Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1365815.1365816 · Cited by 3,460
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 1×
“Dynamo is a key-value storage system used extensively by Amazon because of its scalability, reliability, efficiency, and ability to be highly distributed [3].”
BackgroundSurvey of graph database models
Angles, R., & Gutierrez, C. (2008) · ACM Computing Surveys · doi:10.1145/1322432.1322433 · Cited by 1,706
Dynamo: amazon's highly available key-value store
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., & Vogels, W. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1323293.1294281 · Cited by 1,151
Cassandra: structured storage system on a P2P network
Lakshman, A., & Malik, P. (2009) · Proceedings of the 28th ACM symposium on Principles of distributed computing · doi:10.1145/1582716.1582722 · Cited by 231
Cited by
Reactome graph database: Efficient access to complex pathway data
Fabregat, A., Korninger, F., Viteri, G., Sidiropoulos, K., Marin-Garcia, P., Ping, P., Wu, G., Stein, L., D’Eustachio, P., & Hermjakob, H. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005968 · Cited by 283
Khan, W., Kumar, T., Zhang, C., Raj, K., Roy, A. M., & Luo, B. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7020097 · Cited by 143
Sikos, L. F., & Philp, D. (2020) · Data Science and Engineering · doi:10.1007/s41019-020-00118-0 · Cited by 60
A Hybrid Database Approach Using Graph and Relational Database
Vyawahare, H. R., Karde, P. P., & Thakare, V. M. (2018) · 2018 International Conference on Research in Intelligent and Computing in Engineering (RICE) · doi:10.1109/rice.2018.8509057 · Cited by 32
Metadata
- Authors
- Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., & Wilkins, D.
- Venue
- Proceedings of the 48th Annual Southeast Regional Conference
- Publisher
- ACM
- Published
- 2010-04-15
- Pages
- 1-6
- OpenAlex
- W2020391739
- Cited by
- 353
- References
- 5
- FWCI
- 13.88
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comparison of a graph database and a relational database: a data provenance perspective. https://app.cochat.ai/papers/10.1145/1900008.1900067
- The paper
- Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., & Wilkins, D. (2010). A comparison of a graph database and a relational database: a data provenance perspective. Proceedings of the 48th Annual Southeast Regional Conference. https://doi.org/10.1145/1900008.1900067
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.