发明名称 Database access using partitioned data areas
摘要 To provide an information processing apparatus, a database system, an information processing method, and a program which ensure efficient database accesses by partitioning. The apparatus includes a partition generating unit (222) which generates a value partition in which a unit subtree including target data to be partitioned is separated and registered according to the target data, and a base partition which includes an index for uniquely identifying the unit subtree, an XML parser (224) which identifies positions of a start tag and an end tag defining an attribute value of the structured document and generates a cutting position list corresponding to the hierarchical structure of the attribute value for registration in a storage area, an XML cutting unit (226) which identifies the start tag position and the end tag position of the unit subtree to be cut, and separates the unit subtree and its index from the structured document, and a cut-XML registration unit which registers the unit subtree and the index in the separate partitions.
申请公布号 US8856183(B2) 申请公布日期 2014.10.07
申请号 US200912613764 申请日期 2009.11.06
申请人 International Business Machines Corporation 发明人 Shinkawa Kaoru;Yoshida Issei
分类号 G06F17/30;G06F15/16 主分类号 G06F17/30
代理机构 Greg Goshorn, P.C. 代理人 Flynn John D.;Goshorn Gregory K.;Greg Goshorn, P.C.
主权项 1. An information processing apparatus, comprising: a processor; a non-transitive storage area; a database, stored in the non-transitive storage area, storing a plurality of stored values having a hierarchical structure, wherein the plurality of stored values represent data stored in a particular field of the database; a partition generating unit, executed on the processor, which generates a value partition, the value partition having a unit subtree, the unit subtree having target data of the plurality of stored values to be partitioned in the structured document separated and registered according to a stored value of the plurality of stored values of the target data, and generates a base partition which includes a second subtree distinct from the unit subtree and an index for uniquely identifying the unit subtree, wherein the unit subtree includes a plurality of the start tags, and the index is generated from a first one of the start tans in the unit subtree; a parser unit, executed on the processor, which identifies positions of a start tag and an end tag, the start tag and the end tag defining a start value and an end value, the start value and the end value each corresponding to a corresponding value of the plurality of stored values in the structured document, to generate a cutting position list corresponding to the hierarchical structure and register the cutting position list in a storage area; a cutting unit, executed on the processor, winch separates the unit subtree and the index for referring to the unit subtree from the structured document by referring to the cutting position list to identify the start tag position and the end tag position of the unit subtree to be cut, the unit subtree including the target data, wherein in order to separate the unit subtree for registration in the value and base partitions by referring to the cutting position list, the cutting unit generates a subtree data list and registers the generated list in the storage area, the subtree data list including a range-defining pair in which a start position and an end position of the unit subtree included in the structured document are associated with each other and an occurrence counter in which the order of description of the unit subtree in the structured document is registered; and a registration unit, executed on the processor, which registers the unit subtree and the index for identifying the unit subtree, separated by the cutting unit, in the value and base partitions, wherein the registration unit adds pointers to the unit subtree and the index for uniquely identifying the unit subtree to allow cross-reference between the unit subtree and the index, before registering the unit subtree and the index in the value and base partitions.
地址 Armonk NY US