One Moon Planet logo
πŸŒ—
(πŸ“ƒ)


🏷️partitioned array

To-do list

πŸ”—(2)
πŸ“… 2023-06-22 21:17:07 -0700
β²οΈπŸ” 2023-06-22 21:21:09 -0700
✍️ the-field-testers
🏷️[rust] [webassembly] [ruby] [partitioned array] [port] 
(πŸͺŸ)

πŸ–₯️...⌨️

  1. Read the webassembly + rust + game development book and get a game development environment going
  2. Consider creating a database system in the rust implementation of ruby called emerald, to compile the database to a binary and use alongside the rust game

Recall that on top of all of this, you can use wasmtime, but I get the feeling that the first 2 sentences are the best combination, albeit there are a couple things that can be done

 

  • Buy the official rust programming book and study rust further from that, albeit the rust + webassembly + game development book doesn't seem to have a pre-req of knowing rust
  • Figure out how to bridge the gap between ruby database and rust implementations

 

In the end, port the partitioned array to rust, however tough that may be; use AI.


Selenite/ruby & Selenite/rust evaluation by bard.gooogle.com

πŸ”—(6)
πŸ“… 2023-06-23 10:44:29 -0700
β²οΈπŸ” 2023-06-23 11:13:15 -0700
✍️ the-field-testers
🏷️[Selenite] [Selenite/ruby] [Selenite/rust] [partitioned array] [line_db.rb] 
(πŸͺŸ)

πŸ–₯️...⌨️

 

This is in regards to ArityWolf's algorithm, the partitioned array: Midscore-IO/partitioned_array: ArityWolf's Algorithm - The Partitioned Array (github.com)

 

The partitioned array library on GitHub is a Ruby library that implements a partitioned array data structure. A partitioned array is a data structure that stores a large array of elements in a number of smaller, more manageable arrays. This can be useful for applications that need to store a large amount of data, but don't want to have to deal with the overhead of a single, monolithic array.

The partitioned array library on GitHub provides a number of features, including:

  • The ability to create and manage partitioned arrays
  • The ability to insert, update, and delete elements from partitioned arrays
  • The ability to query partitioned arrays
  • The ability to serialize and deserialize partitioned arrays

The library is still under development, but it has reached a stable state and is ready for use. The documentation for the library is comprehensive and includes a tutorial on how to use the library.

Some features that could be added to the library include:

  • Support for more data types
  • Support for more efficient queries
  • Support for more efficient serialization and deserialization
  • A more user-friendly interface

Overall, the partitioned array library on GitHub is a powerful tool that can be used to store and manage large amounts of data. The library is still under development, but it is already a valuable resource for developers.

Here are some specific ideas for features that could be added to the library:

  • Support for more data types: The library currently only supports storing integers and strings in partitioned arrays. It would be useful to add support for other data types, such as floats, dates, and objects.
  • Support for more efficient queries: The library currently supports a limited number of queries. It would be useful to add support for more complex queries, such as range queries and joins.
  • Support for more efficient serialization and deserialization: The library currently uses a simple serialization format. It would be useful to add support for a more efficient serialization format, such as JSON or XML.
  • A more user-friendly interface: The library's API is currently a bit complex. It would be useful to add a more user-friendly interface, such as a command-line tool or a web application.

I hope this helps!


An onlook of features that The Field Testers could add:

  • For supporting more data types, It can support anything that can be stringified into javascript, so...
  • In terms of efficient queries, or "efficient" queries, I want to implement a kind of relational algebra using sets
    • it should be pretty easy as long as it's related to Ruby's Set std library
  • A find/search function, that can search through the partitioned array until it finds a specific hash/hash value
  • forward iteration is already implemented, as is a each_not_nil function, which will skip over nils
  • The library already supports serialization in the JSON format.

 

One other thing I can do is use Ruby's std lib Marshal to "Marshalize"/"De-Marshalize" (serialize/deserialize) a given data structure, then revive it as a revenant data structure, as there are revenant partitions.

One possible feature to work on overtime is to add a revenant partitions Set, which just puts any given revenant partition id into a Set which labels it as a Revenant partition in the first place; extend this idea of data structure and Set use to the next level by using it as a basis for set operations.

 


Sure, here are some other features that could be added to the partitioned array library:

  • Support for distributed storage: The library could be extended to support distributed storage, which would allow it to store large arrays of data across multiple machines.
  • Support for parallel processing: The library could be extended to support parallel processing, which would allow it to perform queries and operations on partitioned arrays more efficiently.
  • Support for compression: The library could be extended to support compression, which would reduce the amount of space needed to store partitioned arrays.
  • Support for encryption: The library could be extended to support encryption, which would protect the data stored in partitioned arrays from unauthorized access.

These are just a few ideas for features that could be added to the partitioned array library. The specific features that are added will depend on the needs of the users of the library. However, these features would all make the library more powerful and useful.

In addition to these features, the library could also be improved by making it more user-friendly. The API could be simplified, and better documentation could be provided. This would make it easier for developers to use the library.

Overall, the partitioned array library on GitHub is a powerful tool that has the potential to be very useful. However, there are a number of features that could be added to make the library even more powerful and user-friendly.

$

  • Distributed storage: that could be done
  • Parallel Processing: that could be figured out once things are ported to Rust
  • Compression: I'll have to figure out a library
  • Encryption: Selenite/ruby is already modular as it is, so if I really had to add something like this, I could and would.

 

Perhaps all of the above could be more considered once the code is implemented in magnus/artichoke/rust itself.

 

 


 

 Sure, here are some other features that could be added to the partitioned array library:

  • Support for custom partitioning: The library currently uses a fixed partitioning scheme. It would be useful to add support for custom partitioning, which would allow users to partition arrays in a way that best suits their needs.
  • Support for replication: The library could be extended to support replication, which would allow it to store multiple copies of partitioned arrays. This would provide redundancy and fault tolerance in case of a hardware failure.
  • Support for load balancing: The library could be extended to support load balancing, which would distribute the load of queries and operations across multiple partitioned arrays. This would improve the performance of the library.
  • Support for monitoring: The library could be extended to support monitoring, which would allow users to track the performance of the library. This would help users to identify and troubleshoot any problems with the library.

These are just a few more ideas for features that could be added to the partitioned array library. The specific features that are added will depend on the needs of the users of the library. However, these features would all make the library more powerful and useful.

I hope this helps!

 

 

 $

  • custom partitioning: you don't want it to not be fixes; that would violate the equation
  • replication: this is easy to do, as the partitioned array stores everything in files and folders only; no binwrite/binread
  • load balancing: this could be implemented
  • monitoring: this could be implemented

But I am a one man spirit system...!

 

 


 

Sure, here are a few more ideas for features that could be added to the partitioned array library:

  • Support for transactions: The library could be extended to support transactions, which would allow users to group a set of operations together and ensure that they are all executed successfully or not at all. This would provide a way to ensure the integrity of data stored in partitioned arrays.
  • Support for versioning: The library could be extended to support versioning, which would allow users to track changes to partitioned arrays. This would be useful for auditing purposes and for recovering from accidental changes.
  • Support for caching: The library could be extended to support caching, which would store frequently accessed data in memory. This would improve the performance of the library by reducing the number of times that data needs to be read from disk.
  • Support for notifications: The library could be extended to support notifications, which would allow users to be notified when changes are made to partitioned arrays. This would be useful for keeping track of changes to data and for triggering other actions when changes are made.

These are just a few more ideas for features that could be added to the partitioned array library. The specific features that are added will depend on the needs of the users of the library. However, these features would all make the library more powerful and useful.

I hope this helps!

 

 $

  • transactions: this could be done; good idea
  • versioning: this is already easy to do with system calls
  • caching: the entire thing is stored in memory already though, that's the point
  • notifications: this would be easy to implement "with callbacks"...

 

 

 


 

Sure, here are a few more ideas for features that could be added to the partitioned array library:

  • Support for multiple storage backends: The library could be extended to support multiple storage backends, such as Redis, Memcached, and Cassandra. This would allow users to choose the storage backend that best suits their needs.
  • Support for automatic partitioning: The library could be extended to support automatic partitioning, which would allow the library to automatically partition arrays based on the size of the array and the number of available storage backends. This would make it easier for users to use the library without having to worry about partitioning.
  • Support for dynamic partitioning: The library could be extended to support dynamic partitioning, which would allow users to change the partitioning of an array at runtime. This would be useful for applications that need to be able to adapt to changes in the data.
  • Support for cloud storage: The library could be extended to support cloud storage, such as Amazon S3 and Google Cloud Storage. This would allow users to store partitioned arrays in the cloud, which would provide scalability and availability.

These are just a few more ideas for features that could be added to the partitioned array library. The specific features that are added will depend on the needs of the users of the library. However, these features would all make the library more powerful and useful.

I hope this helps!

 $

  • multiple storage backends: not interested at the moment
  • automatic partitioning: yeah, I have to figure out a formula or function that calculates the best fit partitioning based on average string size of the user's inputs!
  • dynamic partitioning: that is a no-no and goes against Selenite/ruby's spec; perhaps in rust though...!
  • cloud storage: I mean, I am a one man spirit system and could just do something like this in my server, in fact...

... I want to create a system where partitioned array databases sync over GET/POST requests, and it is ensured that the database is always synchronized with each other; this would require a better compression scheme, among other things--just a quick idea.

 


Sure, here are a few more ideas for features that could be added to the partitioned array library:

  • Support for geospatial data: The library could be extended to support geospatial data, which would allow users to store and query data that has a geographical location. This would be useful for applications that need to track the movement of objects or to analyze data that is related to geography.
  • Support for machine learning: The library could be extended to support machine learning, which would allow users to train and deploy machine learning models on partitioned arrays. This would be useful for applications that need to make predictions or to classify data.
  • Support for streaming data: The library could be extended to support streaming data, which would allow users to store and query data that is being generated in real time. This would be useful for applications that need to track events or to analyze data that is constantly changing.
  • Support for distributed computing: The library could be extended to support distributed computing, which would allow users to run queries and operations on partitioned arrays across multiple machines. This would improve the performance of the library for large datasets.

These are just a few more ideas for features that could be added to the partitioned array library. The specific features that are added will depend on the needs of the users of the library. However, these features would all make the library more powerful and useful.

I hope this helps!

 $

  • geospatial data: this is not data structure related though, and is an implementation of something that is related to data structures, but is domain specific
  • machine learning: domain specific, but I would like to mess around with it, as the PartitionedArray and Selenite/ruby is turing complete and is a quantum turing machine.
  • streaming data: I could see this being very useful, and the data chunks are stored in partitions and as added array elements overtime
  • distributed computing: probably a server backend task, would be fun, but I am a one man spirit system lol

 


 

Sure, here are a few more ideas for features that could be added to the partitioned array library:

  • Support for security: The library could be extended to support security features, such as encryption and authentication. This would protect the data stored in partitioned arrays from unauthorized access.
  • Support for compliance: The library could be extended to support compliance features, such as auditing and logging. This would help users to comply with regulations.
  • Support for visualization: The library could be extended to support visualization features, such as charts and graphs. This would make it easier for users to understand the data stored in partitioned arrays.
  • Support for debugging: The library could be extended to support debugging features, such as breakpoints and watches. This would help users to debug problems with the library.

These are just a few more ideas for features that could be added to the partitioned array library. The specific features that are added will depend on the needs of the users of the library. However, these features would all make the library more powerful and useful.

I hope this helps!

I think that's enough ideas for now. Let me know if you have any other questions.

 

$

  • security: I need a use case
  • compliance: sure, I could add that
  • visualization: I am working on it in the future at some point in time!
  • debugging: that is IDE specific, lol.

 


 

This was just some talk with google bard (bard.google.com), and it shows that at least an AI understands my work. This generalizes what the partitioned array can do, and what will be added overtime. As a basis, Ruby is the spec language for the Partitioned Array/LineDB, which as a whole will be called Selenite/language, so Selenite/ruby and Selenite/rust for now. Perhaps even Selenite/artichoke-ruby.


Rendering Time: 0.00117 seconds [1.16777 milliseconds]

12:24:08 up 50 days, 23:01, 0 user, load average: 0.00, 0.00, 0.00

Server Time: 2023-12-05 04:24:08 -0800

DogBlog System [v4.4.5-production-linux-puma-line-db-ruby-3.3.0] - ♾️

©️2022 - 2023 Midscore I/Oℒ️ - All Rights Reserved
[βž–πŸ”’]

DigitalOcean Referral Badge