The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Comparison of Current Graph Database Models
Abstract
The limitations of traditional databases, in particular the relational model, to cover the requirements of current applications has lead the development of new database technologies. Among them, the Graph Databases are calling the attention of the database community because in trendy projects where a database is needed, the extraction of worthy information relies on processing the graph-like structure of the data. In this paper we present a systematic comparison of current graph database models. Our review includes general features (for data storing and querying), data modeling features (i.e., data structures, query languages, and integrity constraints), and the support for essential graph queries.
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
Survey of graph database models
Angles, R., & Gutierrez, C. (2008) · ACM Computing Surveys · doi:10.1145/1322432.1322433 · Cited by 1,706
Self-citationGuha, R., McCool, R., & Miller, E. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775250 · Cited by 747
State of the art of graph-based data mining
Washio, T., & Motoda, H. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959249 · Cited by 448
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
Cheng, J., Yu, J. X., Ding, B., Yu, P. S., & Wang, H. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497500 · Cited by 164
Querying RDF Data from a Graph Database Perspective
Angles, R., & Gutiérrez, C. (2005) · Lecture notes in computer science · doi:10.1007/11431053_24 · Cited by 147
Self-citationAdding regular expressions to graph reachability and pattern queries
Fan, W., Li, J., Ma, S., Tang, N., & Wu, Y. (2011) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2011.5767858 · Cited by 147
HyperGraphDB: A Generalized Graph Database
Iordanov, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16720-1_3 · Cited by 143
Barceló, P., Libkin, L. O., & Reutter, J. L. (2011) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1989284.1989307 · Cited by 66
Adding regular expressions to graph reachability and pattern queries
Fan, W., Li, J., Ma, S., Tang, N., & Wu, Y. (2012) · Frontiers of Computer Science · doi:10.1007/s11704-012-1312-y · Cited by 37
Cited by
Distributed temporal graph analytics with GRADOOP
Rost, C., Gomez, K., Täschner, M., Fritzsche, P., Schons, L., Christ, L., Adameit, T., Junghanns, M., & Rahm, E. (2022) · The VLDB Journal · doi:10.1007/s00778-021-00667-4 · Cited by 39
Metadata
- Authors
- Angles, R.
- Venue
- 2012 IEEE 28th International Conference on Data Engineering Workshops
- Publisher
- IEEE
- Published
- 2012-04
- Pages
- 171-177
- OpenAlex
- W2161077919
- Cited by
- 260
- References
- 11
- FWCI
- 8.66
- 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
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.