Skip to content
This repository has been archived by the owner on Jan 10, 2023. It is now read-only.

Commit

Permalink
Merge pull request #137: Fix typo
Browse files Browse the repository at this point in the history
Fix typo
  • Loading branch information
arthurhsu authored Feb 24, 2017
2 parents 3a33c5e + ed14e2a commit 9ad32c6
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion docs/dd/06_indices.md
Original file line number Diff line number Diff line change
Expand Up @@ -78,7 +78,7 @@ performance tweaking for real-world usage, ... etc.
B+ Tree is a very complicated data structure and some argues the complexity
of it makes physical optimization very hard. However, past experiences regarding
physical plan optimization do not apply to Lovefield since they are under the
assumption of using page-based disk I/O, which is irrelavant for most data
assumption of using page-based disk I/O, which is irrelevant for most data
stores of Lovefield.

Lovefield's B+ tree has following tweaks:
Expand Down

0 comments on commit 9ad32c6

Please sign in to comment.