Talk:Graph database/Archive 1

From Wikipedia, the free encyclopedia

Archive 1

Where did ArangoDB go?!?

We seem to have lost ArangoDB

It had no WP:SECONDARY sources listed to support its notability and to prevent this article from becoming a WP:SPAMHOLE. Please provide creditable secondary sources (not press releases, not mere quotes from company representatives). Michaelmalak (talk) 20:53, 2 October 2016 (UTC)

Network Databases and COBOL

Dont want to get into an edit war, but I think it is doing a disservice to the Wikipedia community to keep references to network model databases and COBOL out of this page. The whole reason for COBOL was the graph traversal aid it provided (in the sense of following typed links rather direct reference to graph concepts such as colored edges). I think a reference to COBOL is highly pertinent on this page, and will prevent a lot of reinventing the wheel if it is included. At least in the place where the lack of successful languages like SQL is decried, a mention of COBOL would be highly appropriate. NKP  Preceding unsigned comment added by 208.54.5.138 (talk) 05:50, 31 May 2016 (UTC)

It would be very interesting if you could find a source that claims "the whole reason for COBOL was the graph traversal aid". Otherwise, just a mention of the early effort would be warranted (that is, without claiming it was as important as SQL). According to the CODASYL page, the "Network Database Language", if in fact that is what you are referring to, "never had any practical effect on implementations, [and] it was formally withdrawn in 1998." Michaelmalak (talk) 06:41, 31 May 2016 (UTC)
I just now added a "History" section. From my research, COBOL predates network model databases by ten years, so I'm not seeing how "the whole reason for COBOL was the graph traversal aid" can be justified -- certainly not without a solid citation. Feel free to add to what I've started, assuming anything you add is verifiable.  Preceding unsigned comment added by Michaelmalak (talkcontribs) 17:18, 31 May 2016 (UTC)

How are graph databases related to network databases and hierarchical databases as they were common in the 1960s and to triple stores?

Indeed -- this page should highlight the tradeoffs being made compared to the relational model (not just the positives), and also the relationship to pre-relational systems. — Preceding unsigned comment added by 204.15.64.200 (talk) 20:14, 28 January 2013 (UTC)

Also: it's not clear from the article that there is any difference at all between a graph database and an Object_database. Would be nice if this could be clarified. Mreftel (talk) 19:32, 3 July 2015 (UTC)

Not correct IMHO

"A graph database is a kind of NoSQL database that uses..." NoSQL is just a buzz-word. Something like the "web 2.0" and "web 2.0"-Applications. What does it mean? I think this should be deleted but i guess there are other people which love to see this word in the beginning of the article. (No offense) — Preceding unsigned comment added by 93.104.66.80 (talk) 20:04, 27 August 2011 (UTC)

"They can scale more naturally to large data sets as they do not typically require expensive join operations." It's not the database that doesn't need joins, it's the data model that you usually have when you use this type of database

"As they depend less on a rigid schema, they are more suitable to manage ad-hoc and changing data with evolving schemas." The database depends on a schema?? This sentence makes sense?

"Conversely, relational databases are typically faster at performing the same operation on large numbers of data elements." Needs a reference. —Preceding unsigned comment added by 193.136.19.96 (talk) 14:59, 22 April 2010 (UTC)

"they do not typically require expensive join operations" edges are implicit joins, and the execution times across various benchmarks (vs CTE aka recursive queries) seem to corroborate that89.158.120.107 (talk) 07:34, 1 December 2015 (UTC)

Core Data

As far as I can see, Core Data is an object persistence framework, not a graph database. It doesn't even use or expose a graph data model AFAIK. Can someone please enlighten me on why Core Data should be part of this article? If there's no reference for it being a graph database, I suggest the link should be removed. --Nawroth (talk) 09:39, 15 May 2010 (UTC)

No indexes?

The page says "By definition, a graph database is any storage system that provides index-free adjacency. This means that every element contains a direct pointer to its adjacent element and no index lookups are necessary." However, it then goes on to include triplestores (which DO use indexes) as examples. I think a distinction needs to be made between the logical structure of the database and the implementation details. RichMorin (talk) 02:11, 7 February 2013 (UTC)

The article sounds bogus to me. What is the difference between an index and a pointer? Why make the distinction? Sounds like some marketing person wrote the intro. Daniel.Cardenas (talk) 03:35, 24 January 2014 (UTC)
In my opinion the definition of "graph database" is slightly biased. The line "A graph database is any storage system that provides index-free adjacency." is referenced from a marketing web-side. Most of the graph databases listed later do not fulfil this definition, i.e. Titan is undoubtedly a graph databases, but uses a different storage with indexes. I more fitting description can be found . I think the term was coined in
Graph Databases; Adrian Silvescu, Doina Caragea, Anna Atramentov Artificial Intelligence Research Laboratory Department of Computer Science; Iowa State University; Ames, Iowa 50011
and they do not speak about index-free adjacency, but use the term "link".Fceller (talk) 13:43, 23 March 2014 (UTC)
sounds like pure marketing, the existing implementation all use indexes for persistent DBs. They use pointers for pure memory implementations, but those are just in-memory graphs and do not qualify as "databases", they are just object graphs that can be persisted. 89.158.120.107 (talk) 07:38, 1 December 2015 (UTC)

I agree with the "not correct" comment - and tie it to this one... If the database provides index-free adjacency (or index-free links if you prefer), then it can't be based on a key-value store - which is an index. So, there is a contradiction in how the article is written. This incorrect assertion is made in the first sentence where it asserts that they must be built on top of a key-value store. The idea of an index-free adjacency is analogous to that of a pointer where the time to follow the relationship is O(1) with respect to the size of the graph. Most indexes are generally not O(1). It's this O(1) property which separates native graph databases from systems built on top of relational databases, or other indexing schemes. It's not marketing-speak - it reflects the inherent complexity limitations of the technology on which its based. Whether one accepts that its a _requirement_ for it to be a graph database (and I don't), there is a definite distinction in terms of limiting performance of graph traversals when one has index-free adjacency operations. So, I would take issue with "all implementations use indexes for persistent DBs". That's true that they _have_ indexes, but they aren't used for adjacency or link purposes - which is a big difference. Neo4j, for example uses this method. With Neo4j, typically a query will find the node to start from with an index, and then the rest of the query simply follows links (relationships) to compute the answer. The time-complexity of the query depends largely on the size of the subgraph that has to be visited to satisfy the query - _not_ on the total size of the database.AlanR (talk) 18:12, 14 March 2016 (UTC)

needs a history

Some useful information but it would be more useful to me if it had a section on the history of graph databases. — Preceding unsigned comment added by 212.44.26.236 (talk) 13:38, 5 December 2013 (UTC)

Cayley Graph database

Cayley is another graph database released by few individuals from Google. It can found at https://github.com/google/cayley . Can someone add this information? — Preceding unsigned comment added by 60.241.210.212 (talk) 14:29, 29 August 2014 (UTC)

Datomic

Datomic is an index-based graph database. It is based on an immutable list of tuples, handles transactions, etc. RichMorin (talk) 23:27, 13 April 2015 (UTC)

In what sense is Datomic a graph database?80.41.76.129 (talk) 16:23, 6 October 2020 (UTC)

Gremlin

Gremlin is an important family of graph storage access tools. So, it can be used as a generic graph database API.

RichMorin (talk) 23:27, 13 April 2015 (UTC)

Too many lists

There are too many lists in this article. They dominate the content, to the point of 80% of the article length. Lists in articles should be used to aid understanding of a topic, rather than be a collection of catch-all companies. All of these lists would be better served by being split from the article into "List of" articles. Mamyles (talk) 18:22, 19 May 2015 (UTC)

Changed opening paragraph

Removing the inane confusion that a graph database is only a graph database if it provides index-free adjacency. This conflates what a graph database is, and what features it provides, ie it's interface, with the details of a particular way to implement one. There are other equally valid ways to implement one. This is like defining what a List is by saying Lists are only lists if they're linked lists.

Additionally if the intent of a "direct pointer" is that they must be physically direct, that is co-located, no distributed graph database could actually be a graph database.

It's also wrong that triple stores are specialized. They're perfectly capable of storing any arbitrary graph.  Preceding unsigned comment added by Mhgrove (talkcontribs) 17:50, 31 July 2015 (UTC)

MOS corrections

Help is needed to convert some inline links into references- at the moment this is just deletionista-bait. -- Clem Rutter (talk) 17:36, 13 February 2016 (UTC)

Hello, ClemRutter & Andy Dingley. Please stop adding spam links to Wikipedia. These are *not* references/citations, these are just promotional external links to products. If you are unsure of how External Links in the body of an article are handled, please visit WP:EL. If you feel you need an exemption from how external links are handled here, you can try the Wikipedia:External_links/Noticeboard. Thanks, Stesmo (talk) 19:33, 13 February 2016 (UTC)
I strongly advise them to study WP:WTAF. Many of the concerned articles either deserve an article or could be deleted. --Kgfleischmann (talk) 07:54, 14 February 2016 (UTC)
Gruss dich KG. From your edit history you seem to be in an excellent to create the necessary stubs, and help with the references. I find that obscure technological articles are a problem to edit- you need to be inclusive, as five years down the line when you need to access it again, the irrelevant has become vital. References to terminology can be of a lower standard than references to opinion of value judgements. Unfortunately, clean up projects seem to apply the rule book with out consideration of the individual exception.
You have suggest that we read a particular opinion piece WP:WTAF which clearly states that it is an essay not policy, and WP:REDLINK is the governing policy- I can see no reference in there to mandatory external link in the external links section. No matter: It is a rule I adopt when training new editors- but in this case it can be considered just as good practice. information is better than no information, and the references can be changed when they come available.
I also explain that reverting a multiline edit (other than vandalism) is not good practice. Each link/ reference needs to checked individually- in this reversion- C++ has been delinked! @Stesmo: is doing a great job in SPAM policing- but now we have a discussion going, we need to understand which reference he finds offensive, and I invite him to leave an inline comment around the term and restore the innocent wikilinks he has zapped.
@Kgfleischmann:, we know that de:wikipedia has different editing practices to en:W- I am interested in your opinion as to differences in referencing standards- and how flagged edits has helped. Also any other frustrations you have with de: or en:. Take the discussion to my en: talk page as it will be off topic here Clem Rutter (talk) 23:04, 14 February 2016 (UTC)
ClemRutter, you mention that I removed the C++ wikilink, yet fail to mention that it was the 13th and 14th wikilink to C++ in this article. That would be covered at WP:DUPLINK. Additionally, See Also should not contain wikilinks already used in the article WP:NOTSEEALSO.
Now on to External Links: External links do not belong inside the body of the article. About ~20% of the time when I see external links in the body of an article, it's a link in support of claims made in the article, accidentally placed there by a new editor. These are absolutely something that should be converted to a cite (example). Citations should not be bare www.productname.com, as they are not references and are definitely not WP:RELIABLESOURCES, such as the case in this article.
The only good way to get a link to www.productname.com on Wikipedia is the Official Website link at the bottom of an article *about ProductName*. Which ties into WP:WTAF. These non-Wikipedia-notable graph dbs (those without articles and wikilinks) arguably shouldn't even be in this list until they have an article about them and a wikilink to them. Thanks for continuing the discussion, ClemRutter. Stesmo (talk) 03:59, 15 February 2016 (UTC)

Overhaul

It has been noted previously that this article has too many lists. Items in the list should only be in this list if it is independently verifyable (per WP:V/WP:RS that they are Graph databases. Otherwise, this is just a WP:SPAMHOLE. In WP:LSC it states that Selection criteria for inclusion in lists should be ... supported by reliable sources. WP:CSC states that Lists are commonly written to satisfy either the criteria that Every entry meets the notability criteria. The lists such as "Features", "Distributed processing", "Shared-memory graph processing", etc, are also entirely unreferenced. I will start to prune these lists over the next couple of days/week. Please do not re-add items to these lists without first reading the policies and guidelines. -- HighKing++ 15:10, 27 August 2016 (UTC)

Disputed SAP HANA

Is SAP HANA a graph database indeed? IMHO it is a column oriented database, not even NoSQL. AlainD (talk) 14:33, 21 September 2016 (UTC)

It is as much a graph database as Oracle Spatial & Graph and Oracle Big Data Spatial & Graph are. Just because they're all built on top of RDBMS technology doesn't mean they should be excluded. See . Disclosure: I am an employee of Oracle. Michaelmalak (talk) 14:52, 21 September 2016 (UTC)
Sort of. It provides graph capabilities but isn't a specialized engine. --Mark viking (talk) 18:49, 21 September 2016 (UTC)
So does a graph database having evolved from non-graph origins disqualify it from being listed here? In my opinion, no, as the article is about graph databases, not graph database engines. Michaelmalak (talk) 18:58, 21 September 2016 (UTC)
I think that is a reasonable position. My own POV is that if reliable sources say HANA is a graph database, that is good enough for inclusion into this article. That seems to be the case, hence I am happy with keeping it in. --Mark viking (talk) 20:47, 21 September 2016 (UTC)

Disputed Gun graph database entry

Why can't I add an entry for a new Graph Database into the list?

RfC about Open Source software notability

Semi-protected edit request on 5 January 2017

Request to add GRAKN.AI to the list

I thought this was an article about Graph Databases

Vague Big-O claims

Merge discussion

TigerGraph - insufficient evidence for list inclusion

AgensGraph - no reliable source

JanusGraph

Dgraph

Is this "Fake news"?

Ontotext GraphDB

Wrong and Bad English?

Languages column for TinkerPop-enabled Graph databases

Updating the outdated version listed for ArangoDB

Tiny wording clarification

Semi-protected edit request on 28 March 2019

Semi-protected edit request on 16 June 2019

Why did TerminusDB get deleted from the list? 6 December 2019

Request edit on 4 April 2020

Add Tom Sawyer Perspectives to List of graph databases

Related Articles

Wikiwand AI