免费精品视频一区二区三区学生,被3个黑人老外玩的4p,人妻精品无码中文无码一区无,添女人荫蒂全部过

首頁> 美國政府科技報告 >Allocation of Database Files Across Parallel Stores for Efficient Processing of Partial-Match Queries
【24h】

Allocation of Database Files Across Parallel Stores for Efficient Processing of Partial-Match Queries

機譯:跨并行存儲分配數據庫文件以有效處理部分匹配查詢

獲取原文

摘要

This report presents the results of research on the allocation of binary cartesian product database files across several stores (such as disks) which are accessible in parallel so that the average time required to perform the retrieval (by using several parallel accesses) of all buckets specified by a partial-match query is objective of constructing efficient packings of Hamming spheres in hypercubes. The viewpoint of binary cartesian product file allocation thus produced allowed in our research the creation of allocations for two particular sizes of the set of stores such that the average processing time for partial-match queries was smaller than that of the best allocation technique found in the literature for these same two cases. It also provides a framework in which good allocations for other particular sizes of the set of stores, and possibly for general sets of stores, might be found.

著錄項

相似文獻

  • 外文文獻
  • 中文文獻
  • 專利
獲取原文

客服郵箱:kefu@zhangqiaokeyan.com

京公網安備:11010802029741號 ICP備案號:京ICP備15016152號-6 六維聯合信息科技 (北京) 有限公司?版權所有
  • 客服微信

  • 服務號

主站蜘蛛池模板: 运城市| 杨浦区| 普格县| 蓬安县| 满洲里市| 垦利县| 牟定县| 闻喜县| 永年县| 鹤岗市| 芦溪县| 民县| 揭西县| 拉萨市| 鄯善县| 云安县| 如皋市| 玉环县| 涡阳县| 邹平县| 满城县| 邯郸县| 宜川县| 太和县| 垫江县| 紫金县| 许昌县| 当涂县| 合阳县| 隆昌县| 泰来县| 永年县| 信阳市| 洪泽县| 开远市| 汉寿县| 孙吴县| 积石山| 英德市| 手游| 德阳市|