sysu_xiamengyou-CSDN博客

原创 Oracle Data Guard搭建

目录一、DataGuard介绍二、Data Guard原理三、Data Guard主库与备库3.1 Data Gurad主库3.2 Data Guard备库四、物理备库的数据保护级别4.1保护模式和重做传输4.2最大保护模式4.3最大可用性模式4.4最高性能模式一、DataGuard介绍 Data Guard是保证企业数据的高可用性（high availability）、数据保护（data protection）以及灾难恢复（di...

2021-03-12 09:54:11 2926 1

原创 Oracle唯一性约束和唯一性索引的关系

唯一性约束通过唯一性索引来实现？我觉得这说法不对。对于唯一性约束，索引是必须存在的，唯一性约束本质上是通过索引来保证的，但不一定是唯一性索引。唯一性约束允许有NULL值，唯一性约束的列可允许有多个NULL值。唯一性约束通过BTREE索引实现，而BTREE索引是不会包含NULL值，但使用NULL值过滤时不会走索引。在没有索引的情况下，创建唯一性约束会自动创建一个唯一性索引，但Oracle官方建议将唯一性约束和索引分开，这该怎么理解呢？原来在创建唯一性约束时默认创建的唯一性索引会随着唯一性约束DIS

2021-03-10 17:51:09 2538

原创 Oracle数据库更改数据文件位置

前言近期IPCC服务器的数据库数据目录/oradata磁盘空间不足，由于无法添加磁盘来扩容，需要将数据库数据目录从/oradata更改为/home/oracle/oradata。由于数据库文件和表空间具有不同的性质，将数据文件位置更改分为四个步骤：控制文件位置更改、数据文件位置更改(不包括临时数据文件)、临时数据文件位置更改、日志文件位置更改。一、控制文件位置更...

2020-04-02 15:15:30 3498

原创 VMware Centos7.4+UDEV+AMS+ORACLE 配置RAC环境

目录一、准备工作1.1 服务器准备1.2 IP地址准备1.3 用户及组准备1.4 SSH信任关系准备1.5 文件目录准备（crmtest1和crmtest2）1.6 RPM包准备1.7 共享磁盘准备1.8 系统参数修改1.9 DNS服务器搭建（可选）二、安装RAC2.1 安装grid2.2asmca创建data/fradatagroup2...

2019-11-01 16:41:27 5126

原创 Oracle减小数据文件大小

收集表空间的统计信息，查询表空间的使用率 -- 查询非临时表空间的使用率 SELECT d.Tablespace_Name, Space "SUM_SPACE(M)", Blocks "SUM_BLOCKS", Space - Nvl(Free_Space, 0) "USED_SPACE(M)", Round((1 - Nvl(Free_Space, 0) / Space) * 100, 2) "USE...

2021-02-23 10:14:06 2390

原创 IMPDP时出现ORA-39083：Object type PROCACT_SCHEMA failed to create with error

在使用IMPDP对数据库按照Schema进行导入数据时，出现了奇怪的错误，数据库版本11.2.0.3.0。IMPDP导入命令如下。impdp system/tplink directory=dump_dir dumpfile=tpqms.dmp remap_schema=tpqms:tpqms remap_tablespace=TPQMS_DATA:TPQMS_DATA table_ex...

2020-04-03 15:01:28 10679 2

原创 RMAN全备份异地恢复

通常我们需要将生产环境的数据导入到测试环境，定期对测试环境的数据进行更新，但使用EXPDP/IMPDP会出现许多的问题，还会有序列等无法导出的问题，于是推荐使用RMAN备份异地恢复，该操作耗时少，且不容易出错。一、准备工作生产环境：CRMPROD 生产数据库：CRMPROD测试环境：CRMTEST 测试数据库：CRMTEST删除CRMTE...

2019-07-03 15:12:42 1534

原创 [算法机试模拟题]1007.小黄车

【问题描述】随着共享经济的兴起，大学城如今到处可见ofo小黄车. 小左现在打算每天都骑小黄车从宿舍去实验室. 假设大学城的地图可以简化为一个有向图，图中有N个地点（节点），用0到N-1进行编号，有些地点之间存在有向的道路（有向边）. 小左的宿舍所在地点编号为0，实验室所在地点编号为N-1. 小左希望为连续的M天规划线路，使得每天从宿舍到实验室，都至少会经过一条之前没有走过的道路（有向边）.

2017-06-20 22:43:01 3282

原创 [LeetCode OJ]Edit Distance

【问题描述】Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitte

2017-06-14 15:54:30 327

原创 [LeetCode OJ]Longest Palindromic Substring

【问题描述】Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid

2017-06-08 21:57:36 264

原创 NP完全问题

8.3STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables are true, if such an assignme

2017-06-08 15:34:58 1780

原创 [LeetCode OJ]Swap Nodes in Pairs

【问题描述】Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only const

2017-06-04 21:33:11 300

原创 [LeetCode OJ]Longest Palindromic Subsequence

【问题描述】Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1:Input:"bbbab"Output:4One possible lo

2017-05-26 23:12:53 290

原创 [LeetCode OJ]Partition Equal Subset Sum

【问题描述】Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note:Each

2017-05-18 22:36:40 257

原创 [LeetCode OJ]Split Array Largest Sum

【问题描述】Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among

2017-05-12 16:52:46 351

原创 [LeetCode OJ]Triangle

问题描述：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2],

2017-05-05 13:51:59 423

原创 [LeetCode OJ]Target Sum

问题描述：You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.

2017-04-29 20:09:41 1037

原创 [LeetCode OJ]Continuous Subarray Sum

问题描述：Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is

2017-04-23 22:58:05 329

原创 [LeetCode OJ]Super Washing Machines

问题描述：You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.For each move, you could choose any m (1 ≤ m ≤ n) washing machines, and pass on

2017-04-15 14:58:22 579

原创 [LeetCode OJ]Maximum Product Subarray

问题描述：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has t

2017-04-09 22:06:14 332

原创 K-Means Clustering算法

K-Means Clustering算法 k-means聚类接受的参数输入和分级聚类算法一样，接受相同的数据行作为输入，此外它还接受一个调用者期望返回的聚类数（k）作为参数。k-means聚类算法不同于分级聚类算法，它会预先告诉算法希望生成的聚类数量，然后算法会根据数据的结构状况来确定聚类的大小。聚类过程图1 K-Means聚类算法示意图在第一步中，随机生成两个聚类中心，分别是两个小

2017-04-01 10:37:02 8195 2

原创分级聚类——Hierarchical cluster算法

分级聚类——Hierarchical cluster算法@(Xia Mengyou)[cluster] 本篇文章是我在学习《集体智慧编程》这本书时，学习了一下cluster分级聚类算法，然后加入一点自己的理解，代码基于python3，与python2有一点不同。分级聚类Hierarchical cluster算法引言聚类过程聚类实例1读取文件2紧密度皮尔逊相关系数3建立聚类4聚类

2017-03-30 21:50:13 21472 2

原创 Queue Reconstruction by Height

问题描述： Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front o

2017-03-26 19:37:20 456

原创 Remove K Digits

Remove K Digits@(algorithm)[greedy]问题描述： Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible. Note:

2017-03-23 19:52:29 771

原创 [LeetCode OJ]Longest Substring Without Repeating Characters

【问题描述】Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the

2017-03-19 15:15:59 325

原创 [LeetCode OJ]Container With Most Water

【问题描述】Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (

2017-03-14 16:39:04 290

原创 [LeetCode OJ]Merge k Sorted Lists

【问题描述】Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.问题来源：Merge k Sorted Lists【解题分析】将k个有序的数组合并成一个有序的数组，将其分而治之，每次只比较两个数组，简易图为：

2017-03-09 21:46:32 288

原创 [LeetCode OJ]Combination Sum I && II

【问题描述】Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number ma

2017-03-09 21:07:43 346

原创 [LeetCode OJ]Valid Parentheses

【问题描述】Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}"

2017-03-09 20:41:18 278

原创七、[LeetCode OJ]Median of Two Sorted Arrays

【问题描述】There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:

2017-03-07 21:09:50 310

原创六、[LeetCode OJ]Maximum Subarray

【问题描述】Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [

2017-03-04 18:12:44 252

原创五、[LeetCode OJ]Majority Element

【问题描述】Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the major

2017-03-04 14:33:23 348

原创四、[LeetCode OJ]Integer to Roman

【问题描述】Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.Example:Input:11 Output:XI问题来源：Integer to Roman【问题解析】

2017-02-27 16:10:59 298

原创三、[LeetCode OJ]Add Two Numbers

【问题描述】You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers

2017-02-25 20:40:26 399

原创二、[LeetCode OJ]Two Sum题解

【问题描述】Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not us

2017-02-25 14:15:18 371

原创一、[LeetCode OJ]3Sum题解

【问题描述】Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set mu

2017-02-25 12:58:58 409

一只不会写程序的程序猿