Search

Ralph Shnelvar

from Longmont, CO

Ralph Shnelvar Phones & Addresses

  • 1117 Chestnut Dr, Longmont, CO 80503 (720) 340-4536 (720) 340-4555
  • 1333 King Ave, Boulder, CO 80302 (303) 546-6125 (303) 546-9355
  • 837 20Th St, Boulder, CO 80302 (303) 546-6136
  • Riverwoods, IL
  • Chicago, IL
  • Fort Collins, CO
  • 1333 King Ave, Boulder, CO 80302 (303) 594-3382

Work

Position: Construction and Extraction Occupations

Education

Degree: Associate degree or higher

Emails

e***1@aol.com

Business Records

Name / Title
Company / Classification
Phones & Addresses
Ralph Shnelvar
Executive, President
INFORMATION INC
Computer Sales · Book Publishing · Computer & Software Stores
1333 King Ave, Boulder, CO 80302
(303) 546-6125
Ralph Shnelvar
Information LLC
Computer Software Design · Custom Computer Programming Services
385 Fox Dr, Boulder, CO 80303
(303) 546-6125

Publications

Us Patents

Method For Reducing Redundancy Between Two Or More Datasets

View page
US Patent:
8527482, Sep 3, 2013
Filed:
Jun 8, 2009
Appl. No.:
12/455864
Inventors:
Steve Heller - Dike TX, US
Ralph Shnelvar - Boulder CO, US
Assignee:
Chrysalis Storage, LLC - Tyler TX
International Classification:
G06F 17/30
US Classification:
707699
Abstract:
A method for reducing redundancy between two or more datasets of potentially very large size. The method improves upon current technology by oversubscribing the data structure that represents a digest of data blocks and using positional information about matching data so that very large datasets can be analyzed and the redundancies removed by, having found a match on digest, expands the match in both directions in order to detect and eliminate large runs of data by replace duplicate runs with references to common data. The method is particularly useful for capturing the states of images of a hard disk. The method permits several files to have their redundancy removed and the files to later be reconstituted. The method is appropriate for use on a WORM device. The method can also make use of L2 cache to improve performance.

Method Of Reducing Redundancy Between Two Or More Datasets

View page
US Patent:
20130013618, Jan 10, 2013
Filed:
Sep 14, 2012
Appl. No.:
13/619621
Inventors:
Steve Heller - Dike TX, US
Ralph Shnelvar - Boulder CO, US
Assignee:
Chrysalis Storage, LLC - Dike TX
International Classification:
G06F 17/30
US Classification:
707747, 707E17002
Abstract:
A method for reducing redundancy between two or more datasets of potentially very large size. The method improves upon current technology by oversubscribing the data structure that represents a digest of data blocks and using positional information about matching data so that very large datasets can be analyzed and the redundancies removed by, having found a match on digest, expands the match in both directions in order to detect and eliminate large runs of data by replace duplicate runs with references to common data. The method is particularly useful for capturing the states of images of a hard disk. The method permits several files to have their redundancy removed and the files to later be reconstituted. The method is appropriate for use on a WORM device. The method can also make use of L2 cache to improve performance.

Method And Apparatus For Storing Information In A Data Processing System

View page
US Patent:
6374266, Apr 16, 2002
Filed:
Jul 24, 1999
Appl. No.:
09/360852
Inventors:
Ralph Shnelvar - Boulder CO, 80302
International Classification:
G06F 1730
US Classification:
707204, 711162
Abstract:
A method for storing data from a data source in a storage device of a data repository by reading all source allocation units, restructuring the data into data units having a size corresponding to the repository allocation units, and generating a hash value for the data of each data unit read from the data source. For each data unit, a data table is searched for a table entry having a matching hash value wherein each table entry contains the hash value of a data unit stored in a repository allocation unit and a repository allocation unit pointer to the corresponding repository allocation unit. When the hash value of a data unit does not match any hash value of any table entry in the data table, the data of the data unit is written into a newly allocated repository allocation unit a new table entry is written to the data table. When the hash value of a data unit matches the hash value of a data entry in the data table, the data of the corresponding repository allocation unit and is compared with the data of the data unit. If the data of the data unit matches the repository allocation unit, the data unit is discarded.

Method Of Reducing Redundancy Between Two Or More Datasets

View page
US Patent:
20190340165, Nov 7, 2019
Filed:
Nov 2, 2018
Appl. No.:
16/179462
Inventors:
- Tyler TX, US
Ralph Shnelvar - Boulder CO, US
International Classification:
G06F 16/23
G06F 16/174
G06F 16/21
Abstract:
A method for reducing redundancy between two or more datasets of potentially very large size. The method improves upon current technology by oversubscribing the data structure that represents a digest of data blocks and using positional information about matching data so that very large datasets can be analyzed and the redundancies removed by, having found a match on digest, expands the match in both directions in order to detect and eliminate large runs of data by replace duplicate runs with references to common data. The method is particularly useful for capturing the states of images of a hard disk. The method permits several files to have their redundancy removed and the files to later be reconstituted. The method is appropriate for use on a WORM device. The method can also make use of L2 cache to improve performance.

Method Of Reducing Redundancy Between Two Or More Datasets

View page
US Patent:
20160042026, Feb 11, 2016
Filed:
Aug 14, 2015
Appl. No.:
14/827168
Inventors:
- Tyler TX, US
Ralph Shnelvar - Boulder CO, US
International Classification:
G06F 17/30
Abstract:
A method for reducing redundancy between two or more datasets of potentially very large size. The method improves upon current technology by oversubscribing the data structure that represents a digest of data blocks and using positional information about matching data so that very large datasets can be analyzed and the redundancies removed by, having found a match on digest, expands the match in both directions in order to detect and eliminate large runs of data by replace duplicate runs with references to common data. The method is particularly useful for capturing the states of images of a hard disk. The method permits several files to have their redundancy removed and the files to later be reconstituted. The method is appropriate for use on a WORM device. The method can also make use of L2 cache to improve performance.
Ralph Shnelvar from Longmont, CO Get Report