|Publication number||US5634123 A|
|Application number||US 08/088,788|
|Publication date||May 27, 1997|
|Filing date||Jul 8, 1993|
|Priority date||Jul 8, 1993|
|Also published as||CA2166809A1, CA2166809C, EP0707724A1, WO1995002218A1|
|Publication number||08088788, 088788, US 5634123 A, US 5634123A, US-A-5634123, US5634123 A, US5634123A|
|Inventors||H. Richard Bennion|
|Original Assignee||Park City Group, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (6), Non-Patent Citations (4), Referenced by (17), Classifications (18), Legal Events (17)|
|External Links: USPTO, USPTO Assignment, Espacenet|
1. Field of the Invention
This invention relates to distributed data management and, more particularly, to a persistent index storage system and method allowing storage and manipulation of data using hierarchical nested records and code points.
2. Description of the Related Art
Conventional distributed processor systems facilitate execution of several different processes simultaneously on different processors. Systems and methods for exchanging data among these processors exist in the prior art (see U.S. Pat. No. 5,056,003 to Hammer et al. for Distributed Data Management Mechanism). Such systems and methods present techniques for reducing storage requirements by splitting a logical data stream into segments residing at different processor storage locations. Descriptor elements indicate the location and length of the various segments so that they can be reassembled into the complete logical data string.
Hammer et al. and related techniques suffer from several disadvantages. One disadvantage is that hierarchical data structures are not generally supported; if the data stream contains nested records, there is no built-in technique for navigating through the data structure. Thus, individual applications are required to deal with the hierarchical structure, as they cannot rely on the data management system to do so. This adds to programming overhead. Another disadvantage is that logical data strings have a fixed maximum length due to the fixed and limited space available for the descriptor element specifying length. Finally, existing systems generally provide only a mechanism for communicating and passing data strings among processors, but do not provide a persistent storage system.
In accordance with the present invention, there is provided a system and method of data management permitting storage and communication of different types of data, and allowing hierarchical nesting of data records and variable lengths of records. Hierarchical structure is implicitly defined by relationships of length fields of data records. Thus, movement and management of data stored according to the structure of the present invention is greatly facilitated. Individual applications are not required to deal with navigation through the hierarchical structure, since the data management system does so automatically. In addition, the data structure provides for movement of "chunks" of records that have a hierarchical relationship with one another. Finally, the system of the present invention includes format information to facilitate data transfers between applications employing different data formats.
The data structure defined by the present invention includes two types of records: data-containing records and container records. Data-containing records contain data, while container records contain other records. A code point found at the beginning of each record specifies its type. A length field facilitates variable data lengths for data-containing records, as well as implicit definition of a hierarchical structure among records. A format field facilitates movement of data among environments having differing data formats. Code point definitions may be system-wide, or application-specific, depending on the level of the particular record in the overall hierarchy.
In defining the hierarchical relationship among records implicitly by virtue of the various length fields, the data structure provides the above-recited advantages without requiring large amounts of data storage.
FIG. 1 is a block diagram of a preferred hardware environment for the present invention.
FIG. 2 is a diagram of the data formats used to store container records and data-containing records in the preferred embodiment.
FIG. 3 is a diagram of a sample string of data bytes according to the preferred embodiment.
FIG. 4 is a flowchart showing the process of deleting a record.
FIG. 5 is a flowchart showing the process of adding a record.
FIG. 6 is a diagram showing an example of a hierarchically-arranged collection of data fields suitable for storage according to the present invention.
FIG. 7 is a diagram showing an example of a hierarchical relationship among data fields.
FIG. 8 is a flowchart showing the process of inserting a record.
Referring now to FIG. 1, there is shown a block diagram of a preferred hardware environment for the present invention. In the preferred embodiment, computer 100 may be a conventional IBM-compatible personal computer including standard communication interface hardware 101, Intel processor 102, input device 103 such as keyboard and/or mouse, output device 104 such as display screen and/or printer, and random access memory (RAM) 105. RAM 105 is divided into several sections, each of which will be described below.
Application programs 106 are stored in RAM 105 in a conventional manner. Data storage 107 stores data for use by the computer, including data objects 110 organized according to the code point structure of the present invention, as described more fully below. Some of the data may be stored on disk or other media (not shown), and may be swapped into RAM 105 as needed, according to conventional means. Code point library 108 contains the software routines for accessing data storage 107, including navigation through the data structure, interfacing, and indexing. Code point library 108 contains instructions for processor 102 for reading and modifying record lengths, and for performing operations on the stored data as described below. In response to calls from application programs 106, code point library 108 contains instructions for processor 102 to return record information and update the stored data accordingly.
Lookup tables 109 provide definitions for various code points, so that application programs 106 can interpret the data stored in data storage 107. A separate lookup table 109 may be provided by each application program 106, so that the application program 106 need only be concerned with a particular subset of the code point definitions.
Referring now to FIG. 6, there is shown an example of a hierarchically-arranged collection of data records suitable for storage according to the techniques of the present invention. For purposes of illustration, COMPANY record 600 is shown containing several records of information. All of the records contained within COMPANY record 600 relate to a single company. As can be seen, the records contained within COMPANY record 600 are arranged in a hierarchical structure.
Specifically, COMPANY record 600 contains one COMPANY DATA record 601 and two REGION records 602. COMPANY DATA record 601 describes the company as a whole, while REGION records 602 each describe a region associated with the company. Each REGION record 602 is further subdivided into a REGION DATA record 604 and two DISTRICT records 605. Each REGION DATA record 604 describes the region as a whole, while DISTRICT records 605 each describe a district associated with the region. Each DISTRICT record 605 is further subdivided into a DISTRICT DATA record 606 and two STORE DATA records 607. Each DISTRICT DATA record 606 describes the district as a whole, while STORE DATA records 607 each describe a store associated with the district.
Thus, a hierarchical structure emerges. Each individual record contained within COMPANY record 600 may be classified as either a container record or a data-containing record. Container records contain other records, while data-containing records contain data. No record is both a container record and a data-containing record. Record 600 is a container record, as are REGION records 602 and DISTRICT records 605. COMPANY DATA record 601 is a data-containing record, as are REGION DATA records 604, DISTRICT DATA records 606, and STORE DATA records 607. Thus, it can be seen that the container records serve to define and maintain the hierarchical relationship among the data-containing records.
Implicit in the hierarchical structure shown in FIG. 6 is a series of nested "levels" of data. COMPANY record 600 is a Level 0 record, since no records contain it. In all code point structures according to the preferred embodiment, the first record, typically designated as Level 0, is always a container record. COMPANY DATA record 601 and REGION records 602 are Level 1 records, since they are each contained by one record. REGION DATA records 604 and DISTRICT records 605 are Level 2 records, since they are each contained by two records. DISTRICT DATA records 606 and STORE DATA records 607 are Level 3 records, since they are each contained by three records.
Referring now to FIG. 7, there is shown another example of a hierarchical relationship among records. Record 700 contains several hierarchically-organized records. Container records 701 contain other records, while data-containing records 702 contain data.
Overall Data Structure
The system and method of the present invention provide techniques of efficient storage and transmission of hierarchically-organized data of the type exemplified by FIGS. 6 and 7.
The following table is a representation of an example of a portion of memory that is organized according to the hierarchical code point structure of the present invention. Each record in the table corresponds to one of the records of the example of FIG. 6, described above.
______________________________________Memory location Record Name Length______________________________________1-6 Company 4477-33 Company Data 2734-39 Region 20740-66 Region Data 2767-72 District 8773-99 District Data 27100-126 Store Data 27127-153 Store Data 27154-159 District 87160-186 District Data 27187-213 Store Data 27214-240 Store Data 27241-246 Region 207247-273 Region Data 27274-279 District 87280-306 District Data 27307-333 Store Data 27334-360 Store Data 27361-366 District 87367-393 District Data 27394-420 Store Data 27421-447 Store Data 27______________________________________
The above table shows the contents of a contiguous block of memory that is 447 bytes long. For purposes of illustration, the first column of the table is indented according to the level of the record. Thus, the hierarchical relationship among the records is shown.
In the table, "Memory location" indicates the location of each record within the block of memory. In the interest of simplicity for this example, all container records occupy six bytes of memory and are shown in boldface. All data-containing records occupy 27 bytes of memory and are shown in a normal typeface. In the preferred embodiment, container records and data-containing records may vary in length, as will be described in more detail below.
For each record, there is a "Record Name" indicating the name of the corresponding record in FIG. 6. Each record also has a "Length" that indicates the total length of the record itself plus all records it contains. Thus, for example, the "Region" record that is stored at memory location 34-39 has a "Length" of 207, indicating that it contains all records residing at memory locations 34 through 240. In general, a record having a starting memory location of X and a "Length" of L contains all records residing at memory locations numbered X through X+L-1. By definition, a data-containing record has a "Length" equal to the actual length of the record itself, since a data-containing record cannot contain another record.
Thus, the placement of each record in memory, along with the "Length" values, define the hierarchical relationship among the records.
These hierarchical relationships permit rapid navigation through the data structure. If a long record is encountered that is of no interest to a particular process, the process can skip over the record (and any records nested within) by reading the "Length" and stepping forward by a number of bytes equal to the "Length". When stepping forward in this manner, the process need not read the skipped-over record into memory; only the "Length" of the first record need be read.
The hierarchical structure also permits creation of an object, or record, that contains information to be used by many different application programs 106 on the computer. Thus, for example, a level one record might represent an envelope to be handled by an electronic mail application, and might contain a number of level two records. Each level two record might be associated with a different application program 106, with the associations being defined by the code points. Each application program 106 need only be aware of the code point definitions for its associated records.
Finally, the hierarchical structure permits moving and copying of groups of nested records, or "chunks", at any level in the hierarchy. When performing an operation such as copying or moving a record, the system reads the length field and performs the operation on a continuous block of memory having the indicated length. Thus, in one operation, a record and all those records contained within it may be moved or copied.
Data Format for Records
Referring now to FIG. 2, there is shown a diagram of the data formats used to store container records and data-containing records in the preferred embodiment. Container record 200 includes two fields:
code point 202; and
Code point 202 is two bytes (16 bits) long. Three bits are used to specify the length of length field 203, which can vary from one (indicated by 001) to four bytes (indicated by 100). Eleven bits are used to specify a user-defined code that will be interpreted by the application program 106 making use of the invention. One bit is used to indicate that this is a container record (as opposed to a data-containing record). The final bit is free.
Length 203 is from one to four bytes long. The length of the length field 203 is determined by a portion of code point 202, as described in the previous paragraph. For container records, the length field 203 specifies the total length of all records that the current record contains (as described above). Providing variable length for this field increases the flexibility of the data format. Since the length field is up to four bytes long, the value of length 203 can range from zero to FFFFFFFF (hex).
Data-containing record 201 is similar to container record 200, except that it contains two additional fields:
format 204; and
Format 204 is a one-byte field that specifies an attribute type that is used by the application program 106 in interpreting the stored data. Thus, the system provides for automated translation of individual records from one data format to another. Required translation operations may be provided in the code point library.
Data 205 is a variable-length field that contains the stored data.
For data-containing records, the length field 203 specifies the length of the record itself, and therefore determines the length of data field 205. As stated above, the length of a data-containing record never extends beyond the end of the record itself. A data-containing record may have length of zero, so that it may be used as a flag.
In the preferred embodiment, code points at various levels may be associated with different application programs 106. Thus, a typical level one record might consist of a data-containing record representing an outer envelope for an electronic mail message to be processed by an electronic mail application, while a series of level two records within the level one record might consist of additional container records, each identifying a particular application program 106 to be used to process the higher-level records within. Any records of level three or greater would be passed to the individual application programs 106 for further processing.
This technique permits the same code point to be reused at various levels of the data structure. For example, a code point of 5DF at level 3 can be distinguished from a code point of 5DF at level 4, because the code points will be interpreted by different applications.
In this way, the hierarchical structure provides a mechanism for defining a hierarchical relationship among various levels of data to be used by different applications.
Other embodiments, in which the various levels of code points and records are handled differently, may also be used without departing from the essential characteristics of the invention.
Referring now to FIG. 3, there is shown a sample string of 302 data bytes representing a series of hierarchically-organized records according to the present invention. Each byte is shown as a two-digit hexadecimal code 301, above which is shown the ASCII equivalent 302 for the byte. Each field is labeled to indicate its contents: "CP=CONT" is a container code point; "CP=DATA" is a data code point; "LEN" is a Length field; "FMT" is a Format field; and "DATA" is a data field. In the code points shown, the first byte is CO for container records or 60 for data-containing records, while the second byte represents an application-defined code. Format 02 indicates ASCII data, while formats 04 and 05 indicate other types of data. FIG. 3 also includes horizontal lines 303 indicating the hierarchical relationships among the records.
Given the above data structure, the following operations are available:
Referring now to FIG. 4, the process of deleting a record is illustrated. To delete a record, including all the records it contains, the system rewrites the entire data structure, leaving out the records to be deleted. This is done by setting a pointer to the beginning of the data structure 402, and copying each byte of the data structure 404. Before copying each byte, the system checks 403 to see if the pointer is at a record that is to be deleted. If so, the system reads 405 the length field of the record and advances the pointer 406 by a number of bytes equal to the length of the record. After skipping forward, the system resumes copying successive bytes. Thus, the record and all the records it contains, are left out of the new data structure. When the system reaches the end of a container record 407, it reduces 408 the length field of the container record by an amount equal to the total length of all deleted records that were within the container record. The system keeps track of this total length in a stack called ICPI (Internal Code Points Information) (not shown). The system then checks 409 whether the end of the data structure was reached. If not, it repeats steps 403 through 409.
This process preserves the hierarchical relationships among surviving records when a record is deleted. For example, in FIG. 6, if one of the district records 605 were to be deleted (including all records contained therein), the length field of parent region record 602 would be reduced by 87 (the length of the deleted record). In turn, the length field of parent company record 600 would be reduced by 87. The length fields of all other records would remain unchanged, as no records within those records have been deleted.
Referring now to FIG. 5, the process of adding a new record to the end of the data structure is illustrated. First the system sets the pointer 502 to the beginning of the data structure. Then it reads 503 the length of the first record in the structure, a level 0 record. The system then advances the pointer 504 by a number of bytes equal to the length. Thus, the pointer is positioned at the end of the data structure defined by the length of the first level 0 record. Once the pointer is at the end, the system writes 505 the new data starting at the pointer's location. As the new data is written, the system keeps track of the length of the written data, using temporary storage in the ICPI stack. After the new data is written, the length of the level 0 record is increased by the length of the newly written data 506. Thus, the level 0 record now contains the newly written data.
Although the above method was described in terms of adding data at level 1 of a data structure (so that level 0 contains the new data), the same technique could be used at any level. Once the new data is written, the system increases the value of the length records for all records containing the new data record.
Referring now to FIG. 8, the process of inserting a new record into the data structure is illustrated. To insert a record, the system rewrites the entire data structure, with the new record inserted. This is done by setting a pointer to the beginning of the data structure 802, and copying each byte of the data structure 807 while successively advancing the pointer. When the pointer reaches the point at which the new record is to be inserted 803, it copies the new record 804. The code point for the new record is copied from the code point of an adjacent record having the same level. Alternatively, a new code point may be specified by the application commanding the insertion operation. When the system reaches the end of a container record 808, it increases 809 the length field of the container record by an amount equal to the total length of all records that were inserted into the container record. The system keeps track of this total length in a stack called ICPI (Internal Code Points Information) (not shown). The system then checks 810 whether the end of the data structure was reached. If not, it repeats steps 803 through 809.
This process preserves the hierarchical relationships among records when a record is inserted. For example, in FIG. 6, if one of the district records 605 were to be deleted (including all records contained therein), the length field of parent region record 602 would be reduced by 87 (the length of the deleted record). In turn, the length field of parent company record 600 would be reduced by 87. The length fields of all other records would remain unchanged, as no records within those records have been deleted.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5034914 *||Jun 16, 1988||Jul 23, 1991||Aquidneck Systems International, Inc.||Optical disk data storage method and apparatus with buffered interface|
|US5129084 *||Jun 29, 1989||Jul 7, 1992||Digital Equipment Corporation||Object container transfer system and method in an object based computer operating system|
|US5200864 *||Jun 28, 1989||Apr 6, 1993||International Business Machines Corporation||Combining small records into a single record block for recording on a record media|
|US5355493 *||Nov 20, 1991||Oct 11, 1994||International Business Machines Corporation||System for encoding units of entity/relationship data to include prefixes with codes for length, action, and unit identifier|
|US5432928 *||Nov 10, 1992||Jul 11, 1995||Microsoft Corporation||Updating objects stored in a permanent container while preserving logical contiguity|
|US5463724 *||Mar 14, 1995||Oct 31, 1995||Borland International, Inc.||System and methods for improved spreadsheet interface with user-familiar objects|
|1||*||Hanson, Owen, Design of Computer Data Files, 1982, pp. 1 18, 48 62.|
|2||Hanson, Owen, Design of Computer Data Files, 1982, pp. 1-18, 48-62.|
|3||*||Tanenbaum, Andrew S., Operating Systems:Design and Implementation, 1987, pp. 251 273.|
|4||Tanenbaum, Andrew S., Operating Systems:Design and Implementation, 1987, pp. 251-273.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6128771 *||Feb 9, 1996||Oct 3, 2000||Sun Microsystems, Inc.||System and method for automatically modifying database access methods to insert database object handling instructions|
|US6240414||Aug 19, 1998||May 29, 2001||Eisolutions, Inc.||Method of resolving data conflicts in a shared data environment|
|US6915510||Jul 27, 2000||Jul 5, 2005||Sun Microsystems, Inc.||System and method for automatically modifying database access methods to insert database object handling instructions|
|US7203689 *||Jun 28, 2001||Apr 10, 2007||Cedara Software Corp.||Method for processing structured data using an object-oriented computer language|
|US7447712||Aug 19, 1998||Nov 4, 2008||Global 360, Inc.||Structured workfolder|
|US7702637 *||Jun 15, 2005||Apr 20, 2010||Microsoft Corporation||Systems and methods for fragment-based serialization|
|US8448062 *||May 21, 2013||Sap Ag||System and method for simultaneous display of multiple tables|
|US8671363 *||Nov 19, 2008||Mar 11, 2014||Oracle International Corporation||Nested dimensions presentation structures|
|US8977635 *||Mar 13, 2013||Mar 10, 2015||Fujitsu Limited||Device, method of processing data, and computer-readable recording medium|
|US20020194152 *||Jun 28, 2001||Dec 19, 2002||Treil Nicolas Herve Edouard||Method for processing structured data using an object-oriented computer language|
|US20050234868 *||Jun 15, 2005||Oct 20, 2005||Microsoft Corporation||Systems and methods for fragment-based serialization|
|US20050234986 *||Apr 9, 2004||Oct 20, 2005||Microsoft Corporation||Systems and methods for fragment-based serialization|
|US20080090939 *||Oct 5, 2007||Apr 17, 2008||Netravali Anil N||Biodegradable soy protein-based compositions and composites formed therefrom|
|US20100125813 *||Nov 19, 2008||May 20, 2010||Akhil Choudhury||Nested Dimensions Presentation Structures|
|US20110145690 *||Jun 16, 2011||Sap Ag||System and method for simultaneous display of multiple tables|
|US20130246444 *||Mar 13, 2013||Sep 19, 2013||Fujitsu Limited||Device, method of processing data, and computer-readable recording medium|
|WO2005103937A1 *||Jul 29, 2004||Nov 3, 2005||Microsoft Corporation||Systems and methods for fragment-based serialization|
|U.S. Classification||1/1, 711/E12.006, 707/E17.001, 707/E17.006, 715/247, 715/205, 715/243, 715/207, 715/246, 707/999.1, 707/999.101|
|International Classification||G06F12/02, G06F17/30|
|Cooperative Classification||G06F12/023, G06F17/30569, Y10S707/99942|
|European Classification||G06F17/30S5V, G06F12/02D2|
|Jul 8, 1993||AS||Assignment|
Owner name: FIELDS SOFTWARE GROUP, INC.
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BENNION, H. RICHARD;REEL/FRAME:006630/0661
Effective date: 19930702
|Aug 26, 1994||AS||Assignment|
Owner name: PARK CITY GROUP, INC., UTAH
Free format text: CHANGE OF NAME.;ASSIGNOR:FIELDS SOFTWARE GROUP, INC.;REEL/FRAME:007114/0764
Effective date: 19930630
|Jul 7, 1997||AS||Assignment|
Owner name: SILICON VALLEY BANK, CALIFORNIA
Free format text: SECURITY INTEREST;ASSIGNOR:PARK CITY GROUP, INC.;REEL/FRAME:008595/0001
Effective date: 19970512
|Dec 19, 2000||REMI||Maintenance fee reminder mailed|
|Jul 31, 2001||FP||Expired due to failure to pay maintenance fee|
Effective date: 20010527
|Jan 29, 2002||FPAY||Fee payment|
Year of fee payment: 4
|Feb 11, 2002||SULP||Surcharge for late payment|
|Mar 19, 2002||PRDP||Patent reinstated due to the acceptance of a late maintenance fee|
Effective date: 20020211
|Nov 22, 2004||FPAY||Fee payment|
Year of fee payment: 8
|Oct 31, 2005||AS||Assignment|
Owner name: PARK CITY GROUP, INC., EDWARD CLISSOLD, UTAH
Free format text: RELEASE OF SECURITY AGREEMENT;ASSIGNOR:TRIPLE NET INVESTMENTS, LTD AS SUCCESSOR TO WHALE INVESTMENTS, LTD.;REEL/FRAME:016958/0202
Effective date: 20050822
|Sep 12, 2008||FPAY||Fee payment|
Year of fee payment: 12
|Apr 28, 2010||AS||Assignment|
Owner name: FIELDS SOFTWARE GROUP, INC.,UTAH
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BENNION, H. RICHARD;REEL/FRAME:024305/0087
Effective date: 20100416
|May 26, 2010||AS||Assignment|
Owner name: PARK CITY GROUP, INC.,UTAH
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE NATURE OF CONVEYANCE TO "ASSIGNMENT OF SECURITY INTEREST" PREVIOUSLY RECORDED ON REEL 016958 FRAME 0202. ASSIGNOR(S) HEREBY CONFIRMS THE CORRECTION OF THE NATURE OF CONVEYANCE AND EXECUTION DATE AS 06/24/2004 AND PAGE COUNT OF ASSIGNMENT AS 4 PAGES;ASSIGNOR:TRIPLE NET INVESTMENTS, LTD. AS SUCCESSOR TO WHALE INVESTMENTS, LTD.;REEL/FRAME:024434/0969
Effective date: 20051031
Owner name: PARK CITY GROUP, INC.,UTAH
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:SILICON VALLEY BANK;REEL/FRAME:024434/0975
Effective date: 20100407
|Jun 15, 2010||AS||Assignment|
Owner name: PARK CITY GROUP, INC.,UTAH
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:TRIPLE NET INVESTMENTS, LTD.;REEL/FRAME:024539/0254
Effective date: 20050825
|Jul 20, 2010||AS||Assignment|
Owner name: STAFANPOLUS KG, LLC, DELAWARE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PARK CITY GROUP, INC.;REEL/FRAME:024710/0605
Effective date: 20100330
|Jun 27, 2012||AS||Assignment|
Owner name: STAFANPOLUS KG, LIMITED LIABILITY COMPANY, DELAWAR
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE NATURE OF CONVEYANCE FROM "ASSIGNMENT OF ASSIGNORS INTEREST" TO "LICENSE" PREVIOUSLY RECORDED ON REEL 024710 FRAME 0605. ASSIGNOR(S) HEREBY CONFIRMS THE CONVEYANCE IS A "MEMORANDUM OF EXCLUSIVE LICENSE/RIGHTS";ASSIGNOR:PARK CITY GROUP, INC.;REEL/FRAME:028456/0794
Effective date: 20100330
|Jun 28, 2012||AS||Assignment|
Owner name: STAFANPOLUS KG, LIMITED LIABILITY COMPANY, DELAWAR
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PARK CITY GROUP, INC.;REEL/FRAME:028456/0377
Effective date: 20120412