WO2015170770A1 - 情報処理装置、情報処理方法およびプログラム - Google Patents
情報処理装置、情報処理方法およびプログラム Download PDFInfo
- Publication number
- WO2015170770A1 WO2015170770A1 PCT/JP2015/063390 JP2015063390W WO2015170770A1 WO 2015170770 A1 WO2015170770 A1 WO 2015170770A1 JP 2015063390 W JP2015063390 W JP 2015063390W WO 2015170770 A1 WO2015170770 A1 WO 2015170770A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- expression
- factor
- term
- target information
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/288—Entity relationship models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24553—Query execution of query operations
- G06F16/24558—Binary matching operations
- G06F16/2456—Join operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
Definitions
- the present invention relates to an information processing apparatus, an information processing method, and a program.
- a data structure handled by a computer for example, a tabular structure of a relational database, an object of an object-oriented database, a frame or rule of a knowledge database, and the like are known.
- the conventionally proposed database has a problem in terms of flexibility to change that a new structure cannot be added to a predefined data structure. For example, when a new attribute is added to a table after the operation of a relational database is started, the existing data structure and modification of the application program for processing the data structure are accompanied. It was a burden on users, administrators or application program developers. Further, in the conventional relational database, it is impossible to describe information hierarchically, for example, to further define a table in one attribute of one table. On the other hand, in an object-oriented database or frame, a so-called parent-child relationship can be defined for the relationship between objects or the relationship between frames, but conversely, there is a request for simply processing the relationship between attributes and attribute values. In some cases, it was unsuitable.
- the present applicant uses a new data structure that describes information and the data structure in order for the information processing device to handle information on things, organizations, people, etc. handled by the user, or concepts handled by the user.
- a procedure for processing stored information was proposed (see Patent Documents 1 to 4).
- information is expressed by a formula expression, for example, a sum of identifier and identifier, a product of identifier and identifier, a sum of product of identifier and identifier, and the like.
- the proposed technique described above is suitable for sequential access because information to be processed is described continuously in text format.
- the technology according to the present application aims to divide information to be processed under a predetermined condition in the information processing technology described in the data structure proposed by the applicants.
- An information processing apparatus combines an identifier formed by a symbol and a factor including one or more identifiers to form a sequence of factors having an order, and one or more factors.
- the target information described using the sum operator which forms the expression which is the combination of the term is combined.
- the information processing apparatus for at least one of the division unit that divides the target information into a plurality of terms at a predetermined position and the factor included in the term after the division, the appearance order of the terms in the target information and the relevant terms
- a transmission unit that adds the position information including the appearance order of the factor to be held in any of the plurality of server devices for each divided item.
- the target information described in the above data structure can be divided in a recoverable format, and can be distributed and stored in a plurality of server devices.
- the target information is nested as an order factor constituent operator that maintains the order and relates the combination of terms, or an expression partitioned by the set factor constituent operator that relates the combination of terms without maintaining the order.
- the predetermined position may be the target information at any of the places partitioned by the sum operator outside the expression partitioned by the order factor constituent operator. Specifically, in this way, the order to be held in the above data structure can be divided in a recoverable format.
- a combining unit that receives each divided term from a plurality of server devices and generates target information by combining the terms in ascending order of appearance of the terms and in ascending order of appearance of the factors based on the position information. May be further included. According to such a combining unit, the divided target information can be restored.
- the position expressions that are held by the server devices may be divided at positions specified by the user.
- the position expressions that are held by the server devices each have a predetermined subset of the divided subsets.
- the position expression expression held by each server device may be divided for each term that commonly includes a predetermined factor connected by a product operator. Good.
- a method for executing the above means by an information processing apparatus or a program for causing a computer to execute the above means may be provided.
- the program may be provided by being recorded on a computer-readable recording medium.
- a computer-readable recording medium refers to a recording medium that stores information by electrical, magnetic, optical, mechanical, or chemical action and can be read by a computer.
- those removable from the computer include, for example, optical disks, magneto-optical disks, flexible disks, magnetic tapes, memory cards, and the like.
- As recording media fixed to the computer there are HDD (Hard Disk Drive), SSD (Solid State Drive), ROM (Read Only Memory) and the like.
- information to be processed can be divided under a predetermined condition.
- the information processing apparatus handles information on things, organizations, people, and the like.
- the information expressed in a format that can be processed by the information processing apparatus according to the present embodiment is referred to as “target information”.
- target information The information expressed in a format that can be processed by the information processing apparatus according to the present embodiment.
- a data structure for describing the target information and a procedure for processing the target information described in the data structure will be described.
- the data structure is a structure for describing target information.
- the target information is generated, stored, read, updated (also referred to as “calculation”), deleted, and the like by an information processing device including a processor and a storage device.
- FIG. 1 is a diagram illustrating an example of an expression.
- the expression includes one or more identifiers (also referred to as basic elements) that are the minimum units of the constituent elements.
- the identifier according to the present embodiment is not necessarily information that can uniquely identify data.
- the formula is described using predetermined symbols. An operator and a separator are used as the predetermined symbol. Specifically, the sum operator “+”, the product operator “ ⁇ (may be omitted as in FIG.
- the first parenthesis corresponds to the set factor constituent operator (also referred to as a combination part delimiter) of the present invention.
- the second parenthesis corresponds to the order factor constructing operator (also referred to as a permutation part delimiter) of the present invention.
- the identifier is the minimum unit that constitutes the target information and is expressed by a symbol.
- Symbols are character strings such as alphanumeric characters and special characters (however, a sum operator “+”, a product operator “ ⁇ ”, a first parenthesis “(” and “)”, and a second parenthesis “ ⁇ ” And “ ⁇ ”).
- ⁇ is an identifier indicating a value of zero, a value that does not change the operation result in the sum operator, or an empty set. In the present embodiment, ⁇ is also called “zero element”. Further, ⁇ is a value 1 or a value that does not change the operation result in the product operator. In the present embodiment, ⁇ is referred to as a “unit element”. Note that ⁇ may be referred to as a unit element for the sum operation, but in the present embodiment, ⁇ is referred to as a zero element.
- a portion (or the whole) described by an identifier and a predetermined symbol is called a “factor”.
- the part described by the product of the factors is called “term”.
- the part described by the sum of terms is an expression.
- the expression includes one or more terms connected by a sum operator.
- a term also includes one or more factors connected by a product operator.
- factors may be written as nested formulas. It should be noted that “a”, “b1”, “c1”, etc. in FIG. 1 are identifiers and correspond to the minimum unit constituting the target information.
- an expression expressing the target information is generated based on the following rules (a) to (d).
- the identifier, unit element, and zero element are all expression expressions (expressions).
- r + s is also an expression expression.
- r ⁇ s is also an expression expression.
- r ⁇ s is stronger in r ⁇ s than r + s.
- D When r is an expression, (r) and ⁇ r ⁇ are also expressions.
- the target information expressed by the expression can be expressed at a plurality of levels with different abstraction levels.
- the expression level of the target information can be changed.
- the plurality of levels are, for example, a set level where the abstraction level of the target information is most highly expressed, a topology space level where the abstraction level of the target information is lower than the set level, and the target information is expressed as a subset element,
- the level of abstraction of the target information is lower than that of the topology space level, and the level of abstraction of the target information is lower than that of the adhesive space level.
- Cell space level expressed with attributes are, for example, a set level where the abstraction level of the target information is most highly expressed, a topology space level where the abstraction level of the target information is lower than the set level, and the target information is expressed as a subset element.
- Set information Set information is defined as a combination of terms or a sum of terms.
- each term is defined as a product of an identifier that is a set ID (corresponding to the first identification factor of the present invention) and an identifier that is a value, that is, a set ID ⁇ value.
- the value may be a product of a plurality of identifiers.
- the expression expression of the set information is typically as follows. (Example) Set ID ⁇ value 1 + set ID ⁇ value 2+...
- the set information can be said to be an unordered combination of terms.
- the positional relationship between the factors constituting the term is maintained.
- the factor 1 included in the terms 1 and 2 corresponds to the set ID.
- Such a function for maintaining the positional relationship between factors is extremely effective when expressing things or concepts on a computer.
- a commutative law does not hold for a modification relationship that describes a thing or a concept.
- “kodama desk” has a different meaning from “desk kodama”.
- a modification relationship can be simplified and described.
- a set of things or a set of concepts can be described, and a simple database can be constructed.
- the factors constituting the terms have significance as so-called positional parameters.
- the first factor of the term is the fruit whose set ID
- the second factor indicates the shape
- the third factor indicates the color
- the fourth factor indicates the name.
- the relationship between the attribute and the attribute value can be processed at the set level by using the position of each factor with a semantic restriction.
- attributes of things can be freely defined by factors in which such order is maintained.
- topology space information is described by the product of the identifier that is the topology ID and the sum of the subsets. That is, topology ID ⁇ (subset sum).
- the subset is expressed by a product of a subset ID for identifying the subset and the sum of terms included in the subset. That is, subset ID ⁇ (sum of terms).
- the term may further include a sum of terms combined with the first parenthesis “()” or the second parenthesis “ ⁇ ”, or a product of these.
- the factor 2 of the term 2 corresponds to the topology ID.
- the factor “1” and the factor “2” included in the factor 3 of the term 2 correspond to the subset ID.
- topology space information is shown below (in the example below, the punctuation mark “,” is not a constituent element of the formula, but an example break).
- T ⁇ (ABC ⁇ (ab1 + ac2 + bc3) + A ⁇ (ab1 + ac2) + B ⁇ (ab1 + bc3) + C (ac2 + bc3)), Fruit x (all species x (apple + banana + tangerine) + red x apple + yellow x (banana + tangerine)), fruit x (all species x (apple + banana + tangerine) + round x (apple + tangerine) + elongate X Banana), Vegetable x (all species x (radish + cucumber + burdock) + thick x radish + fine x (cucumber + burdock)), company x (employee x (employee 1 + employee 2 + employee 3 + employee
- Company x (employee x (employee 1 + employee 2 + employee 3 + employee 4 + employee 5) + sales x (employee 1 + employee 2) + accounting x (employee 3 + employee 4) + general affairs x employee 5)
- the bonding space information is configured by associating two subsets X and Y included in the topology space information with the subsets included in the respective portions.
- the relationship generated by this association is called an equivalence relationship.
- topology space information T topology ID is Tid
- topology space information U topology ID is Uid
- Tid ⁇ sum of subsets belonging to T
- Uid ⁇ U
- the sum of the subsets belonging to T subset T0 + subset T ⁇ T0 and two subsets.
- the factor p of the topology space information T that correlates the topology space information T and the topology space information U and the factor q of the topology space information U are designated.
- the topology space information T is separated into a subset T0 including the factor p and a subset T-T0 not including the factor p.
- T ⁇ T0 is a difference set obtained by deleting the set T0 from the set T.
- the topology space information U is separated into a subset U0 including the factor q (corresponding to the second related term of the present invention) and a subset U-U0 not including the factor q.
- U ⁇ U0 is a difference set obtained by deleting the set U0 from the set U.
- topology space information T and U The sum of the two pieces of topology space information T and U is expressed as follows.
- a quotient when a subset including a specific factor p is extracted from the set, this is called a quotient.
- a subset excluding the quotient is called a remainder.
- the following bonding space information can be configured by associating the subset T0 and the subset U0. That is, the adhesion space information in this case is ⁇ the left factor of p in the subset T0 + the left factor of q in the subset U0 ⁇ ⁇ p + q ⁇ ⁇ the right factor of p in the subset T0 + the q factor in the subset U0.
- both the left factor of p in the subset T0 and the right factor of p in the subset T0 correspond to the first adherent factor of the present invention.
- the left factor of q in the subset U0 and the right factor of q in the subset U0 both correspond to the second adherent factor of the present invention.
- Adhesive space information can also be defined for set information at the set level. Also, the bonding space information can be defined for one level of information and other levels of the topology space, cell space, and collective space.
- the association between the slenderness, which is the factor of the fruit topology space information, and the factor, which is a subset of the vegetable topology space information, is specified and is in an equivalence relation.
- the two pieces of topology space information are separated into a quotient and a remainder as follows.
- the topology space information in which each set information is separated into a quotient and a remainder is fruit ⁇ elong ⁇ banana + fruit ⁇ (all species ⁇ (apple + banana + mandarin) + round ⁇ (apple + mandarin)) + vegetable ⁇ Fine x (cucumber + burdock) + vegetable x (all species x (radish + cucumber + burdock) + thick x radish).
- the adhesion space information is ⁇ fruit + vegetable ⁇ ⁇ ⁇ longer + thin ⁇ ⁇ banana + (cucumber + burdock) ⁇ + Fruit x (all species x (apple + banana + tangerine) + circle x (apple + tangerine)) + vegetable x (all species x (radish + cucumber + burdock) + thick x radish).
- the adhesion space information is combined based on the factors having the equivalence relation designated for the relationship while maintaining the structure of the two topology space information. If an equivalence relation is recognized between “thin” and “thin” from the bonding space information, the right factors “banana” and “(cucumber + burdock)” can be correlated and output as ⁇ banana + (cucumber + burdock) ⁇ .
- first slip ID (A ⁇ + B + C ⁇ C1 + C2 ⁇ + D + E ⁇ E1 + E2 ⁇ (a ⁇ + b + c ⁇ c1 + c2 ⁇ + d + e ⁇ e1 + e2 ⁇ + position (upper right + lower right))) + second slip ID (A ⁇ + B + C ⁇ C1 + C2 ⁇ + D + E ⁇ E1 + E2 ⁇ (a ⁇ + b + c ⁇ c1 + c2 ⁇ + d + e ⁇ e1 + e2 ⁇ )) + MEMO (1 (that) +2 (ABC)) +
- MEMO (1 (that) +2 (ABC)
- a quotient space is created with the factor “1” of the MEMO information and the factor “upper right” of the information of the first slip.
- Slip ID first sheet (A ⁇ + B + C ⁇ C1 + C2 ⁇ + D + E ⁇ E1 + E2 ⁇ (a ⁇ + b + c ⁇ c1 + c2 ⁇ + d + e ⁇ e1 + e2 ⁇ + position (lower right))) + slip ID first sheet ⁇ position (upper right) + slip ID2 sheets
- Eye A ⁇ + B + C ⁇ C1 + C2 ⁇ + D + E ⁇ E1 + E2 ⁇ (a ⁇ + b + c ⁇ c1 + c2 ⁇ + d + e ⁇ e1 + e2 ⁇ )) + MEMO (2 (ABC)) + MEMO (1 (that)) +.
- the bond information is information including a subset of ⁇ slip ID first sheet ⁇ position + MEMO ⁇ ⁇ upper right + 1 ⁇ ⁇ + (some) ⁇ + remainder. , Configured as.
- the bonding information can be stored by combining the two pieces of object information with the structure before bonding for the two pieces of object information having no common structure.
- Cell space information is information having attributes related to things, organizations, people, etc., or attributes of concepts handled by people, and attribute values corresponding to those attributes. Attributes are divided into key attributes and other attributes.
- a key attribute is an attribute whose information can be identified by an attribute value, and corresponds to a value that can be used as a key in a database search.
- an attribute value (or a column obtained by combining a plurality of attribute values) is called an instance.
- An instance corresponds to a record stored in a conventional database table. Each instance has identification information called an instance ID.
- the key attributes or other attributes are in the form of factors whose order is maintained by the second brackets “ ⁇ ” and “ ⁇ ”. Described. That is, the attribute and its corresponding attribute value are described in a so-called vector format.
- the cell space information includes a cell space ID (corresponding to the cell space identifier of the present invention), a factor of a key attribute, a factor having an attribute other than the unit element and the key attribute, and a factor having a set of instances.
- the cell space information is composed of cell space ID ⁇ (key attribute ⁇ ⁇ + (sum of other attributes) ⁇ ⁇ (sum of instance ID ⁇ ⁇ + (sum of values) ⁇ ))).
- the factor of the key attribute and the factor having an attribute other than the unit element and the key attribute correspond to the attribute factor of the present invention.
- the attribute made up of such identifiers corresponds to the attribute sequence of the present invention. To do.
- the attribute enclosed by the second parenthesis corresponds to the attribute order factor of the present invention.
- cell space information can be shown as follows.
- Fruit id ⁇ (name ⁇ + shape + color ⁇ (apple ⁇ + circle + red ⁇ + mandarin ⁇ + circle + yellow ⁇ + banana ⁇ + elong + yellow ⁇ )) + vegetable id ⁇ (name ⁇ + shape + color ⁇ ( Radish ⁇ + thick + white ⁇ + cucumber ⁇ + thin + green ⁇ + burdock ⁇ + thin + brown ⁇ ))
- vegetable id ⁇ name ⁇ + shape + color ⁇ ( Radish ⁇ + thick + white ⁇ + cucumber ⁇ + thin + green ⁇ + burdock ⁇ + thin + brown ⁇ )
- information that is described as a fruit table and a vegetable table in the conventional relational model is described by a formula expression.
- this example contains two cell space information (fruit and vegetable), it is also called integrated cell space information.
- a processing example of this integrated cell space information is shown. First, a subset (referred to as a quotient) of instances having an attribute “shape” having a value of “elongated” and a subset (referred to as a remainder) of other instances among the instances of fruit are created. First, among the vegetable instances, the attribute “shape” is separated into an instance (referred to as a quotient) having a value of “fine” and another instance (referred to as a remainder). In this case, the combined cell space information is as follows.
- FIG. 2 shows a first data structure example of the cell space information according to the first embodiment.
- the target information expressed in the table format as the conventional normalized table structure can be stored in the storage device in the state of the expression format 1.
- A is a key attribute (for example, employee number)
- B, C, D, E, etc. are other attributes (for example, name, gender, year of entry, department, etc.).
- FIG. 3 shows a second data structure example of the cell space information according to the first embodiment.
- the target information expressed as a conventional tree structure can be stored in the storage device in the expression format 2 or 3.
- the tree structure as a part of the directed graph can be handled.
- a is, for example, an animal
- b is a mammal
- c is a fish
- d is a human
- e is a whale
- f is a tuna
- g is a salmon
- b (mammals) and c (fishes) inherit the attributes of a (animal), such as eating and breathing.
- the common attribute of b (mammals) and c (fish) is defined as a (animal).
- a knowledge base such as a frame or an object-oriented database can be described and stored in the storage device by the expression of the present embodiment.
- the information processing apparatus can receive input of information relating to things corresponding thereto, generate corresponding information, store the information in a storage device, and read and output part or all of the information.
- target information expressed in an inverted tree structure can be stored in the storage device as in the expression format 3.
- Inverse tree information can be applied when composing more complex information from basic information.
- a is a CPU
- b is an interface
- c is a drive unit of an external storage device
- d is a CPU board
- e is an external storage device
- f is a personal computer. is there.
- the inverted tree structure can be managed by assembling more complex information from basic information such as product design documents and business process control charts. Therefore, product design information, business processes, and the like can be described by the expression of the present embodiment.
- FIG. 4 shows a third data structure example according to the first embodiment.
- the non-normalized table structure and target information having no attribute can also be held in the state of the expression format 4.
- the non-normalized table structure and the target information without attributes can be exemplified by target information indicating a slip and target information corresponding to a sticky note added to the target information as shown in FIG.
- ID or id identifies the target information to be stored.
- the target information includes identifiers A to E2, a to e2, first parentheses () and second parentheses ⁇ having different coupling strengths at the time of calculation, and factors ⁇ C1 + C2 ⁇ , ⁇ E1 + E2 ⁇ and the like, a term E ⁇ ⁇ E1 + E2 ⁇ etc. expressed by the product of these factors, and an expression expressed by the sum of the terms.
- the term is also referred to as an element.
- the unit element ⁇ is a symbol processed as 1 when a predetermined process is executed.
- the stored target information is generated according to the input slip data by executing a predetermined program, stored in the storage device, separated into subsets, and other subsets. Will be glued or searched.
- a first slip indicated by slip ID1, a second slip indicated by slip ID2, and a memo indicated by MEMO are illustrated as instances.
- the configuration of items may be different between the first slip and the second and subsequent slips.
- the information processing apparatus 100 can individually assign attributes to the identifiers or terms constituting the target information, different identifiers or terms having different attribute sequences can be freely stored, searched, and changed.
- the attribute and the attribute value can be freely added, changed, and deleted even during operation as a database. Therefore, according to the present embodiment, the structure of data to be handled can be flexibly changed without performing strict and detailed file design.
- the position expression is an expression format including position information indicating the position of the identifier in the expression.
- the position information is also called absolute position information.
- a combination of terms is composed of one or both of an identifier, a product operator that combines multiple identifiers as a sequence of factors with an order, and a plurality of identifiers combined as a sequence of identifiers and factors. Information described by the sum operator can be exemplified. Therefore, the position of the identifier, that is, the position expression can be described by the position of the term including each identifier in the expression expression and the position of the factor including each identifier in the term.
- a position expression can also be called object information in the meaning of the object of processing according to the present embodiment.
- the first embodiment exemplifies an expression format in which position information indicating the position of the identifier is added to the left side of the identifier. However, the position information may be added to the right side of the identifier.
- the position information in the position expression is defined as ⁇ term position ⁇ factor position>. Therefore, in this embodiment, the position expression takes the form of ⁇ term position ⁇ factor position> identifier.
- the expression A + B + C including the identifiers A, B, and C is ⁇ 1 ⁇ 1> A + ⁇ 2 ⁇ 1> B + ⁇ 3 ⁇ 1> C in the position expression. That is, ⁇ 1 ⁇ 1> A indicates that the identifier corresponding to the first factor of the first term is A. ⁇ 2 ⁇ 1> B indicates that the identifier corresponding to the first factor of the second term is B.
- an expression expression A + A ⁇ B + A ⁇ B ⁇ C including identifiers A, B, and C is expressed as ⁇ 1 ⁇ 1> A + ⁇ 2 ⁇ 1> A + ⁇ 2 ⁇ 2> B + ⁇ 3 ⁇ 1> in the position expression.
- the identifier Z that is the j-th factor in the i-th term in the expression is ⁇ i Xj> Z.
- the position expression of the whole expression expression including a plurality of terms is obtained by separating the position expression of each identifier by a delimiter such as plus (+).
- ⁇ and “>” are delimiters for explanation, and it is not necessary to enclose them with “ ⁇ ” and “>” on the computer.
- a character & indicating a position expression may be introduced and described as & term position ⁇ factor position.
- the symbol between “position ⁇ factor” need not be “x”.
- an underbar “_” may be used.
- other delimiters such as a symbol indicating another point, a comma (,), a colon (:), semicolon (;), space, tab, etc.
- the identifier B is in the second factor in the first term.
- the second factor is surrounded by the first parentheses “(” and “)”. Therefore, the position expression of the identifier B first includes (1 ⁇ 2).
- the identifier B is the first factor of the first term in parentheses in the second factor. Therefore, the position representation of the identifier B is (1 ⁇ 2) ⁇ 1 ⁇ 1> B.
- the identifier C is the first factor of the second term in the second factor of the first term. Therefore, the position expression of the identifier C is (1 ⁇ 2) ⁇ 2 ⁇ 1> C. Furthermore, in the formula expression of the above example, the identifier D is in the second factor of the second term in the second factor of the first term. Therefore, first, (1 ⁇ 2) (2 ⁇ 2) is specified as the position information of the identifier D. Further, the identifier D is the first factor of the first term in parentheses in the second factor of the second term in the second factor in the first term. Therefore, the position expression of the identifier D is finally (1 ⁇ 2) (2 ⁇ 2) ⁇ 1 ⁇ 1> D.
- the identifier Z when the identifier Z is in a factor surrounded by (), information indicating the position of the term including the identifier Z and information indicating the position of the factor in the term are ( i * j) is used.
- (I ⁇ j) indicates that it is in the j-th factor in the i-th term and the j-th factor is a factor (set factor) surrounded by the first parentheses.
- the position expression of the expression expression as in the above example includes the information indicating the presence of the first parenthesis (i ⁇ j), the position of the term that does not include the () type factor such as ⁇ k ⁇ l>, and the factor It is described by a combination of information indicating the position.
- FIG. 5 shows an example in which the relation between the position expression obtained from the expression and the identifier is stored in a database table.
- the position expression is indicated by absolute position information.
- FIG. 5 describes the relationship between the position expression obtained from the expression expression of the above example and the identifier in a table.
- the first factor of the first term is A
- the first term in the second factor of the first term is B
- the second factor of the first term is B
- the first factor of the second term in the factor of C is a C
- the second term in the second factor of the second factor of the first term is D
- the relationship with identifiers can be stored in tabular form.
- ⁇ 2 ⁇ 1> is excluded from the position expression (1 ⁇ 2) ⁇ 2 ⁇ 1>, and the position expression (1 ⁇ 2) is searched.
- an identifier related to the identifier C can be acquired.
- the term including the factor C can be acquired by acquiring a value corresponding to the attribute including the position expression (1 ⁇ 2) (i ⁇ j).
- i and j are arbitrary integers.
- Such a position expression (1 ⁇ 2) (i ⁇ j) is described as (1 ⁇ 2) * in the first embodiment.
- the expression expression can be converted into data in an existing database. Therefore, the expression expression can be processed by using a function such as an existing database management system.
- the expression expression is an expression expression including the second parentheses “ ⁇ ” and “ ⁇ ”, the corresponding position expression is generated in the same manner as the expression expression including the first parentheses “(” and “)”. can do.
- the expression A ⁇ (B + C ⁇ ⁇ D + E ⁇ ) + F ⁇ ⁇ G + H ⁇ is converted into a position expression, it is as follows.
- the term factor includes a hierarchical expression expressed by the combination of the first parenthesis and the second parenthesis. Can uniquely describe the position of the identifier in the expression.
- each of the absolute position information enclosed in parentheses is multiplied by the infix notation of the appearance rank in the expression including the identifier and the occurrence rank in the term including the identifier of the factor including the identifier. It can be said that they are connected by operators.
- the absolute position information ⁇ 1 ⁇ 1> associated with the value “A” is the first of the expressions A ⁇ (B + C ⁇ ⁇ D + E ⁇ ) + F ⁇ ⁇ G + H ⁇ .
- the first factor A in the term A ⁇ (B + C ⁇ ⁇ D + E ⁇ ) is shown.
- the product of a plurality of parentheses in the absolute position information represents a nested hierarchical structure in the expression expression.
- the first parenthesis (1 ⁇ 2) of the absolute position information associated with the value “B” is expressed by the formula A ⁇ (B + C ⁇ ⁇ D + E ⁇ ) + F ⁇ ⁇ G + H ⁇
- the second factor (B + C ⁇ ⁇ D + E ⁇ ) in the first term A ⁇ (B + C ⁇ ⁇ D + E ⁇ ) is shown.
- the second parenthesis ⁇ 1 ⁇ 1> indicates the first factor B in the first term B in the formula (B + C ⁇ ⁇ D + E ⁇ ). In the present embodiment, it is expressed that the lower the hierarchy or the hierarchy is, the more parentheses are used.
- the first parentheses “(” and “)” indicate a hierarchy divided by the first parentheses in the expression.
- the second parentheses “ ⁇ ” and “ ⁇ ” indicate a hierarchy partitioned by the second parentheses in the expression.
- information described by the expression can be expressed in a format to which information that can uniquely identify the position of each identifier is added.
- the expression in the expression expression and the position expression expression can be converted into each other.
- position information may be added to the expression included in the expression.
- position information is added to at least one of the factors included in each term for all the terms included in the expression (a subset of the expression).
- the expression A * (B + C * (D + E)) + F * (G + H) includes two terms A * (B + C * (D + E)) and F * (G + H).
- the initial expression is ⁇ 1 ⁇ 1> A ⁇ (B + C ⁇ (D + E)) + ⁇ 2 ⁇ 1> F ⁇ (G + H) It can be expressed by the following position expression.
- the position expression is divided into two parts ⁇ 1 ⁇ 1> A ⁇ (B + C ⁇ (D + E)) and ⁇ 2 ⁇ 1> F ⁇ (G + H), or a part after division based on position information Can be restored to the original position expression.
- a part of the expression expressed by the sum operator can be divided into a subset (part of the expression expressed by parentheses) at an arbitrary position.
- the expression A + B + C can be expressed as A + (B + C) or (A + B) + C.
- FIG. 6 is a configuration diagram illustrating an example of a system according to the present embodiment.
- the system 1 in FIG. 6 includes an information processing apparatus 100 that controls processing according to the present embodiment, and a server apparatus 200 that executes the processing according to the present embodiment in a distributed manner (in the example of FIG. 6, 200a, 200b, 200c,. ⁇ ⁇ ). Further, the information processing apparatus 100 and the server apparatus 200 are communicably connected via the network 300.
- one information processing apparatus 100 is described as centrally managing the other server apparatuses 200, but an apparatus group that performs distributed control may be configured.
- any device when any device receives a request for processing, the data is divided and distributed to other devices and the own device, or the data held by the device and the data held by the other device are combined. (Also called “restoration”) and output the combined result.
- FIG. 7 is a block diagram illustrating an example of the configuration of the information processing apparatus 100 according to the first embodiment (also referred to as Example 1).
- an information processing apparatus 100 according to the first embodiment includes an input unit 11 such as a keyboard and a pointing device for inputting target information, and a memory 12 for storing the input target information (in the present invention).
- the CPU 13 that processes the target information based on a predetermined program
- the output unit 14 such as a display that outputs the input target information and the processed target information
- an interface 16 for connecting the CPU 13 and the output means 14 to each other.
- the interface 15 is a serial interface such as USB (Universal Serial Bus).
- the interface 16 is, for example, an output interface for RGB (red, green, blue) image signals and a synchronous clock.
- the information processing apparatus 100 may be connected to an external storage device, a removable storage medium driving device, a communication unit, and the like via an interface.
- the external storage device is, for example, a hard disk drive, SSD (Solid State Drive) or the like.
- the removable storage medium is, for example, a CD (Compact Disc), a DVD (Digital Versatile Disk), a Blu-ray disc, a flash memory card, or the like.
- the communication unit is a device that accesses a network and communicates with other information processing devices, such as a NIC (Network Interface Card).
- the information processing apparatus 100 is typically a computer such as a personal computer or a server.
- the information processing apparatus 100 is not limited to such a computer, and includes, for example, a portable information terminal, a mobile phone, a PHS (Personal Handyphone System), a digital TV, a digital TV tuner or a set top box, and a hard disk. It can be realized as a television recording device, a vehicle-mounted terminal, and the like.
- the memory 12 includes a volatile DRAM (Dynamic Random Access Memory), a nonvolatile EPROM (Erasable Programmable Read Only Memory), an EEPROM (Electronically Erasable and Programmable Read Only Memory), a flash memory, and the like.
- the function of the information processing apparatus 100 is realized by the CPU 13 executing a program.
- This program is installed in the memory 12 or an external storage device (not shown).
- the program is installed from a network or a removable storage medium through a communication interface. Therefore, this program is distributed through a network or a removable storage medium.
- each level is expressed as a set level 122 where the level of abstraction of the target information is the highest, and a level of abstraction of the target information lower than that of the set level 122, and the target information includes a subset as an element.
- the topology space level 123 to be expressed, the level of abstraction of the target information expressed lower than the topology space level, the bonding space level 124 to which the target information is bonded at the topology space level, and the topology space level 123 This is exemplified by the cell space level 125 in which the target information is expressed with a predetermined attribute.
- the target information expressed at each level can also be expressed as a position expression formula with position information added.
- FIG. 8 is a block diagram illustrating an example of the configuration of the server apparatus 200 according to the first embodiment.
- the server device 200 is also a general computer device like the information processing device 100.
- the server apparatus 200 according to the first embodiment includes an input means 21 such as a keyboard and a pointing device for inputting target information, and a memory 22 for storing the input target information (the memory of the present invention).
- the CPU 23 and the input means 21 the CPU 23 that processes the target information based on a predetermined program
- the output means 24 such as a display that outputs the input target information and the target information after processing
- an interface 26 for connecting between the CPU 23 and the output means 24.
- the interface 25 is a serial interface such as USB.
- the interface 26 is, for example, an output interface for RGB image signals and a synchronous clock.
- the server device 200 may be connected to an external storage device, a removable storage medium drive device, a communication unit, and the like via an interface.
- the external storage device is, for example, a hard disk drive, SSD, or the like.
- the removable storage medium is, for example, a CD, DVD, Blu-ray disc, flash memory card, or the like.
- the communication unit is a device that accesses a network and communicates with another information processing device, such as a NIC.
- the server device 200 is not limited to a computer.
- a portable information terminal a mobile phone, a PHS, a digital television, a digital television tuner or a set-top box, a television recording device including a hard disk, and a vehicle-mounted device. It can be realized as a terminal or the like.
- the memory 22 includes volatile DRAM, nonvolatile EPROM, EEPROM, flash memory, and the like.
- the function of the server device 200 is realized by the CPU 23 executing a program.
- This program is installed in the memory 22 or an external storage device (not shown).
- the program is installed from a network or a removable storage medium through a communication interface. Therefore, this program is distributed through a network or a removable storage medium.
- the target information (formula) 221 stored in the memory 22 or an external storage device (not shown) is added with position information, and includes a key (Key) 222 and a value (Value) 223 KVS (Key Value).
- KVS is an example of a specific implementation means, and other formats may be used.
- position information may be held in a key
- a factor may be held in a value
- a factor common to a key may be held
- another factor combined with the common factor and a product operator may be included in the value. You may make it hold
- FIG. 9 is a process flow diagram illustrating an example of the target information division storage process executed by the information processing apparatus 100.
- the information processing apparatus 100 executes a computer program that is loaded in the memory 12 so as to be executable, and executes the process of FIG. In the process of FIG. 9, it is assumed that the target information is held in an expression form.
- the information processing apparatus 100 reads an expression that is target information into the memory 12 (FIG. 9: D1).
- some target information having a different data structure (formula structure) is handled for each country.
- the following expression is read out.
- Germany (Formula 1) + France (Formula 2) + Japan (Formula 3) + Germany (Formula 4) + France (Formula 5) + Japan (Formula 6) + Germany (Formula 7) + France (Formula 8) + Japan ( Formula 9) + ...
- Formula 1, Formula 2, and so on are formula expressions according to the present embodiment, respectively. That is, it may include a sum operator, a product operator, an order factor constituent operator, a set factor constituent operator, and the like. The structure of each expression is different for each country name connected by the product operator.
- the information processing apparatus 100 divides the target information at a predetermined position and adds position information (D2). Since the target information is a character string, it can be divided at any position, but in this embodiment, it is divided between terms in the expression. Between terms is a place connected by a sum operator in the expression.
- the expression expression includes a plurality of expressions in a nested manner, but in a location higher than the hierarchy partitioned by the second parenthesis (order factor constituent operator) in this embodiment (outside of the expression partitioned by parentheses) Shall be divided by. In other words, no division is performed within the second bracket.
- the terms included in the hierarchy demarcated by the second parenthesis may not be consistent unless they are handled while maintaining the order.
- the specific division position may be designated by the user.
- the user designates one of the locations connected with “+” in the expression. And it divides
- the division position may be determined based on the data size so that the divided subset is within a predetermined capacity.
- the amount of data from the beginning is calculated and divided between terms existing immediately before exceeding a predetermined threshold.
- each term may be divided into terms that commonly include predetermined factors connected by a product operator in each term.
- the target information can be divided based on the meaning and characteristics of the information. Referring to the above-described example of the expression expression, factors such as “Germany”, “France”, and “Japan”, which are country names, are combined by a product operator in each term. Thus, for example, if each term is divided into terms that share a factor connected to the left side by a product operator, the target information is divided into the following three subsets.
- the information processing apparatus 100 distributes and stores the divided subset of the target information in the server apparatus 200 (D3).
- data is distributed to a plurality of server devices 200 based on a predetermined rule, and transmitted via a network.
- each server device 200 that has acquired data stores the data in a storage device.
- the two server apparatuses 200 hold data in the KVS format as shown in FIGS. 10A and 10B, respectively.
- position information is stored in the key and an expression is associated with the value.
- the three server devices 200 each hold data in the KVS format as shown in FIGS. 11A to 11C.
- position information is stored in the key and an expression is associated with the value.
- the three server apparatuses 200 each hold data in the KVS format as shown in FIGS. 12A to 12C.
- a common factor is stored in the key, and a position expression combined with the common factor and the product operator is stored in the value in association with each other.
- the target information described by the expression can be distributed and arranged in the plurality of server devices 200 by the division processing as described above. Moreover, if position information is added to at least one factor included in each of the divided terms as in the above-described division examples 1 to 3, the terms are combined into the original equation by combining the terms based on the position information. Can be returned. At this time, processing is possible even if each term includes an expression having a different structure. As shown in FIGS. 10A to 12C, the division is performed at any position outside the expression surrounded by the order factor constituent operators and connected by the sum operator. That is, the contents of the target information such as Expression 1, Expression 2, Expression 3,... Therefore, parallel processing can be performed on the divided data. Note that availability may be improved by holding the same information redundantly in a plurality of server devices 200.
- a subset of the target information generated by the above-described division processing can be returned to the original target information based on the position information. Specifically, based on the position information added to any factor of each term, they are combined in ascending order of the value indicating the appearance order of the term and in ascending order of the appearance order of the factor.
- FIG. 13 shows a processing example of the application program that executes the combination processing. It is assumed that the position expression generated by the division process is held in the KVS format of FIGS. 10A and 10B, FIGS. 11A to 11C, or FIGS. 12A to 12C in the plurality of server apparatuses 200.
- the information processing apparatus 100 accepts an execution instruction for the joining process from the user (FIG. 13: C1). Further, the information processing apparatus 100 acquires a subset of the target information that is distributed and stored in the plurality of server apparatuses 200 from each server apparatus 200 (C2).
- the information processing apparatus 100 combines the acquired results (C3). Since the position information is added to the information acquired from the server device 200, the original information is obtained by combining the items in ascending order of the values indicating the order of appearance of the terms and in the order of the appearance order of the factors based on the position information. Target information can be generated. According to the present embodiment, since the information processing apparatus 100 can simply combine the results processed by the server apparatuses 200, the overall processing speed can be improved by increasing the number of server apparatuses.
- the information processing apparatus 100 outputs the combined result (C4).
- the target information described as a position expression including position information may be output, or the position information may be deleted and target information described as an expression expressed. This completes the combining process.
- the division processing according to the present embodiment can handle various data as target information.
- BOM Bills of Materials
- equipment and industrial products provided in a building such as a building can be converted into a formula expression and handled.
- the BOM is described in a different format for each manufacturer.
- a building or industrial product that is a finished product includes a plurality of components.
- Data whose schemas are not unified can be combined as they are, or can be divided for each building, construction company, or equipment manufacturer based on a factor indicating a building, construction company, or equipment manufacturer, for example.
- processed food ingredients may be used as target information.
- Food items have different transaction data items at each stage from production to retail.
- the distribution flow may change, such as changing a wholesaler or adding a quality inspection step.
- data whose schemas are not unified can be integrated and handled. Further, according to the above distributed processing, the processing performance can be improved.
- real estate lot numbers may be used as target information.
- Land numbers may be changed or division names may be changed due to division (division) by land readjustment or integration (combination).
- Such data can be handled as a directed graph (DAG: Directed Acyclic Graph) without a cycle by using a pointer, for example.
- DAG Directed Acyclic Graph
- connection relationships of human connections human resource friendship relationships
- relationships between customer requirements and requirement definitions in software development and chemical atom connection relationships in the chemical field.
- processing performance can be further improved.
- the process which converts each data into a formula expression and a position expression can be defined for every specific data.
- FIG. 14 is a diagram for explaining integration and restoration (division) of a plurality of pieces of target information.
- Formulas 1 to 3, Formulas 4 to 6, and Formulas 7 to 9 are registered in a DB (Database) in Germany, a DB in France, and a DB in Japan, respectively.
- DB Database
- FIGS. 2 to 4 target information having a data structure as shown in FIGS. 2 to 4 is described by an expression and registered in each DB.
- Each DB is stored in, for example, three server devices not shown.
- Each DB may have a different schema for each country, for example.
- three pieces of target information are integrated.
- a term in which a factor representing a country name and a factor describing an expression registered in the DB of the country are connected by a product operator is formed, and three DB terms are connected by a sum operator.
- Expressions are registered in the integrated DB.
- the integrated expression may be held in a KVS format with a factor representing the country name as a key and an expression connected to the country name by a product operator as a value. Position information may be added.
- the factor representing the country name is information for specifying the DB before integration.
- three pieces of target information are restored (divided).
- the division is performed based on, for example, a leftmost factor connected by a product operator in each term or a factor including one identifier connected by a product operator in each term. And it divides
- target information managed by a plurality of server devices can be integrated to perform various processing on the integrated data, and the original target information can be restored.
- the plurality of pieces of target information may not have a unified schema.
- the symbols indicating the formula expression and the symbols indicating the position expression described in the embodiment are examples. Therefore, for example, other symbols may be used instead of the sum operator, product operator, set factor constituent operator, and order factor constituent operator. Further, instead of the position expression ⁇ i ⁇ j> (i ⁇ j) ⁇ i ⁇ j ⁇ , other symbols may be used.
- the application target of the expression expression and the position expression expression described in the embodiment is not limited to KVS.
- a system suitable for distributed processing can be constructed by holding the position information and the identifier in the KVS format.
- the application is not limited to the process of acquiring the related information method related to the identifier included in the expression expression.
- the functions of the information processing apparatus 100 and the server apparatus 200 shown in the embodiment exemplify a new database data structure and a data processing procedure that have not been proposed so far. Therefore, the technology of the embodiment can be applied to processing on a computer such as information on things, organizations, people, etc. handled by the user, or concepts handled by the user.
- processing on a computer for example, information on things, organizations, people, etc., or concepts are described as information on a computer, stored in a main storage device such as a memory, an external storage device such as a hard disk, and a database It can be applied to general technology for building, extracting, updating, and managing stored information. That is, the information processing apparatus 100 and the server apparatus 200 according to the embodiment exemplify new information expression technology on a computer.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
データ構造とは、対象情報を記述するための構造をいう。なお、対象情報は、プロセッサと記憶装置とを備える情報処理装置によって、生成、記憶、読み出し、更新(「演算」とも呼ぶ)、削除等される。
情報処理装置は、対象情報を式の形式で保持する。本実施形態に係る式を用いた表現方法を、「式表現」とも呼ぶ。図1は、式の一例を示す図である。式は、構成要素の最小単位である識別子(基本要素とも呼ぶ)を1つ以上含む。本実施形態に係る識別子は、データを一意に特定できる情報とは限らない。さらに、式は、所定の記号を用いて記述される。所定の記号には、演算子と区切記号とが用いられる。具体的には、和演算子“+”、積演算子“×(図1のように省略してもよい)”、第1の括弧(丸括弧)“(”及び“)”、並びに第2の括弧(波括弧)“{”及び“}”が用いられる。第1の括弧が本発明の集合因子構成演算子(組合せ部区切記号とも呼ぶ)に相当する。また、第2の括弧が本発明の順序因子構成演算子(順列部区切記号とも呼ぶ)に相当する。
(a)識別子、単位元及び零元はいずれも式表現(式)である。
(b)rとsとが共に式表現である場合、r+sも式表現である。
(c)rとsとが共に式表現である場合、r×sも式表現である。このとき、演算の結合強さは、一般的な代数と同様に、r×sの方が、r+sよりも強い。
(d)rが式表現である場合、(r)、{r}も式表現である。
本実施形態において、式表現r、s、tは、次の代数の性質(a)~(f)を有する。
(a)結合律
r+(s+t)=(r+s)+t;
r×(s×t)=(r×s)×t;
(b)可換律
r+s=s+r;
なお、本実施形態の式表現では、積演算子の可換律は成立しない。したがって、積演算子で複数の因子が結合されている場合に、個々の因子位置が情報(あるいは意味)を持つ。すなわち、因子は、いわゆる位置を指定してされた位置パラメータとしての機能を有する。「積演算子の可換律は成立しない」ことは、本発明の積演算子が「順序を持つ因子の列として複数の識別子を結合する」ことに相当する。
(c)積演算の単位元
r×ε=ε×r=r;
(d)積演算、和演算の零元
r×Φ=Φ×r=Φ;
r+Φ=r;
(e)分配律
r×(s+t)=r×s+r×t;
(r+s)×t=r×t+s×t;
(f){r+s}×{t+u}={r×t+s×u};
集合情報は、項の組み合わせ、又は項の和として定義される。ここで、それぞれの項は集合ID(本発明の第1の識別因子に相当)となる識別子と値となる識別子の積、すなわち、集合ID×値として定義される。ただし、値は、複数の識別子の積であってもよい。集合の情報の式表現は、典型的には次のようになる。
(例)
集合ID×値1+集合ID×値2+・・・
(例)
果物×任意形状×任意色×バナナ+果物×任意形状×任意色×りんご+果物×細長×黄色×バナナ+果物×丸×赤×リンゴ
この場合、項の第1因子は、集合IDである果物であり、第2因子は形状を示し、第3因子は色を示し、第4因子は名称を示す。このように、それぞれの因子の位置に意味上の制限を加えて使用することで、属性と属性値との関係を集合レベルでも処理できる。集合情報は、このような順序が維持された因子によって事物の属性を自在に定義することができる。
(例)
A×a1+A×a2+A×a3、b1×B+b2×B×B、果物×リンゴ+果物×バナナ+果物×ミカン、野菜×キャベツ+野菜×キュウリ+野菜×ゴボウ、社員×A+社員×B+社員×C
すなわち、集合情報は、集合IDで識別される集合に所属する項の組み合わせを記述する。上述の例において、社員Cが退職した場合、「社員×C」が和演算子とともに削除される。さらに、社員D及び社員Eが入社した場合には、「社員×D+社員×E」がさらに和演算子で接続される。
トポロジー空間情報は、トポロジーIDとなる識別子と部分集合の和との積によって記述される。すなわち、トポロジーID×(部分集合の和)である。ここで、部分集合は、部分集合を識別する部分集合IDと、その部分集合に含まれる項の和との積で表現される。すなわち、部分集合ID×(項の和)である。ただし、項には、さらに項の和を第1の括弧“()”、若しくは第2の括弧”{}”で組み合わせたもの、又はこれらの積が含まれてもよい。図1の例では、例えば、項2の因子2がトポロジーIDに相当する。また、項2の因子3に含まれる因子「1」、因子「2」が部分集合IDに相当する。
(例)
T×(ABC×(ab1+ac2+bc3)+A×(ab1+ac2)+B×(ab1+bc3)+C(ac2+bc3))、
果物×(全種×(リンゴ+バナナ+ミカン)+赤×リンゴ+黄×(バナナ+ミカン))、果物×(全種×(リンゴ+バナナ+ミカン)+丸×(リンゴ+ミカン)+細長×バナナ)、
野菜×(全種×(大根+キュウリ+ゴボウ)+太×大根+細×(キュウリ+ゴボウ))、会社×(社員×(社員1+社員2+社員3+社員4)+営業×(社員1+社員2)+経理×(社員3+社員4))、
この場合に、最後(5番目)の例について、例えば、総務が新設され、社員5が採用され、且つ総務に配属された場合には、次のように更新される。
(例)
会社×(社員×(社員1+社員2+社員3+社員4+社員5)+営業×(社員1+社員2)+経理×(社員3+社員4)+総務×社員5)
接着空間情報は、トポロジー空間情報に含まれる2つの部分集合Xと部分集合Yに対して、それぞれの部分に含まれる部分集合を関係付けることで構成される。本実施形態では、この関係付けによって発生する関係を同値関係という。
(例)
トポロジー空間情報Tid×(部分集合T0)+トポロジー空間情報Tid×(部分集合T-T0)+トポロジー空間情報Uid×(部分集合U0)+トポロジー空間情報Uid×(部分集合U-U0)
このように、集合から特定の因子pを含む部分集合を取り出した場合に、これを商と呼ぶ。また、その商を除く部分集合を剰余と呼ぶ。
(例)
果物×(全種×(リンゴ+バナナ+ミカン)+丸×(リンゴ+ミカン)+細長×バナナ)+野菜×(全種×(大根+キュウリ+ゴボウ)+太×大根+細×(キュウリ+ゴボウ))
・・・という伝票の束、およびメモMEMOを記述する情報が記憶されていた場合を考える。ここで、MEMOを1枚目の伝票の右上に、位置を指定して張り付ける例を示す。
ここで、”1”と”右上”の関係付けを指定し接着すると、接着情報は、{伝票ID1枚目×位置+MEMO}{右上+1}{ε+(あいう)}+剰余の部分集合を含む情報、として構成される。このように、接着情報は、相互に構造上の共通性がない2つの対象情報について、それぞれの接着前の構造を維持した状態で、2つの対象情報結合し、記憶することができる。
セル空間情報は、事物、組織、人などに関する属性、あるいは人が取り扱う概念の属性と、その属性に対応する属性値とを有する情報である。属性は、キー属性とその他の属性とに分かれる。キー属性は属性値によって情報が識別できる属性であり、データベースの検索においてキーとして使用できる値に対応する。セル空間情報では、属性値(または複数の属性値を結合した列)をインスタンスと呼ぶ。インスタンスは、従来のデータベースのテーブルに格納されるレコードに相当する。それぞれのインスタンスは、インスタンスIDと呼ぶ識別情報を有する。また、キー属性、あるいは、その他の属性が複数個ある場合には、キー属性、あるいは、その他の属性は、第2の括弧“{”と“}”とによって順序が維持された因子の形式で記述される。すなわち、いわゆるベクトル形式にて属性とその対応する属性値が記述される。
(例)
果物id×(名前{ε+形+色}(リンゴ{ε+丸+赤}+ミカン{ε+丸+黄}+バナナ{ε+細長+黄}))+野菜id×(名前{ε+形状+色}(大根{ε+太+白}+キュウリ{ε+細+緑}+ゴボウ{ε+細+茶}))
この例では、従来のリレーショナルモデルで、果物テーブル、野菜テーブルとして記述されていたような情報を、式表現で記述する。なお、この例は、2つのセル空間情報(果物と野菜)を含むことから、統合セル空間情報とも呼ばれる。
果物id×バナナ×形×細長+野菜id×形状×(キュウリ+ゴボウ)細+果物id×(名前{ε+形+色}(リンゴ{ε+丸+赤}+ミカン{ε+丸+黄}+バナナ{ε+黄}))+野菜id×(名前{ε+形状+色}(大根{ε+太+白}+キュウリ{ε+緑}+ゴボウ{ε+茶}))
次に、果物のうちの属性“形”が値“細長”を有する部分集合と、野菜のうちの属性“形状”が値“細”を有する部分集合との関係付けを指定し、同値関係を設定する。そして、この同値関係によって接着空間情報を作成すると、次のようになる。
{果物id×形×バナナ+野菜id×形状×(キュウリ+ゴボウ)}{細長+細}{ε+ε}+果物id×(名前{ε+形+色}(リンゴ{ε+丸+赤}+ミカン{ε+丸+黄}+バナナ{ε+黄}))+野菜id×(名前{ε+形状+色}(大根{ε+太+白}+キュウリ{ε+緑}+ゴボウ{ε+茶}))
以下、従来のデータ構造である表およびツリー構造が、本実施形態のデータ構造でどのように記述できるかを示す。
位置表現式は、式表現における識別子の位置を示す位置情報を含む表現形式である。位置情報を、絶対位置情報とも呼ぶ。式表現としては、識別子と、順序を持つ因子の列として複数の識別子を結合する積演算子と、識別子および因子の列として結合された複数の識別子のいずれかまたは両方から項の組み合わせを構成する和演算子と、によって記述される情報を例示できる。したがって、識別子の位置、すなわち、位置表現式は、式表現中でのそれぞれの識別子が含まれる項の位置と、項の中でのそれぞれの識別子が含まれる因子の位置とによって記述できる。なお、本実施形態に係る処理の対象という意味で、位置表現式も対象情報と呼べる。実施例1では、識別子の左側に識別子の位置を示す位置情報を付加した表現形式を例示する。ただし、位置情報は、識別子の右側に付加するようにしてもよい。
例えば、識別子A、B、Cを含む式表現A+B+Cは、位置表現式では、<1×1>A+<2×1>B+<3×1>Cである。すなわち、<1×1>Aは、第1の項の第1の因子に相当する識別子がAであることを示す。また、<2×1>Bは、第2の項の第1の因子に相当する識別子がBであることを示す。
(例)
<1×1>A+(1×2)<1×1>B+(1×2)<2×1>C+(1×2)(2×2)<1×1>D+(1×2)(2×2)<2×1>E+<2×1>F+(2×2)<1×1>G+(2×2)<2×1>H
<1×1>A+(1×2)<1×1>B+(1×2)<2×1>C+(1×2){2×2}<1×1>D+(1×2){2×2}<2×1>E+<2×1>F+{2×2}<1×1>G+{2×2}<2×1>H
図6は、本実施形態に係るシステムの一例を示す構成図である。図6のシステム1は、本実施形態に係る処理を制御する情報処理装置100と、本実施形態に係る処理を分散して実行するサーバ装置200(図6の例では、200a、200b、200c・・・)とを含む。また、情報処理装置100とサーバ装置200とは、ネットワーク300を介して通信可能に接続されている。なお、図6の例では1つの情報処理装置100が他のサーバ装置200を集中管理するものとして説明しているが、分散制御を行う装置群を構成してもよい。すなわち、いずれの装置が処理の要求を受け付けた場合も、データを分割して他の装置及び自装置に分散して格納したり、自身の保持するデータと他の装置が保持するデータとを結合(「復元」とも呼ぶ)し、結合結果を出力したりする。
図7は、第1の実施形態(実施例1ともいう)に係る情報処理装置100の構成を例示すブロック図である。同図に示すように、第1の実施形態に係る情報処理装置100は、対象情報を入力するキーボード、ポインティングデバイス等の入力手段11と、入力された対象情報を格納するメモリ12(本発明の記憶部に相当)と、対象情報を所定のプログラムに基づいて処理するCPU13と、入力された対象情報や処理後の対象情報を出力するディスプレイ等の出力手段14と、CPU13と入力手段11との間を接続するインターフェース15と、CPU13と出力手段14との間を接続するインターフェース16とを備える。
図8は、第1の実施形態に係るサーバ装置200の構成を例示すブロック図である。サーバ装置200も、情報処理装置100と同様に一般的なコンピュータ装置である。同図に示すように、第1の実施形態に係るサーバ装置200は、対象情報を入力するキーボード、ポインティングデバイス等の入力手段21と、入力された対象情報を格納するメモリ22(本発明の記憶部に相当)と、対象情報を所定のプログラムに基づいて処理するCPU23と、入力された対象情報や処理後の対象情報を出力するディスプレイ等の出力手段24と、CPU23と入力手段21との間を接続するインターフェース25と、CPU23と出力手段24との間を接続するインターフェース26とを備える。
図9は、情報処理装置100によって実行される対象情報の分割格納処理の一例を示す処理フロー図である。情報処理装置100は、メモリ12に実行可能に展開されたコンピュータプログラムを実行し、図9の処理を実行する。なお、図9の処理では、対象情報は式表現形で保持されているものとする。
(例)
ドイツ(式1)+フランス(式2)+日本(式3)+ドイツ(式4)+フランス(式5)+日本(式6)+ドイツ(式7)+フランス(式8)+日本(式9)+・・・
なお、式1、式2、・・・はそれぞれ本実施形態に係る式表現である。すなわち、和演算子、積演算子、順序因子構成演算子、集合因子構成演算子等を含み得る。また、各式の構造は積演算子で接続される国名ごとに異なっているものとする。
(例)
A(B+C)+{D+E}{F+G}
この例では、A(B+C)と{D+E}{F+G}との間で分割することができる。なお、上述した分配律に基づき、A×BとA×C+{D+E}{F+G}とに分割するようにしてもよい。ただし、第2の括弧内であるDとEとの間、又はFとGとの間では分割を行わないものとする。そして、分割後の式の各々に対して並列に検索処理や集計処理を実行し、結果をさらに結合したり集計したりすることができる。すなわち、式表現で記述された対象情報を分散して保持し、並列処理が可能な形式に分割することができる。
(分割例1)
<1×1>(ドイツ(式1)+フランス(式2))、
<2×1>(日本(式3)+ドイツ(式4)+フランス(式5)+日本(式6)+ドイツ(式7)+フランス(式8)+日本(式9)+・・・)
(分割例2)
<1×1>(ドイツ(式1)+フランス(式2)+日本(式3)+ドイツ(式4))、
<2×1>(フランス(式5)+日本(式6)+ドイツ(式7)+フランス(式8))、
<3×1>(日本(式9)+・・・
(分割例3)
ドイツ(<1×2>(式1)+<4×2>(式4)+<7×2>(式7)+・・・)、
フランス(<2×2>(式2)+<5×2>(式5)+<8×2>(式8)+・・・)、
日本(<3×2>(式3)+<6×2>(式6)+<9×2>(式9)+・・・)
次に、分散配置した対象情報を結合(復元)してユーザに提示する処理を説明する。上述の分割処理によって生成された対象情報の部分集合は、位置情報に基づいて元の対象情報に戻すことができる。具体的には、各項のいずれかの因子に付加されている位置情報に基づいて、項の出現順位を示す値の小さい順、且つ因子の出現順位の小さい順に結合する。
本実施形態に係る分割処理は、様々なデータを対象情報として扱うことができる。例えば、ビルディングのような建築物に設けられた設備、工業製品等のBOM(Bills of Materials:構成表)を式表現に変換して扱うことができる。一般的にBOMはメーカーごとに異なる形式で記述されている。そして、完成品である建築物や工業製品には複数の構成要素が含まれる。スキーマの統一されていないデータをそのまま結合したり、例えば建物や建設会社、設備機器メーカーを示す因子に基づいて、建物、建設会社又は設備機器メーカーごとに分割したりすることができる。また、分割後のデータを用いて並列に処理を行ってもよい。分散処理によって処理性能を向上させることができる。
上記の例では1つの対象情報を分割する処理、及び復元(結合)する処理を説明したが、複数の対象情報を統合する処理、及び復元(分割)する処理を行うこともできる。図14は、複数の対象情報の統合及び復元(分割)を説明するための図である。上段に示すように、ドイツのDB(Database)、フランスのDB及び日本のDBに、それぞれ式1~式3、式4~式6及び式7~式9が登録されている。ここでは、例えば図2~図4に示したようなデータ構造の対象情報が式で記述され、各DBに登録されている。また、各DBは、例えば図示していない3つのサーバ装置にそれぞれ格納されている。なお、各DBは例えば国ごとにそれぞれスキーマが異なっていてもよい。
12、22 メモリ
13、23 CPU
14、24 出力部
15、16、25、26 インターフェース
100 情報処理装置
200 サーバ装置
Claims (8)
- 記号によって形成される識別子と、1以上の前記識別子を含む因子を結合し、順序を有する因子の列を形成する積演算子と、1以上の前記因子を含む項を結合し、当該項の組み合わせである式を形成する和演算子とを用いて記述される対象情報を処理する情報処理装置であって、
前記対象情報を所定の位置で複数の項に分割する分割部と、
分割後の項に含まれる因子の少なくともいずれかに対し、前記対象情報内における項の出現順位と当該項内における当該因子の出現順位とを含む位置情報を付加し、前記分割後の項ごとに複数のサーバ装置のいずれかに保持させる送信部と、
を含む情報処理装置。 - 前記対象情報は、順序を維持して前記項の組み合わせを関係付ける順序因子構成演算子、又は順序を維持せず前記項の組み合わせを関係付ける集合因子構成演算子によって区画された前記式を、前記因子として入れ子状に含む階層構造を有し、
前記所定の位置は、前記対象情報を、前記順序因子構成演算子で区画された前記式の外側において前記和演算子で区画された箇所のいずれかである
請求項1に記載の情報処理装置。 - 前記複数のサーバ装置からそれぞれ前記分割後の項を受信し、前記位置情報に基づいて、項の出現順位が小さい順且つ因子の出現順位が小さい順に各項を結合して前記対象情報を生成する結合部
をさらに含む請求項1又は2に記載の情報処理装置。 - 前記サーバ装置がそれぞれ保持する前記位置表現式は、ユーザによって指定された位置において分割される
請求項1から3のいずれか一項に記載の情報処理装置。 - 前記サーバ装置がそれぞれ保持する前記位置表現式は、分割後の部分集合が所定の容量以内となる位置において分割される
請求項1から3のいずれか一項に記載の情報処理装置。 - 前記サーバ装置がそれぞれ保持する前記位置表現式は、前記積演算子で接続された所定の因子を共通に含む項ごとに分割される
請求項1から3のいずれか一項に記載の情報処理装置。 - 記号によって形成される識別子と、1以上の前記識別子を含む因子を結合し、順序を有する因子の列を形成する積演算子と、1以上の前記因子を含む項を結合し、当該項の組み合わせである式を形成する和演算子とを用いて記述される対象情報を処理する情報処理装置が実行する情報処理方法であって、
前記対象情報を所定の位置で複数の項に分割するステップと、
分割後の項に含まれる因子の少なくともいずれかに対し、前記対象情報内における項の出現順位と当該項内における当該因子の出現順位とを含む位置情報を付加し、前記分割後の項ごとに複数のサーバ装置のいずれかに保持させるステップと、
を含む情報処理方法。 - 記号によって形成される識別子と、1以上の前記識別子を含む因子を結合し、順序を有する因子の列を形成する積演算子と、1以上の前記因子を含む項を結合し、当該項の組み合わせである式を形成する和演算子とを用いて記述される対象情報を処理する情報処理装置によって実行されるプログラムであって、
前記対象情報を所定の位置で複数の項に分割するステップと、
分割後の項に含まれる因子の少なくともいずれかに対し、前記対象情報内における項の出現順位と当該項内における当該因子の出現順位とを含む位置情報を付加し、前記分割後の項ごとに複数のサーバ装置のいずれかに保持させるステップと、
を含むプログラム。
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP15788652.4A EP3142013A4 (en) | 2014-05-09 | 2015-05-08 | Information processing device, information processing method, and program |
CA2948447A CA2948447A1 (en) | 2014-05-09 | 2015-05-08 | Information processing device, information processing method, and program |
JP2016518240A JP6542204B2 (ja) | 2014-05-09 | 2015-05-08 | 情報処理装置、情報処理方法およびプログラム |
US15/309,872 US9990415B2 (en) | 2014-05-09 | 2015-05-08 | Data structure for representing information using expressions |
CN201580024644.7A CN106575255A (zh) | 2014-05-09 | 2015-05-08 | 信息处理装置、信息处理方法以及程序 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2014-097501 | 2014-05-09 | ||
JP2014097501 | 2014-05-09 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2015170770A1 true WO2015170770A1 (ja) | 2015-11-12 |
Family
ID=54392618
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2015/063390 WO2015170770A1 (ja) | 2014-05-09 | 2015-05-08 | 情報処理装置、情報処理方法およびプログラム |
Country Status (6)
Country | Link |
---|---|
US (1) | US9990415B2 (ja) |
EP (1) | EP3142013A4 (ja) |
JP (1) | JP6542204B2 (ja) |
CN (1) | CN106575255A (ja) |
CA (1) | CA2948447A1 (ja) |
WO (1) | WO2015170770A1 (ja) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108776578B (zh) * | 2018-06-01 | 2021-10-26 | 紫光西部数据(南京)有限公司 | 一种快速合并对象的方法和系统 |
CN112199370B (zh) * | 2020-09-02 | 2024-01-26 | 安徽深迪科技有限公司 | 一种可有效提高结算效率的bom加速结算工方法 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007088982A2 (ja) * | 2006-02-03 | 2007-08-09 | Maeda Construction | 情報処理装置、情報処理方法、プログラム、データ構造、および媒体 |
WO2012023192A1 (ja) * | 2010-08-18 | 2012-02-23 | 前田建設工業株式会社 | 情報処理装置、情報処理方法、プログラム、および媒体 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8396712B2 (en) * | 2004-08-26 | 2013-03-12 | West Corporation | Method and system to generate finite state grammars using sample phrases |
US8863101B2 (en) * | 2008-12-10 | 2014-10-14 | International Business Machines Corporation | Compiler generator |
WO2013042230A1 (ja) * | 2011-09-21 | 2013-03-28 | 前田建設工業株式会社 | 情報処理装置 |
JP5357286B2 (ja) | 2011-09-21 | 2013-12-04 | 前田建設工業株式会社 | 情報処理装置、情報処理方法、およびプログラム |
CN103475905B (zh) * | 2013-09-25 | 2016-06-15 | 浙江大学 | 云环境下基于网络连接复用的影像数据块高效传输方法 |
-
2015
- 2015-05-08 EP EP15788652.4A patent/EP3142013A4/en not_active Withdrawn
- 2015-05-08 WO PCT/JP2015/063390 patent/WO2015170770A1/ja active Application Filing
- 2015-05-08 CN CN201580024644.7A patent/CN106575255A/zh active Pending
- 2015-05-08 JP JP2016518240A patent/JP6542204B2/ja not_active Expired - Fee Related
- 2015-05-08 CA CA2948447A patent/CA2948447A1/en not_active Abandoned
- 2015-05-08 US US15/309,872 patent/US9990415B2/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007088982A2 (ja) * | 2006-02-03 | 2007-08-09 | Maeda Construction | 情報処理装置、情報処理方法、プログラム、データ構造、および媒体 |
WO2012023192A1 (ja) * | 2010-08-18 | 2012-02-23 | 前田建設工業株式会社 | 情報処理装置、情報処理方法、プログラム、および媒体 |
Non-Patent Citations (1)
Title |
---|
See also references of EP3142013A4 * |
Also Published As
Publication number | Publication date |
---|---|
US9990415B2 (en) | 2018-06-05 |
CN106575255A (zh) | 2017-04-19 |
CA2948447A1 (en) | 2015-11-12 |
JP6542204B2 (ja) | 2019-07-10 |
EP3142013A4 (en) | 2017-10-04 |
US20170270187A1 (en) | 2017-09-21 |
JPWO2015170770A1 (ja) | 2017-04-20 |
EP3142013A1 (en) | 2017-03-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zakir et al. | Big data analytics. | |
US9652559B2 (en) | Managing information assets using feedback re-enforced search and navigation | |
Reis et al. | Fundamentals of data engineering | |
JP2019512816A (ja) | ページリソースの配置方法及び装置 | |
US20050125463A1 (en) | Business data migration using metadata | |
JP2013080375A (ja) | 個人情報匿名化装置及び方法 | |
US20210397601A1 (en) | Enforcing path consistency in graph database path query evaluation | |
US20150379166A1 (en) | Model compilation for feature selection in statistical models | |
US10586169B2 (en) | Common feature protocol for collaborative machine learning | |
EP3499379B1 (en) | Computer implemented and computer controlled method, computer program product and platform for manipulating data arranged for processing and storage at a data storage engine | |
US20210201345A1 (en) | Solution graph for managing content in a multi-stage project | |
WO2015170770A1 (ja) | 情報処理装置、情報処理方法およびプログラム | |
US11295273B2 (en) | Normalized object exposure for collaborative platforms | |
JP5357286B2 (ja) | 情報処理装置、情報処理方法、およびプログラム | |
US10248300B2 (en) | Polymorph rendering for collaborative platforms | |
JP6682754B2 (ja) | 情報処理装置、情報処理方法およびプログラム | |
US20200201610A1 (en) | Generating user interfaces for managing data resources | |
Bardi et al. | Coping with interoperability and sustainability in cultural heritage aggregative data infrastructures | |
JP5512817B2 (ja) | 情報処理装置、情報処理方法、プログラム、および媒体 | |
JP5764226B2 (ja) | 情報処理装置、情報処理方法、プログラム、および媒体 | |
JP2009110440A (ja) | 情報処理装置、情報処理方法、プログラム、および媒体 | |
Arévalo et al. | Formal concept analysis-based service classification to dynamically build efficient software component directories | |
CN111737409B (zh) | 辅助系统及存储介质 | |
US11693878B2 (en) | Generation of a dataset in the format of a machine learning framework | |
WO2013042230A1 (ja) | 情報処理装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15788652 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2948447 Country of ref document: CA Ref document number: 2016518240 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 15309872 Country of ref document: US |
|
REEP | Request for entry into the european phase |
Ref document number: 2015788652 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2015788652 Country of ref document: EP |