Script to calculate average length of an index entry

最新推荐文章于 2025-04-26 13:42:19 发布
原创 最新推荐文章于 2025-04-26 13:42:19 发布 · 145 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

此脚本用于计算特定数据库表中现有索引所占用的磁盘空间大小，包括索引数量和每个索引的大小。
rem *******************************************************
rem
rem NAME: IN_CM_SZ.sql
rem
rem HISTORY:
rem Date Who What
rem --------- ------------------- ----------
rem 01/20/93 Michael Brouillette Creation
rem 09/22/01 Mike Ault Updated to 9i
rem
rem FUNCTION: Compute the space used by an entry for an
rem existing index.
rem
rem NOTES: Currently requires Remote DBA.
rem
rem INPUTS:
rem tname = Name of table.
rem towner = Name of owner of table.
rem iname = Name of index.
rem iowner = Name of owner of index.
rem cfile = Name of output file SQL Script.
rem *******************************************************
COLUMN dum1 NOPRINT
COLUMN isize FORMAT 999,999,999.99
COLUMN rcount FORMAT 999,999,999 NEWLINE
ACCEPT tname PROMPT 'Enter table name: '
ACCEPT towner PROMPT 'Enter table owner name: '
ACCEPT iname PROMPT 'Enter index name: '
ACCEPT iowner PROMPT 'Enter index owner name: '
ACCEPT cfile PROMPT 'Enter name for output SQL file: '
SET PAGESIZE 0 HEADING OFF VERIFY OFF TERMOUT OFF
SET feedback OFF TRIMSPOOL ON SQLBL OFF
SET SQLCASE UPPER NEWPAGE 3
SPOOL &cfile..sql
SELECT -1 dum1,
'SELECT ''Index '||'&iowner..&iname'||' on table '
FROM dual
UNION
SELECT 0,
'&towner..&tname'||' has '',
nvl(COUNT(*),0) rcount,'' entries of '', ('
FROM dual
UNION
SELECT column_id,
'SUM(NVL(vsize('||column_name||'),0)) + 1 +'
FROM Remote DBA_tab_columns
WHERE table_name = '&tname'
AND owner = upper('&towner') AND column_name IN
(SELECT column_name FROM Remote DBA_ind_columns
WHERE table_name = upper('&tname')
AND table_owner = upper('&towner')
AND index_name = upper('&iname')
AND index_owner = upper('&iowner'))
AND column_id <> (select max(column_id)
FROM Remote DBA_tab_columns
WHERE table_name = upper('&tname')
AND owner = upper('&towner')
AND column_name IN
(SELECT column_name FROM Remote DBA_ind_columns
WHERE table_name = upper('&tname')
AND table_owner = upper('&towner')
AND index_name = upper('&iname')
AND index_owner = upper('&iowner')))
UNION
See code depot for full script
SELECT column_id,
'SUM(NVL(vsize('||column_name||'),0)) + 1)'
FROM Remote DBA_tab_columns
WHERE table_name = upper('&tname') AND owner = upper('&towner')
AND column_name IN
(SELECT column_name FROM Remote DBA_ind_columns
WHERE table_name = upper('&tname')
AND table_owner = upper('&towner')
AND index_name = upper('&iname')
AND index_owner = upper('&iowner'))
AND column_id = (SELECT MAX(column_id)
FROM Remote DBA_tab_columns
WHERE table_name = upper('&tname')
AND owner = upper('&towner')
AND column_name IN
(SELECT column_name FROM Remote DBA_ind_columns
WHERE table_name = upper('&tname')
AND table_owner = upper('&towner')
AND index_name = upper('&iname')
AND index_owner = upper('&iowner')))
UNION
SELECT 997,
'/ COUNT(*) + 11 isize, '' bytes each.''' from dual
UNION
SELECT 999, 'FROM &towner..&tname.;' FROM dual;
SPOOL OFF
SET TERMOUT ON feedback 15 PAGESIZE 20 SQLCASE MIXED
SET NEWPAGE 1
START &cfile
CLEAR columns
UNDEF tname
UNDEF towner
UNDEF iname
UNDEF iowner
UNDEF cfile
[代码大模型]MHPP: Exploring the Capabilities and Limitations of Language Models Beyond Basic Code Generat
强化学习曾小健
06-23 1240
近年来，大型语言模型（LLMs）的进步在代码生成方面大大提高了性能，尤其是在功能级别。例如，GPT-4在HumanEval上的通过率为88.4%。然而，这引发了质疑现有基准在全面评估功能级别代码生成能力方面的充分性。我们的研究分析了两个常见的基准，HumanEval和MBPP，并发现，由于质量、难度和粒度等方面的限制，这些基准可能无法充分评估LLMs的代码生成能力。
Integration of SWAP and MODFLOW-2000 for modeling groundwater dynamicsin shallow water table areas
weixin_44259522的博客
05-14 1157
通过包气带的地下水补给和蒸发蒸腾（通过直接蒸发和通过毛细上升吸收作物根系而排放）对于地下水的可持续利用以及控制地下水位较浅的干旱和半干旱地区的盐度和水涝具有重要意义（Lerner et al.，1990；盐度在不同程度上影响了世界上至少20%的耕地和40%以上的灌溉土地（Rhoades和Loveday，1990），尤其是在中国北部（Xu et al.，2010）和澳大利亚西南部（Petheram et al.，2003）等干旱和半干旱地区。
The answers to the exercises of python in the platform of CodeStepByStep(update week13)
追梦的博客
10-31 5146
《python 高级程序设计 》 课程目录Page hierarchy一、Inclass exercises1.Week7_InClass1.expressions_number22.expressions_exam13.expressions_exam24.expressions_exam55.compute_pay6.define_grade_variable7.first_second8.first_second29.
搜索引擎中的倒排索引(inverted index)机制
GarfieldEr007的专栏
01-08 3553
Abstract This chapter presents a survey of the various structures (techniques) that can be used in building inverted files, and gives the details for producing an inverted file using sorted arrays.
linux bound shell,Linux Load Average
weixin_33189820的博客
05-14 380
Linux Load AverageNot Your Average Average1Dr. Neil J. GuntherPerformance Dynamics Company SMCastro Valley, California, USAwww.perfdynamics.comOriginally presented Sep 4, 2002Updated by NJG Feb 21, 20...
Architecture of the Solana Validator
chengbin20101的博客
07-27 1027
Architecture of the Solana ValidatorClustersOverviewOverview of a Solana ClusterCreating a Cluster​Joining a Cluster​Sending Transactions to a Cluster​Confirming Transactions​Solana ClustersAvailable Solana ClustersDevnetTestnetMainnet BetaBenchmark a Clus
Glossary of Expressions in Payments industry
热门推荐
Abtswiath丶
12-08 2万+
0-9 | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z 0-9 3-D SECURE Protocol for Cardholder authentication in e-Commerce A AAC Application Authentication Cryptogram ABF Application Blocked Flag AC Appl
【Introduction to Artificial Intelligence and Data Analytics】（TBC）
m0_66706847的博客
09-13 901
Introduction to Artificial Intelligence and Data Analytics 笔记。
新冠时空分析——Global evidence of expressed sentiment alterations during the COVID-19 pandemic
weixin_37996254的博客
07-04 6227
Title: Global evidence of expressed sentiment alterations during the COVID-19 pandemic 新冠病毒大流行期间情绪表达变化的全球证据
tsm9_Momentum_Ultimate Oscillators_MACDivergence index_Stochastic RSI_A/D Oscillator_RVI Vigor ADX
Linli522362242的专栏
05-14 2207
tsm9_Momentum_Ultimate Oscillators_MACDivergence index_Stochastic RSI_A/D Oscillator_RVI Vigor ADX
The Anatomy of a Large-Scale Hypertextual Web Search Engine
12-22 1279
The Anatomy of a Large-Scale Hypertextual Web Search Engine The Anatomy of a Search EngineThe Anatomy of a Large-Scale Hypertextual W...
【运维】掌控全局：用 Python 和 psutil 全方位透视你的系统性能
一个被知识诅咒的人
04-26 893
系统管理员和开发者经常需要监控服务器或个人电脑的性能，以便及时发现瓶颈、优化资源利用率，甚至预测潜在问题。Python 的 `psutil` 库提供了一个强大、跨平台的方式来获取各种系统指标，如 CPU 使用率、内存占用、磁盘 I/O、网络流量等。本文将深入探讨 `psutil` 的功能，结合大量代码示例（包括详细的中文注释）和 LaTeX 数学公式，展示如何利用它构建全面的系统监控工具。您将学会如何收集、处理和展示性能数据，最终实现对系统健康状况的全面掌控。本文的目标是让您能够构建自己的定制化监控解决方案
def reward_shaping(_obs, _extra_info, act, agent): """ 包括：等待时间、队列长度、旅行距离、通行效率 """ junction_ids = list(agent.preprocess.junction_dict.keys()) # 初始化奖励字典 rewards = {j_id: {'total': 0, 'components': {}} for j_id in junction_ids} frame_state = _obs["framestate"] vehicles = frame_state["vehicles"] frame_time = frame_state["frame_time"] # 更新交通信息 agent.preprocess.update_traffic_info(_obs, _extra_info) # 计算每个路口的奖励分量 for j_id in junction_ids: # 1. 等待时间变化奖励 current_waiting_time = agent.preprocess.get_all_junction_waiting_time(vehicles).get(j_id, 0) waiting_delta = agent.preprocess.old_waiting_time[j_id] - current_waiting_time waiting_reward = (waiting_delta + 1000.0) / 1000.0 agent.preprocess.old_waiting_time[j_id] = current_waiting_time rewards[j_id]['components']['waiting'] = waiting_reward # 2. 队列长度奖励 queue_length = calculate_queue_length(j_id, agent.preprocess) queue_reward = -np.tanh(queue_length / 10) # 队列越长，惩罚越大 rewards[j_id]['components']['queue'] = queue_reward # 3. 旅行距离奖励 travel_reward = calculate_travel_reward(j_id, agent.preprocess) rewards[j_id]['components']['travel'] = travel_reward # 4. 通行效率奖励 throughput_reward = calculate_throughput(j_id, frame_time, agent.preprocess) rewards[j_id]['components']['throughput'] = throughput_reward # 组合奖励（可调整权重） weights = { 'waiting': 0.4, 'queue': 0.3, 'travel': 0.2, 'throughput': 0.1 } rewards[j_id]['total'] = sum( weights[k] * rewards[j_id]['components'][k] for k in weights ) # 假设系统需要为每个路口返回两个奖励值（相位和时长） return tuple( rewards[j_id]['total'] for j_id in sorted(junction_ids) for _ in range(2) # 为每个路口生成两个相同的奖励值 ) def calculate_queue_length(junction_id, feature_process): """计算路口进口道的总排队车辆数""" junction = feature_process.junction_dict[junction_id] total_queue = 0 # 遍历所有进口车道 for direction in junction.get("enter_lanes_on_directions", []): for lane_id in direction.get("lanes", []): # 统计该车道上的车辆数 total_queue += len(feature_process.lane_volume.get(lane_id, [])) return total_queue # 辅助函数：计算旅行距离奖励 def calculate_travel_reward(junction_id, feature_process): """计算车辆在路口进口道的平均旅行效率""" total_distance = 0 vehicle_count = 0 # 遍历所有车辆 for v_id, distance in feature_process.vehicle_distance_store.items(): # 只考虑当前路口的车辆 if v_id in feature_process.vehicle_prev_junction: if feature_process.vehicle_prev_junction[v_id] == junction_id: total_distance += distance vehicle_count += 1 if vehicle_count == 0: return 0 avg_distance = total_distance / vehicle_count # 旅行距离越长，奖励越高（表示通行顺畅） return np.tanh(avg_distance / 50) # 归一化处理 # 辅助函数：计算通行效率 def calculate_throughput(junction_id, current_time, feature_process): """计算单位时间通过路口的车辆数""" time_window = 30 # 统计最近30秒的通行量 vehicles_passed = 0 # 遍历所有车辆 for v_id, enter_time in feature_process.enter_lane_time.items(): # 只考虑当前路口的车辆 if v_id in feature_process.vehicle_prev_junction: if feature_process.vehicle_prev_junction[v_id] == junction_id: # 检查车辆是否已通过路口 if v_id not in feature_process.waiting_time_store: # 车辆已离开进口道 if current_time - enter_time < time_window: vehicles_passed += 1 # 计算单位时间通行量 throughput = vehicles_passed / (time_window / 60) # 转换为车辆/分钟 return np.tanh(throughput / 20) # 归一化处理 检查此奖励函数还有没有可以优化的地方并且适配以下特征处理 class FeatureProcess: """ Update traffic information and perform feature processing """ """ 更新交通信息并进行特征处理 """ def __init__(self, logger): self.logger = logger self.reset() def reset(self): # Store road structure and other relatively fixed dictionary-type variables # 存储道路结构等相对固定的字典型变量 self.junction_dict = {} self.edge_dict = {} self.lane_dict = {} self.l_id_to_index = {} self.vehicle_configs_dict = {} # Store dictionary-type variables for dynamic traffic information in traffic scenarios, # and update data after each communication # 存储交通场景中动态交通信息的字典型变量, 在每次通信后进行数据更新 self.vehicle_prev_junction = {} self.vehicle_prev_position = {} self.vehicle_distance_store = {} self.last_waiting_moment = {} self.waiting_time_store = {} self.enter_lane_time = {} # Stores variables that can be used to calculate rewards # 存储可用于计算奖励的变量 self.lane_volume = {} # User-defined variable # 用户自定义变量 self.old_waiting_time = {} self.enter_lane_count = 26 def init_road_info(self, start_info): """ Obtain fixed variables such as road structure """ """ 获取道路结构等信息固定的变量 """ junctions, signals, edges = ( start_info["junctions"], start_info["signals"], start_info["edges"], ) lane_configs, vehicle_configs = ( start_info["lane_configs"], start_info["vehicle_configs"], ) # Store road structure information in various variables # 将道路结构信息存储到各个变量 for junction in junctions: self.junction_dict[junction["j_id"]] = junction self.l_id_to_index[junction["j_id"]] = {} self.old_waiting_time[junction["j_id"]] = 0 index = 0 for approaching_edges in junction["enter_lanes_on_directions"]: for lane in approaching_edges["lanes"]: self.l_id_to_index[junction["j_id"]][lane] = index index += 1 for edge in edges: self.edge_dict[edge["e_id"]] = edge for lane in lane_configs: self.lane_dict[lane["l_id"]] = lane for vehicle_config in vehicle_configs: self.vehicle_configs_dict[vehicle_config["v_config_id"]] = vehicle_config for lane in lane_configs: self.lane_volume[lane["l_id"]] = [] def update_traffic_info(self, obs, extra_info): """ Update vehicle history information and calculate various dynamic traffic variables """ """ 更新车辆历史信息, 计算各项动态交通变量 """ frame_state = obs["framestate"] frame_no = frame_state["frame_no"] frame_time, vehicles = frame_state["frame_time"], frame_state["vehicles"] if frame_no <= 1: # Initial frame loads road structure information # 初始帧载入道路结构信息 game_info = extra_info["gameinfo"] self.init_road_info(game_info) for vehicle in vehicles: # If the vehicle appears for the first time, initialize the vehicle's historical intersection information # 如果车辆第一次出现，则初始化车辆的历史交叉口信息 if vehicle["v_id"] not in self.vehicle_prev_junction: self.vehicle_prev_junction[vehicle["v_id"]] = vehicle["junction"] # For vehicles that appear for the first time, if they are on the lane, record their appearance time # 对于首次出现的车辆, 若在车道上则记录其出现时间 if ( self.vehicle_prev_junction[vehicle["v_id"]] == -1 and on_enter_lane(vehicle) and vehicle["v_id"] not in self.enter_lane_time ): self.enter_lane_time[vehicle["v_id"]] = frame_time # When a vehicle enters another entrance lane from the intersection, recalculate its appearance time # 当车辆从交叉口驶入另一进口车道时, 重新统计其出现时间 elif self.vehicle_prev_junction[vehicle["v_id"]] != vehicle["junction"]: if self.vehicle_prev_junction[vehicle["v_id"]] != -1 and on_enter_lane(vehicle): self.enter_lane_time[vehicle["v_id"]] = frame_time self.cal_waiting_time(frame_time, vehicle) self.cal_travel_distance(vehicle) self.cal_v_num_in_lane(vehicle) def cal_waiting_time(self, frame_time, vehicle): """ Calculate the waiting time of the vehicle. When the vehicle is on the enter lane, count the accumulated time when its speed is <= 0.1m/s as its waiting time when driving at the intersection """ """ 计算车辆等待时间, 当车辆处于进口车道上时, 统计其车速<=0.1m/s的累计时长作为其在该交叉口行驶时的等待时间 """ waiting_time = 0 # Determine whether the vehicle in the lane approaching the intersection is in a waiting state, # and calculate the waiting time # 对处于车道驶向交叉口的车辆判断是否处于等待状态, 计算等待时间 if on_enter_lane(vehicle): # Determine whether the vehicle is in a waiting state. # The determination condition is that the vehicle speed is <= 0.1m/s # 判断车辆是否处于等待状态, 判定条件为车辆速度<=0.1m/s if vehicle["speed"] <= 0.1: if vehicle["v_id"] not in self.last_waiting_moment: # Record the starting moment of each time the vehicle enters the waiting state # 记录车辆在每次进入等待状态的起始时刻 self.last_waiting_moment[vehicle["v_id"]] = frame_time # When the vehicle is in the waiting state for the first time, # initialize its accumulated waiting time # 车辆首次处于等待状态则初始化车辆累计等待时间 if vehicle["v_id"] not in self.waiting_time_store: self.waiting_time_store[vehicle["v_id"]] = 0 else: # When a vehicle enters the waiting state on a lane, # waiting_time records the duration of the current waiting state # 车辆在一条道路上进入等待状态, waiting_time记录本次等待状态已持续的时间 waiting_time = frame_time - self.last_waiting_moment[vehicle["v_id"]] self.waiting_time_store[vehicle["v_id"]] += waiting_time self.last_waiting_moment[vehicle["v_id"]] = frame_time else: if vehicle["v_id"] in self.last_waiting_moment: del self.last_waiting_moment[vehicle["v_id"]] else: # Prevent repeated del when the vehicle is generated for the first time or at an intersection, # v_id is not stored in self.waiting_time_store # 防止车辆首次生成或位于交叉口时反复del, v_id未储存在self.waiting_time_store内 if vehicle["v_id"] in self.waiting_time_store: del self.waiting_time_store[vehicle["v_id"]] if vehicle["v_id"] in self.last_waiting_moment: del self.last_waiting_moment[vehicle["v_id"]] def cal_travel_distance(self, vehicle): """ Calculate the travel distance. When the vehicle is on the enter lane, count the total distance it travels at the intersection """ """ 计算旅行路程, 当车辆处于进口车道上时, 统计其在该交叉口行驶时的总路程 """ # When the vehicle is on the lane, calculate the cumulative distance # 当车辆处于车道上时, 计算累计路程 if on_enter_lane(vehicle): # When the vehicle enters the lane from inside the intersection for the second or subsequent time, # clear the cumulative distance and prepare to calculate the distance of this entry into the inlane # 车辆非首次从交叉口内部驶入车道时, 清空累计路程, 准备计算此次进入进口车道的路程 if self.vehicle_prev_junction[vehicle["v_id"]] != -1 and vehicle["v_id"] in self.vehicle_distance_store: del self.vehicle_distance_store[vehicle["v_id"]] if vehicle["v_id"] not in self.vehicle_distance_store: self.vehicle_distance_store[vehicle["v_id"]] = 0 self.vehicle_prev_position[vehicle["v_id"]] = [ vehicle["position_in_lane"]["x"], vehicle["position_in_lane"]["y"], ] else: if vehicle["v_id"] in self.vehicle_distance_store and vehicle["v_id"] in self.vehicle_prev_position: try: # Calculate Euclidean distance # 计算欧氏距离 self.vehicle_distance_store[vehicle["v_id"]] += math.sqrt( math.pow( vehicle["position_in_lane"]["x"] - self.vehicle_prev_position[vehicle["v_id"]][0], 2, ) + math.pow( vehicle["position_in_lane"]["y"] - self.vehicle_prev_position[vehicle["v_id"]][1], 2, ) ) except Exception: raise ValueError # Update the vehicle's historical position after each distance calculation # 每次计算距离后更新车辆历史位置 self.vehicle_prev_position[vehicle["v_id"]] = [ vehicle["position_in_lane"]["x"], vehicle["position_in_lane"]["y"], ] else: # When the vehicle enters the intersection, # delete the historical location information to avoid calculating the driving distance # based on the last departure position when entering the lane next time # 当车辆驶入交叉口, 删除历史位置信息, 避免下次进入车道时按上一次离开路口位置计算行驶距离 if vehicle["v_id"] in self.vehicle_prev_position: del self.vehicle_prev_position[vehicle["v_id"]] def cal_v_num_in_lane(self, vehicle): """ Calculate the number of vehicles on the lane. When a vehicle is in the import lane, the number of vehicles on the enter lane increases """ """ 计算车道上的车辆数, 当车辆处于进口车道上时, 则该进口车道上车辆数增加 """ # Update the number of vehicles on each lane # 更新每条车道上的车辆数量 if on_enter_lane(vehicle): if vehicle["v_id"] not in self.lane_volume[vehicle["lane"]]: self.lane_volume[vehicle["lane"]].append(vehicle["v_id"]) # Update the vehicle's historical intersection information # 更新车辆的历史所在交叉口信息 self.vehicle_prev_junction[vehicle["v_id"]] = vehicle["junction"] def get_all_junction_waiting_time(self, vehicles: list): """ This function obtain a dict of waiting_time by junction Args: - vehicles (list): input list of Vehicle - vehicle_waiting_time (list): input key = v_id (uint32), value = vehicle_waiting_time (list) Returns: - dict: key = vehicle.junction (uint32), value = junction waiting time """ """ 此函数获取交叉口车辆等待时间的字典 参数: - vehicles (list): 车辆的输入列表 - vehicle_waiting_time (list): input key = v_id (uint32), value = vehicle_waiting_time (list) 返回: - dict: key = vehicle.junction (uint32), value = junction waiting time """ res = {} v_num = {} for junction_id in self.junction_dict: res[junction_id] = 0 v_num[junction_id] = 0 for vehicle in vehicles: if vehicle["junction"] != -1 or vehicle["target_junction"] == -1: continue if vehicle["v_id"] in self.waiting_time_store: t = self.waiting_time_store[vehicle["v_id"]] else: t = 0 res[vehicle["target_junction"]] += t v_num[vehicle["target_junction"]] += 1 # Calculate the average waiting time of all vehicles in the scene # 计算场景内所有车辆的平均等待时间 for junction_id in self.junction_dict: if v_num[junction_id] != 0: res[junction_id] /= v_num[junction_id] return res
最新发布
08-12
queue_length = calculate_queue_length(j_id, agent.preprocess, vehicles) queue_reward = -np.tanh(queue_length / 10) # 队列越长，惩罚越大 rewards[j_id]['components']['queue'] = queue_reward # 计算...
当在PL_SQL中执行SELECT … INTO …语句时，如果返回结果集为空，则回触发NO_DATA_FOUND错误。但是当 SELECT 中有字段用到函数时...
iteye_13320的博客
07-07 827
当在PL_SQL中执行SELECT … INTO …语句时，如果返回结果集为空，则回触发NO_DATA_FOUND错误。但是当 SELECT 中有字段用到函数时，即使结果集为空，也不会触发NO_DATA_FOUND错误。 这里就涉及到有一条记录但是记录是空记录和没有一条记录的问题了。 首先弄清楚no data found异常是在找不到一条记录的时候报的异常，但是在找到一条空记录的时候是...
关于Oracle ORA-01555快照过旧的错误
iteye_13320的博客
05-25 726
http://www.hellodba.com/reader.php?ID=170&lang=cn http://tech.it168.com/a2009/0519/368/000000368275.shtml 关于Oracle ORA-01555快照过旧的错误 首先了解Oracle在什么情况下会产生ORA-01555错误: 假设有一张6000万行数据的testdb表，预计testd...
清除oracle共享池和数据缓冲区
iteye_13320的博客
05-24 486
清除shared_pool,就是清理共享sql语句。 清除shared_pool,就是清理共享sql语句。 alter system flush shared_pool; 想要准确地测试sql语句的执行时间，也就是语句的每次执行都和第一次执行时处于基本相同的测试环境。 彻底清空数据缓冲区语句应该这样写 alter session set events 'immediate...
EXECUTE IMMEDIATE dbms_stats.gather_table_stats
iteye_13320的博客
08-10 441
EXECUTE IMMEDIATE 'BEGIN dbms_stats.gather_table_stats(''SETTLEMENT'',''T_INVESTORPOSITION''); END; ';
attrib 设置文件属性
iteye_13320的博客
02-09 286
attrib 设置文件属性 是一个DOS命令，在DOS或Windows的DOS窗口可以用； +s 表示加test文件为系统文件； +h 表示加test文件为隐藏文件； 详细如下： 〔适用场合〕 想对文件做较特殊的处理时 〔用 法〕 attrib 显示所有文件的属性 attrib +r或-r [文件名] 设置文件属性是否为只读 attrib +h或-h [文件...
检查表空间当前剩余空间
iteye_13320的博客
08-29 203
检查当前剩余空间 SELECT F.TABLESPACE_NAME, (T.TOTAL_SPACE - F.FREE_SPACE) "USED (MB)", F.FREE_SPACE "FREE (MB)", T.TOTAL_SPACE "TOTAL (MB)", (ROUND((F.FREE_SPACE / T.TOTAL_SPA...
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
表情包 代码片
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值