Abstract: The present invention provides a distributed processing system for a graph query language and a distributed processing method for a query language thereof. The distributed processing system for a graph query language according to the present invention includes: a client configured to receive the graph query language; a server configured to receive the graph query language from the client, transmit information for query processing for the graph query language to a plurality of dispersively disposed data processing apparatuses, and integrate results of the query processings received from the data processing apparatuses to transmit the integrated results to the client; and the plurality of data processing apparatuses configured to receive the information for the query processing from the server to determine whether the query processing may be performed, and transmit the results of the query processings to the server.

Abstract: Provided are data processing apparatus and methods for predicting a pattern frequency thereof. The data processing apparatus includes: a storage unit adapted to store a preset graph pattern, an occurrence frequency of the preset graph pattern, and information on actual data nodes corresponding to each node which belongs to the graph pattern; and a control unit adapted to compare the preset graph pattern with a graph pattern to be searched to perform a graph search, and when the preset graph pattern is not included in the graph to be searched, search for a node shared by two different preset graph patterns which are stored in the storage unit to perform the graph search. By this configuration, it is possible to predict a level of an intermediate result to optimize a graph query and effectively calculate sizes of various graphs patterns while making a capacity of a memory small.

Abstract: The present invention provides a data searching method of database, apparatus and computer program for the same. The data searching apparatus of a database includes: a storage unit configured to store graph data; and a controller configured to store physical location information in which vertex and edge information included in the graph data is stored in the storage unit, and perform a search for the vertex and the edge based on the physical location information. Thereby, it is possible to efficiently search the data by improving a search speed of a graph, minimize the update of the information even when a storage location of the data is changed, and facilitate query by the graph data regardless of types of the database and a storage structure, and efficiently use a storage space.

Abstract: Provided are data processing apparatus and methods for predicting a pattern frequency thereof. The data processing apparatus includes: a storage unit adapted to store a preset graph pattern, an occurrence frequency of the preset graph pattern, and information on actual data nodes corresponding to each node which belongs to the graph pattern; and a control unit adapted to compare the preset graph pattern with a graph pattern to be searched to perform a graph search, and when the preset graph pattern is not included in the graph to be searched, search for a node shared by two different preset graph patterns which are stored in the storage unit to perform the graph search. By this configuration, it is possible to predict a level of an intermediate result to optimize a graph query and effectively calculate sizes of various graphs patterns while making a capacity of a memory small.