Kabushiki Kaisha Toshiba

Sony Corporation

Toshiba Solutions Corporation

Toshiba Digital Solutions Corporation

Masakazu Hattori

Takuya Kanawa

Yasuhiko Kato

Hiroshi Niina

Katsuhiko Nonomura

Masahiro Fujita

Shozo Isobe

Naohiro Yokoo

Yoshitaka Ukita

Yosuke Kuroda

Hiroaki Kitano

Hiroshi Kakuda

Mikito Iwamasa

Naoyasu Hosonuma

Takashi Sasai

Yasuo Namioka

Akihiro Yamaguchi

Koichi Yamagata

Minoru Inata

A page-table size is reduced. A management device manages a data group by dividing the data group into pages. The management device includes a page-processing unit and a data-log-management unit. When update processing is first executed on an update target page in the current-generation, the page-processing unit secures a free space and updates the update target page on the secured free space. The page-processing unit adds, to a data log file of the current-generation, a CPUNDO log indicating a correspondence between a logical address and a physical address in the update target page. The data-log-management unit writes data at starting of the current-generation to a data storage device for the immediately previous operation page. The data-log-management unit adds, to the data log file of the current-generation, a CPREDO log indicating a correspondence between the logical address and the physical address in the immediately previous operation page.

Management device, database system, management method, and computer program product

According to an embodiment, a database system includes a plurality of nodes in which a database is stored; and a management device configured to manage the plurality of nodes. The management device includes a first assigning unit and a second assigning unit. Depending on a change in state of each of the plurality of nodes, the first assigning unit assigns a first node, which stores therein data pieces and receives an access request with respect to the data pieces, and assign a second node, which stores therein the data pieces and serves as a backup node for the first node, and instructs each of the plurality of nodes to perform operations according to assignment. Depending on a state of the plurality of nodes and depending on a change in assignment state of the first node and the second node, the second assigning unit assigns a third node which is a candidate node to serve as the first node or the second node, and instructs each of the plurality of nodes to make preparation for causing the third node to operate as the first node or the second node. Each of the plurality of nodes includes a transferring unit configured to send the data pieces of the first node or the second node to the third node.

Database system, computer program product, and data processing method

According to one embodiment, a calculating device performs at least a calculation for a database system. A database of the database system is split into a plurality of partitions and placed in a plurality of nodes. The device is configured to accept statistical information relating to the plurality of partitions and the plurality of nodes and being collected by the plurality of nodes, and generate fluctuation information by using the statistical information and perturbation information. The perturbation information corresponds to statistical fluctuation of the statistical information. The device is configured to calculate a placement of the plurality of partitions in the plurality of nodes by using the statistical information and the fluctuation information. The placement is capable of improving a performance of the database system.

Calculating device, data base system, calculation system, calculation method, and storage medium

According to an embodiment, a database device includes a volatile first storing unit, a non-volatile second storing unit, an access processing unit configured to execute an operation corresponding to an access request for each of a plurality of blocks obtained by dividing data pieces, a backup processing unit configured to write data of each of the plurality of blocks at a backup time to the second storing unit, and a block management unit. The block management unit writes, under certain conditions, data of any block stored in the first storing unit to the second storing unit, and reads data of a block targeted by an access request from the second storing unit to the first storing unit. The backup processing unit writes data of a block that is not yet written to the second storing unit among the plurality of blocks.

Storage optimization of database in volatile and non-volatile storing unit

According to an embodiment, a database system includes nodes and a management device. The management device includes first and second assigning units. Depending on change in state of each node, the first assigning unit assigns a first node storing data pieces and receiving an access request to the data pieces, and assigns a second node serving as a backup node, and instructs each node to perform operations according to assignment. Depending on state of nodes and change in assignment state, the second assigning unit assigns a third node as a candidate node serving as the first node, and instructs each node to make preparation for causing the third node to operate as the first node. Each node sends, to the third node, a snapshot of the data pieces at the first time point and an operation log according to the access request at and after the first time point.

According to an embodiment, database system includes nodes that communicate with each other to elect one node among the nodes, serving as a management device. The management device includes first and second assigning units. Depending on change in state of each node, the first assigning unit assigns a first node storing data pieces and receiving an access request to the data pieces, and assigns a second node storing the data pieces and serving as a backup node for the first node, and instructs each node to perform operations according to assignment. Depending on the state of nodes and a change in assignment state of the first and second nodes, the second assigning unit assigns a third node as a candidate node to serve as the first or second node, and instructs each node to make preparation for causing the third node to operate as the first or second node.

Database system including a plurality of nodes

According to an embodiment, a structured document management device includes a query data receiving unit; a structural condition dividing unit; a structural condition rewriting unit; and a query execution unit. The query data receiving unit is configured to receive query data for searching a structured document. The structural condition dividing unit is configured to divide the query data into elements including a structural condition. The structural condition rewriting unit is configured to rewrite the structural condition into a rewritten query when a type of the structural condition is other than a descendant structural condition. The rewritten query is predetermined to include a joining process with a descendant structural condition so as not to affect structural conditions appearing before and after the structural condition. The query execution unit is configured to output a search result in response to query data that includes the structural condition and the rewritten query.

Device and method for managing structured document, and computer program product

According to an embodiment, a data compression device includes a receiving unit, generating unit, a selecting unit, and a compressing unit. The receiving receives input data pieces. The generating unit generates starting point candidates representing the data having an error within a threshold value with respect to starting point data input at a first timing. The selecting unit refers to the starting point candidates, end point data input at a second timing, and intermediate data input at a timing in between the first timing and the second timing; and selects the starting point candidate which, as compared to the other candidates, has a greater number of pieces of the intermediate data approximated using the starting point candidate and using the end point data in such a way that the error is within the threshold value. The compressing unit outputs the selected starting point candidate and the end point data.

Data compression device, data compression method, and computer program product

According to an embodiment, a structured document management device includes a parser; a constraint acquiring unit; and a parse tree rewriting unit. The structured document receiving unit is configured to receive an input of a structured document having a layered logical structure. The parser is configured to parse the syntax of received query data to acquire a parse tree in which the query data is decomposed so as to meet a static single assignment form which is defined such that each variable is assigned exactly once. The constraint acquiring unit is configured to acquire a hierarchical condition that the variables of the parse tree need to meet and constraints that include conditions for values of the respective variables. The parse tree rewriting unit is configured to rewrite the query data in such a form that the structured document is refinable by the constraints.

A structured document searching apparatus that stores structured document data each including hierarchized elements stores a data stream in which the elements included in the structured document data are arranged in the order of the syntactic analysis result, and stores while at least one index stream in which the elements included in the structured document data and serving as an index in a structured document data search are arranged in the order of the syntactic analysis. The structured document searching apparatus creates a scanning plan that instructs the scanning of the data stream and the index stream, based on a search criterion for the structured document data search, and executes the scanning of at least either one of the data stream and the index stream instructed by the scanning plan.

Apparatus, method, and computer program product for searching structured document

In a searching apparatus: a first receiving unit receives a search request from a client; based on the search request, a first generating unit generates a distributed search request to request a server to conduct a search and an integration request to integrate search results of the distributed search request; a first transmitting unit transmits the distributed search request to the server; a second transmitting unit transmits identification information of an execution result of the integration request to the client; a second receiving unit receives, from the client, an obtainment request to obtain the execution result identified by the identification information; a receiving unit receives the search results of the distributed search request from the server; an executing unit executes the integration request on the received search results; and a third transmitting unit transmits the execution result of the integration request to the client that transmitted the obtainment request.

Searching apparatus, searching method, and computer program product

According to an embodiment a management apparatus includes: a stream storage configured to store a stream constituted by a plurality of pages; a trace information storage configured to store trace information in each stream, a receiving unit configured to receive a request to write the pages constituting the stream; and a management unit. The management unit refers to the trace information; writes the page into the stream storage when the write rule indicates that the page is to be written in the stream storage; writes the page into the temporary storage when the write rule indicates that the page is to be written in the temporary storage; and writes the page that has been written in the temporary storage into the stream storage in units of extents at a predetermined timing.

Management apparatus for improved database registration and update

A plan combining unit combines a plan including all predicate nodes by increasing a size of a subplan stepwise while selecting the subplan with a low cost using an analysis graph generated by a query analyzing unit and plan combination constraint data extracted by a constraint extracting unit. The analysis graph is the one expressed by a graph including a variable node corresponding to a variable to which an object on a database is bound and a predicate node indicating a condition between the variable nodes. The plan combination constraint data represents a constraint to a plan and a subplan extracted from the analysis graph as a condition between the nodes.

Apparatus, method, and computer program product for processing query

A receiving unit receives a processing request from a client, requesting acquisition of data including a plurality of elements from a database. An acquiring unit acquires first data and data structure information from the database in response to the first processing request. A generating unit replaces a first element with a first identifier and generates a second data including the first identifier and the second elements. A transmitting unit transmits the second data to the client.

Server, data transfer method, and recording medium

In a structure where a table is partitioned into multiple databases according to a certain partitioning method, a coordinator server changes allocation information that is used to determine a database into which each of data records should be registered when an allocation change command is issued. The coordinator server stores therein allocation history information, which is the allocation information used before the change. When an entry request to make an entry of a new data record from a client, a database to enter the new data record is determined based on the stored allocation history information and the changed allocation information, and an entry request is sent to a database server having the determined database.

Growing community of inventors

Kanagawa, Japan

Masakazu Hattori