-
I like the Binary Space Partition Layout, but my dominant eye is my right eye, so it would be ideal to have my main pane to be on the right instead of on the left. Using the Tall-Right is a bit closer…
-
It would take some work, but I think this project would blow up, also I kinda want infinite zoom.
-
### What type of bug is this?
Performance issue
### What subsystems and features are affected?
Partitioning, Query planner
### What happened?
Timescale's planning times are very long for single i…
-
Implement an octree data structure. The octree will be used for space partitioning and query, with a maximum depth to be determined. Only visible octrees will be drawn, and only visible nodes of that …
-
### Describe the problem you're observing
I have multiple pools of spinning disks with varying levels of activity over time, and a cache device on NVME.
The cache is quite effective - especially…
-
I have a table with an integer field that takes limited values 1,2,3.
and I want to space partition by this field, one partition for each value, i.e. to create 3 partitions and use value as exact par…
-
Hi,
I have a question about the optimization for the boolean operations.
Specifically, is there any space-partitioning data structure used in accelerating the operations?
As I am trying to apply …
-
We have a case (the `cosmo8` dataset) where a spatial dataset is extremely skewed (always hashes to a single partition), making queries very difficult. If we had a MyriaL query that applied a balanced…
-
According to this paper it possible to do an exact representation of polygonal objects by differentiable scalar fields based on binary space partitioning. Correct me if i'm wrong but isn't distance f…
-
A short background: I was trying to create a dataset from a big pile of csv files (couple of hundreds). In first step the csv were parsed and saved to parquet files because there were many inconsisten…