会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Converting Recursive Hierarchical Data to Relational Data
    • 将递归分层数据转换为关系数据
    • US20080172408A1
    • 2008-07-17
    • US12055009
    • 2008-03-25
    • Dikran S. MeliksetianGeorge A. MihailaSriram K. PadmanabhanNianjun Zhou
    • Dikran S. MeliksetianGeorge A. MihailaSriram K. PadmanabhanNianjun Zhou
    • G06F17/30
    • G06F16/86
    • A system and method of converting a recursive XML document into a relational schema comprises providing a recursive XML document; parsing an external mapping script specifying a mapping from the recursive XML document to a relational table format; building a recursive shredding tree based on the external mapping script and the relational table format; and shredding the mapped recursive XML document into a relational table. The system and method further comprise detecting whether any of a XML schema and a DTD document is recursive, wherein the detecting comprises building a directed graph comprising element names; corresponding elements names as nodes in the directed graph; forming arcs from every element parent node to every element child node of the element parent node; and checking for cycles in the directed graph. The system and method further comprise identifying all recursive cursor nodes and a recursive degree corresponding to the recursive shredding tree.
    • 将递归XML文档转换为关系模式的系统和方法包括提供递归XML文档; 解析指定从递归XML文档到关系表格式的映射的外部映射脚本; 基于外部映射脚本和关系表格式构建递归切割树; 并将映射的递归XML文档切割成关系表。 所述系统和方法还包括检测XML模式和DTD文档中的任何一个是递归的,其中所述检测包括构建包括元素名称的有向图; 相应的元素名称作为有向图中的节点; 从每个元素父节点到元素父节点的每个元素子节点形成弧; 并检查有向图中的周期。 该系统和方法还包括识别所有递归光标节点和对应于递归粉碎树的递归度。
    • 9. 发明授权
    • Compressibility estimation of non-unique indexes in a database management system
    • 数据库管理系统中非唯一索引的压缩性估计
    • US07895171B2
    • 2011-02-22
    • US12057055
    • 2008-03-27
    • Bishwaranjan BhattacharjeeLipyeow LimGeorge A. Mihaila
    • Bishwaranjan BhattacharjeeLipyeow LimGeorge A. Mihaila
    • G06F17/30
    • G06F17/30312H03M7/30
    • A method, information processing system, and computer readable storage product estimate a compression factor. A set of key values within an index are analyzed. Each key value is associated with a record identifier (“RID”) list comprising a set of RIDs. The index is in an uncompressed format and includes a total byte length. A number of RIDs associated with each key value is estimated for each key value in the set of key values. A total byte length for all RID deltas between each at least two consecutive RIDs within a RID list is estimated for each RID list based on the number of RIDs that have been determined. The total byte length estimated for each RID list is accumulated. A compression factor associated with the index is determined by dividing the total byte length that has been accumulated by the byte length of the index.
    • 一种方法,信息处理系统和计算机可读存储产品估计压缩因子。 分析索引中的一组关键值。 每个密钥值与包括一组RID的记录标识符(“RID”)列表相关联。 索引为未压缩格式,包括总字节长度。 与密钥值集合中的每个密钥值估计与每个密钥值相关联的多个RID。 基于已经确定的RID的数量,针对每个RID列表估计RID列表内的每个至少两个连续RID之间的所有RID差分的总字节长度。 累积为每个RID列表估计的总字节长度。 通过将累加的总字节长度除以索引的字节长度来确定与索引相关联的压缩因子。