Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Query execution time profiling and optimization #62

Open
wangli1426 opened this issue Aug 25, 2017 · 1 comment
Open

Query execution time profiling and optimization #62

wangli1426 opened this issue Aug 25, 2017 · 1 comment

Comments

@wangli1426
Copy link
Collaborator

A query can take over 100 ms even through it does not involve in any subquery on the B+tree or the data chunk.

To reduce the query execution latency, we should first breakdown the query execution time, pinpoint the performance bottlenecks and make optimizations.

@wangli1426
Copy link
Collaborator Author

Via investigation, I found that a large amount of time is spent on filtering on the time stamp and running user-defined filters. Since the data is serialized before inserted into the B+ tree, any filtering on non-key attributes need to deserialized the tuple first, resulting in expensive deserializing cost.

To solve this problem, we need to redesign the implementation of B+ tree. To be more specific, data tuples should not be serialized before flushing the B+ tree. This avoids deserialization in subquery evaluations.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant