Jump to content

Sparksee (graph database): Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m top: Apply Gen fix(es), typo(s) fixed: On March 2010 → In March 2010, on February 2014 → in February 2014
m Updating Infobox (Removing unknown parameter 'status')
Line 10: Line 10:
| operating system = [[Cross-platform]]
| operating system = [[Cross-platform]]
| genre = [[Graph Database]]
| genre = [[Graph Database]]
| status = Active
| license = Dual-licensed: personal evaluation use / commercial use
| license = Dual-licensed: personal evaluation use / commercial use
| website = [http://www.sparsity-technologies.com/#sparksee Sparsity-Technologies:Sparksee]
| website = [http://www.sparsity-technologies.com/#sparksee Sparsity-Technologies:Sparksee]

Revision as of 11:15, 29 April 2021

Sparksee
Developer(s)Sparsity Technologies
Initial release2008 (2008)
Stable release
v5.2 / 2015
Operating systemCross-platform
TypeGraph Database
LicenseDual-licensed: personal evaluation use / commercial use
WebsiteSparsity-Technologies:Sparksee

Sparksee (formerly known as DEX) is a high-performance and scalable graph database management system written in C++.

Its development started in 2006 and its first version was available on Q3 - 2008. The fourth version is available since Q3-2010. There is a free community version, for academic or evaluation purposes, available to download, limited to 1 million nodes, no limit on edges.

Sparksee is a product originated by the research carried out at DAMA-UPC (Data Management group at the Polytechnic University of Catalonia). In March 2010 a spin-off called Sparsity-Technologies has been created at the UPC to commercialize and give services to the technologies developed at DAMA-UPC.

DEX changed name to Sparksee on its 5th release in February 2014.

Graph Model [1]

Sparksee is based on a graph database model,[2] that is basically characterized by three properties: data structures are graphs or any other structure similar to a graph; data manipulation and queries are based on graph-oriented operations; and there are data constraints to guarantee the integrity of the data and its relationships.

A Sparksee graph is a Labeled Directed Attributed Multigraph. Labeled because nodes and edges in a graph belong to types. Directed because it supports directed edges as well as undirected. Attributed because both nodes and edges may have attributes and Multigraph meaning that there may be multiple edges between the same nodes even if they are from the same edge type.

One of its main characteristics is its performance storage and retrieval for large graphs (in the order of billions of nodes, edges and attributes) implemented with specialized structures.

Technical Details

See also

References

  1. ^ Martínez-Bazan, N., Muntés-Mulero, V., Gómez-Villamor, S., Nin, J., Sánchez-Martínez, M., and Larriba-Pey, J. 2007. Dex: high-performance exploration on large graphs for information retrieval. In Proceedings of the Sixteenth ACM Conference on Conference on information and Knowledge Management (Lisbon, Portugal, November 06–10, 2007). CIKM '07. ACM, New York, NY, 573-582.
  2. ^ R. Angles and C. Gutierrez. Survey of graph database models. Technical Report TR/DCC-2005-10, Computer Science Department, Universidad de Chile, October 2005.

Also