Draft:AncelusDB

{{AFC submission|d|corp|u=Indy7982|ns=118|decliner=Caleb Stanford|declinets=20250323033151|ts=20250321193718}}

{{AFC submission|d|nn|u=Indy7982|ns=118|decliner=Liance|declinets=20250319184847|small=yes|ts=20250319183108}}

{{AFC comment|1=The article is very short and does not have sufficient sources to demonstrate notability. Thank you for disclosing the COI! Since you have a disclosed COI, strongly suggest consulting with someone else via the talk page or WikiProject Computing to see if the topic merits a Wikipedia article, before proceeding with further AfC submissions. Best of luck, Caleb Stanford (talk) 03:31, 23 March 2025 (UTC)}}

{{AFC comment|1=In accordance with the Wikimedia Foundation's Terms of Use, I disclose that I have been paid by my employer for my contributions to this article. Indy7982 (talk) 18:14, 19 March 2025 (UTC)}}

----

{{Infobox software

| author = John Layden, David Layden

| developer = Time Compression Strategies

| programming language = C

| website = https://www.ancelus.com/index.html

}}

[https://www.ancelus.com/index.html Ancelus] (also known as AncelusDB, ATDB, and "the nanosecond database") is an ACID compliant, graph database built with CMake and written primarily in C for Linux, Unix, and Windows operating systems.{{Cite web |date=2018-08-08 |title=Blazing Fast Access With Ancelus Algorithmic Database |url=https://www.dbta.com/Columns/DBA-Corner/Blazing-Fast-Access-With-Ancelus-Algorithmic-Database-126782.aspx |access-date=2025-03-21 |website=Database Trends and Applications |language=en-US}}

Ancelus was built in 2003 with the reason being that many other technologies that rely on a database can outperform their respective database. It operates by using both algorithmic data storage and in-memory data access which allows top performance for a wide range of sizes and use cases. Data is linked to pointers allowing data elements to be stored only once resulting in no data duplication.{{Cite web |title=U.S. Patent for Real-time statistical process monitoring system Patent (Patent # 5,339,257 issued August 16, 1994) - Justia Patents Search |url=https://patents.justia.com/patent/5339257#history |access-date=2025-03-19 |website=patents.justia.com}}

The database isn't a relational database and data access is done through a native API. That being said, Ancelus's Threaded Query Language (TQL) allows does allow users to access data stored in an Ancelus database using SQL by converting the schema structures into those readable by SQL though it does come with a performance penalty. TQL is designed for integration purposes rather than maximum performance{{Cite web |last=Howard |first=Philip |date=2012-05-17 |title=Ancelus - Bloor Research |url=https://bloorresearch.com/2012/05/ancelus/ |access-date=2025-03-21 |website=bloorresearch.com |language=en-GB}}

Draft:AncelusDB

References