hashirama/xcdat
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

minor

Browse source
This commit is contained in:
Shunsuke Kanda 2021-07-11 12:47:37 +09:00
parent 2687a98bf8
commit efa105dee6
1 changed files with 13 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
README.md
View file

@ -517,6 +517,18 @@ std::uint64_t memory_in_bytes(const Trie& idx);
std::uint32_t get_type_id(const std::string& filepath); std::uint32_t get_type_id(const std::string& filepath);
``` ```
### Exception class
If an error occurs in a construction or I/O operation, Xcdat will throw an instance of `xcdat::exception` as a runtime error.
```c++
class exception : public std::exception {
public:
//! Get the error massage.
const char* what() const throw() override;
};
```
## Performance ## Performance
We compared the performance of Xcdat with those of other selected dictionary libraries written in C++. We compared the performance of Xcdat with those of other selected dictionary libraries written in C++.
@ -565,7 +577,7 @@ We compared the performance of Xcdat with those of other selected dictionary lib
We constructed a dictionary from a dataset and measured the elapsed time. The dynamic dictionaries, Cedar and Tessil's containers, were constructed by inserting sorted keywords. Each keyword is associated with a unique ID of a 4-byte integer. Since all the libraries support serialization of the data structure, we measured the output file size as the memory usage. We constructed a dictionary from a dataset and measured the elapsed time. The dynamic dictionaries, Cedar and Tessil's containers, were constructed by inserting sorted keywords. Each keyword is associated with a unique ID of a 4-byte integer. Since all the libraries support serialization of the data structure, we measured the output file size as the memory usage.
The time to lookup IDs from keywords was measured for 1,000 query keywords randomly sampled from each the dataset. Also, for some libraries supporting to decode keywords from IDs, the time was measured for the 1,000 IDs corresponding to the query keywords. We took the best result of 10 runs. The time to lookup IDs from keywords was measured for 1,000 query keywords randomly sampled from each dataset. Also, for some libraries supporting to decode keywords from IDs, the time was measured for the 1,000 IDs corresponding to the query keywords. We took the best result of 10 runs.
The code of the benchmark can be found [here](https://github.com/kampersanda/fast_succinct_trie/tree/master/bench). The code of the benchmark can be found [here](https://github.com/kampersanda/fast_succinct_trie/tree/master/bench).