上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 52 下一页
摘要: 病毒程序示范 内存泄露(占满内存)程序导致死机实例 阅读全文
posted @ 2016-04-14 21:40 shamgod 阅读(680) 评论(0) 推荐(0)
摘要: 求二次方程的根 #include <stdio.h >#include<math.h>int main(void) { //把三个系数保存到计算机中 int a = 1; //=不表示相等,表示赋值 int b = 4; int c = 4; double delta; //delta存放的是b*b 阅读全文
posted @ 2016-04-14 21:38 shamgod 阅读(611) 评论(0) 推荐(0)
摘要: We may represent a subset of n elements by the one-dimensional array x[1:n], where x[j] is one if element j is included in the subset and x[j] is zero 阅读全文
posted @ 2016-04-13 16:43 shamgod 阅读(292) 评论(0) 推荐(0)
摘要: 一、聚集索引介绍 1.什么是聚集索引? InnoDB’s clustered indexes actually store a B-Tree index and the rows together in the same structure. 2.为什么一张表只能一个聚集索引? When a tab 阅读全文
posted @ 2016-04-12 18:32 shamgod 阅读(461) 评论(0) 推荐(0)
摘要: 一、怎样用索引才高效 1.隔离索引列 MySQL generally can’t use indexes on columns unless the columns are isolated in the query. “Isolating” the column means it should n 阅读全文
posted @ 2016-04-12 16:38 shamgod 阅读(247) 评论(0) 推荐(0)
摘要: 一、 1. 1). Indexes reduce the amount of data the server has to examine.2). Indexes help the server avoid sorting and temporary tables.3). Indexes turn 阅读全文
posted @ 2016-04-12 11:14 shamgod 阅读(234) 评论(0) 推荐(0)
摘要: 一、 1.什么是hash index A hash index is built on a hash table and is useful only for exact lookups that use every column in the index. For each row, the st 阅读全文
posted @ 2016-04-12 10:43 shamgod 阅读(198) 评论(0) 推荐(0)
摘要: 一、 1.什么是B-Tree indexes? The general idea of a B-Tree is that all the values are stored in order, and each leaf page is the same distance from the root 阅读全文
posted @ 2016-04-12 09:31 shamgod 阅读(230) 评论(0) 推荐(0)
摘要: 1.Good schema design is pretty universal, but of course MySQL has special implementation details to consider. In a nutshell, it’s a good idea to keep 阅读全文
posted @ 2016-04-11 21:55 shamgod 阅读(182) 评论(0) 推荐(0)
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 52 下一页
haha