home shape

IN List Improvements: ArangoDB Query Enhancement

May 11, 2015/

Another performance improvement could be accomplished in the latest devel-branch: The handling of large IN-lists. Those become much faster than in the previous releases. Large IN-lists are normally used when comparing attribute or index values against some big array of lookup values or keys provided by the application.

Read on how this improvement reduces query execution time.

Jan Steemann

Jan Steemann

After more than 30 years of playing around with 8 bit computers, assembler and scripting languages, Jan decided to move on to work in database engineering. Jan is now a senior C/C++ developer with the ArangoDB core team, being there from version 0.1. He is mostly working on performance optimization, storage engines and the querying functionality. He also wrote most of AQL (ArangoDB’s query language).
May 11, 2015,Jan Steemann

1 Comments

  1. CoDEmanX on May 12, 2015 at 1:32 pm

    What’s the algorithm in particular that enabled this performance increase?

    Are there known limitations, like quadratic runtime again if you use two IN-list criteria in a FILTER statement, or combine one with another condition?

    Reply

Leave a Comment





Get the latest tutorials, blog posts and news:

Tags

API AQL arangoml arangosearch arangosh Benchmark Cloud Cluster Community Compliance data science Documentation driver Enterprise Foxx Fraud Detection geo GitHub Graph graph database Graph Databases HTTP Java JavaScript Knowledge Graphs Kubernetes Machine Learning Managed Service ML monitoring multi-model Newsletter NoSQL open-source Performance Pregel python pytorch Release RocksDB Ruby SOC 2 testing Tutorial WebUI