1. cap定理及其限制?
布鲁尔定理,对于一个分布式系统来说,不能同时满足以下三点:
Consisteny(一致性)
Availability(可用性)
Partition tolerance(分区容错性)
一个分布式系统,只能满足3项中的2项,一般来说,分区容错性是必选项,所以我们大部分选择CP和AP的组合。
2. 主流索引算法及其原理?
概念不是很清晰,暂时未写
3. 分布式系统会有哪些问题?
如何保证数据的一致性
4. 事务隔离级别有哪些?
read uncommitted 读未提交
read committed 读已提交
repeatable read 可重复读
serializable 串行化
级别 | 名字 | 隔离 | 脏读 | 不可重复读 | 幻读 |
1 | 读未提交 | read uncommitted | ✔ | ✔ | ✔ |
2 | 读已提交 | read committed | \ | ✔ | ✔ |
3 | 可重复读 | repeatable read | \ | \ | ✔ |
4 | 串行化2 | serializable | \ | \ | \ |
5. 用shell统计下如下内容第三列出现的数量?
Chrome/91.0.4472.101 HTTP/2.0 news 183.136.216.35
Safari/537.36 HTTP/1.0 user 183.136.216.35
Chrome/91.0.4472.101 HTTP/2.0 accout 183.136.216.35
Safari/537.36 HTTP/1.0 center 183.136.216.34
Chrome/91.0.4472.101 HTTP/2.0 news 183.136.216.35
Safari/537.36 HTTP/1.0 user 183.136.216.35
Chrome/91.0.4472.101 HTTP/2.0 accout 183.136.216.31
Safari/537.36 HTTP/1.0 list 183.136.216.32
Chrome/91.0.4472.101 HTTP/2.0 news 183.136.216.35
Safari/537.36 HTTP/1.0 user 183.136.216.35
Chrome/91.0.4472.101 HTTP/2.0 accout 183.136.216.35
Safari/537.36 HTTP/1.0 center 183.136.216.34
Chrome/91.0.4472.101 HTTP/2.0 news 183.136.216.35
Safari/537.36 HTTP/1.0 home 183.136.216.35
Chrome/91.0.4472.101 HTTP/2.0 accout 183.136.216.31
Safari/537.36 HTTP/1.0 list 183.136.216.32
Chrome/91.0.4472.101 HTTP/2.0 news 183.136.216.35
Safari/537.36 HTTP/1.0 user 183.136.216.35
Chrome/91.0.4472.101 HTTP/2.0 accout 183.136.216.35
Safari/537.36 HTTP/1.0 center 183.136.216.34
Chrome/91.0.4472.101 HTTP/2.0 news 183.136.216.35
Safari/537.36 HTTP/1.0 user 183.136.216.35
Chrome/91.0.4472.101 HTTP/2.0 accout 183.136.216.31
Safari/537.36 HTTP/1.0 list 183.136.216.32
备注:数据以空格分割,共四列,分别是浏览器版本 http协议,页面名称,IP地址
cat name.txt | awk '{print $3}' | sort | uniq -c
利用管道符,先提出txt文档中每一行第三个数据,排序,然后用uniq -c统计出次数
参考链接:(6条消息) 日志分析命令 cat+awk+uniq+sort 详解_PandaJack1314的博客-CSDN博客_awk uniq