-
Our current method for retrieving hierarchical tree connections is downright awful. We iterate through the tree, retrieving each node and making a new query every time we need the next node. This code…
-
**[Original report](https://bitbucket.org/himselfv/wakan/issue/135) by me.**
Originally reported on Google Code with ID 135
```
Every pinyin syllable has a tone, i.e. pin3yin4. Words with different t…
-
**Is your feature request related to a problem? Please describe.**
My Problem: I replicate bloom filters from many clients (up to 1000) to my server.
The server then has to lookup a given key "fo…
-
I had an idea today when trying to work in-memory with GTFS that it can make sense to do look ups, as I have seen in the code. The look ups however are likely (and I am yet to test an approach here) i…
-
I want the ability to download a file of bad domain names and be able to block domains if they are in that file
This would require some sort of fast lookup data structure.
- BloomFilter
- P…
-
Right now I still notice that queries for existing applets and files can take a varying amount of time - sometimes quite long. My guess is that some of this has to do with how system performance on r…
-
BPO | [32081](https://bugs.python.org/issue32081)
--- | :---
Nosy | @isidentical
*Note: these values reflect the state of the issue at the time it was migrated and might not reflect the current state…
-
See discussion at #34.
SQLite handles `SELECT * FROM tbl WHERE col IN (a, b, c)` by unioning three queries (col = a, col = b, col c). The overhead to seek to a rowgroup and uncompress a large batc…
-
I'm developing a search engine. It requires extremely fast Unicode character normalization: decomposition, accent stripping, and case folding.
The best way that I have found so far:
```
Convert…
-
The underlying DHT (utilizing the [libp2p Kademlia DHT spec](https://github.com/libp2p/specs/tree/master/kad-dht)) allows peers to query by a **TOPIC** for a **RESULT**, or query by **TOPIC** for all …