Date/Time scheduler question?

Using a Fauna simple date/time key on a unique ID value (both FQL) writing sorted to disk - very roughly -around what’s the maximum write and read operations per second? The data structure would be a B Tree or something else?

Hi @joillian and welcome to the forums!

We have an example of how to search for Documents by a date range, and it’s quite efficient in terms of reading and writing.

Fauna is highly scalable. In practice, your application will impose some limits on how much throughput you can get. The biggest limiters to write operations are

  1. Contention: You can only write to a single Document so quickly. While writing/creating multiple documents in parallel is scalable to just about any degree, multiple transactions mutating the same Document have to be queued up and run serially.
  2. Cost: In practice, you will likely be concerned with cost well before you hit limits of writes/second. Note that the more Indexes you have on a given source, the more expensive your writes will be in terms of performance (time) and cost (storage, write operations).

The bottom line is that you need to benchmark your own application, with your own data to truly determine how it works with Fauna. If you believe that you need more capacity, then we can work with you to make sure we have the infrastructure in place to handle your workload.

Are you asking what the underlying storage structure is for Fauna? Or are you saying that you want to store your data in a B-Tree?

Here are some additional notes:

1 Like

This topic was automatically closed 21 days after the last reply. New replies are no longer allowed.