Ultipa Graph
Script error: No such module "Draft topics".
Script error: No such module "AfC topic".
Developer(s) | Ultipa, Inc. |
---|---|
Stable release | 4.3
/ 2023 |
Written in | C++ |
Engine | |
Type | Graph database |
License | Proprietary commercial software |
Website | www |
Search Ultipa Graph on Amazon.
Ultipa Graph is a property graph database developed by Ultipa, Inc..[1]. Ultipa Graph is categorized as a Hybrid Transactional/Analytical Processing (HTAP)[2][3]
Ultipa, Inc.[edit]
Ultipa Graph is developed by Ultipa, Inc., based in San Ramon, California. Ultipa, Inc. is member of the Linked Data Benchmark Council (LDBC), a non-profit organization aiming to define standard graph benchmarks to foster a community around graph processing technologies[4], and to investigate research questions on graph query languages and language extensions for graphs, including the Graph Query Language[5]
References[edit]
- ↑ "Company profile for: Ultipa on Bloor Research". Bloor Research. 2023-10-20. Retrieved 2023-12-23.
- ↑ Sun, Ricky (2023). "Scalability design in a graph database without losing performance". The Knowledge Graph Conference 2023. doi:10.5281/zenodo.7827268.
- ↑ Sun, Ricky; Chen, Jamie (2023-06-18). "Design of Highly Scalable Graph Database Systems without Exponential Performance Degradation". Proceedings of the International Workshop on Big Data in Emergent Distributed Environments. BiDEDE '23. New York, NY, USA: Association for Computing Machinery. pp. 1–6. doi:10.1145/3579142.3594293. ISBN 979-8-4007-0093-4. Unknown parameter
|s2cid=
ignored (help) Search this book on - ↑ "Announcing the LDBC Financial Benchmark Task Force". ldbcouncil.org. Retrieved 2023-12-24.
- ↑ "LDBC Graph Query Working Groups". ldbcouncil.org. Retrieved 2023-12-24.
External Links[edit]
This article "Ultipa Graph" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Ultipa Graph. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.