Mark E Rawlins

US Patent:

8321408, Nov 27, 2012

Filed:

Jun 1, 2011

Appl. No.:

13/151019

Inventors:

Mark L. Rawlins - Orem UT, US
Larry B. Nash - Provo UT, US
Joel J. Wilson - Spanish Fork UT, US
Alan D. Reed - Auburn AL, US
Devry M. Anderson - Pleasant Grove UT, US
Daniel M. Floyd - West Jordon UT, US

Assignee:

Infotrax Systems - Orem UT

International Classification:

G06F 17/30

US Classification:

707718

Abstract:

Access to hierarchical data stored in a database is facilitated by using an ordered flat file that maintains the hierarchical organization of the data. Queries against the hierarchical data are processed by accessing the ordered flat file rather than the underlying database. The speed of accessing the ordered flat file is increased by using memory mapping the ordered flat file. Changes to the data in the underlying database are reflected in real-time without regenerating the ordered flat file by employing an overflow area for storing changes to elements that cannot be made within the ordered flat file.

US Patent:

20160314198, Oct 27, 2016

Filed:

Mar 15, 2016

Appl. No.:

15/071045

Inventors:

- Orem UT, US
Dan Floyd - West Jordan UT, US
Mark Rawlins - Lehi UT, US
Devry Anderson - Pleasant Grove UT, US

International Classification:

G06F 17/30

Abstract:

A computerized method for multi-level data resolution based upon searches of the hierarchically organized elements comprises receiving a database query directed towards returning information from one or more locations within a hierarchically organized data structure. The method can also comprise generating a summary of the information that conforms with the query and a first filter condition. Additionally, the method can comprise receiving a request for a detailed view of the information in the summary. Upon receiving the request the method can include generating a detailed accounting of the information that conforms with the query and a second filter condition. Additionally, the second filter condition can be different from the first filter condition.

US Patent:

20160299927, Oct 13, 2016

Filed:

Apr 10, 2015

Appl. No.:

14/683746

Inventors:

- OREM UT, US
Dan Floyd - West Jordan UT, US
Jake Stowell - Orem UT, US
Mark Rawlins - Lehi UT, US

International Classification:

G06F 17/30

Abstract:

A server computer system receives a database query comprising multiple query fields. At least one of the query fields is directed towards information stored within a first hierarchal tree, and another of the query fields is directed towards information stored within a separate, second hierarchal tree. The server computer system can then access one or more files containing the first hierarchal tree and the second hierarchal tree. After accessing the hierarchal trees, the server computer system can identify a first group of query fields that are contained within the first hierarchal tree and a second group of query fields that are not contained within the first hierarchal tree. The first group of query fields and the second group of query fields are selected from the multiple query fields and the at least one of the query fields is within the first group of query fields.

US Patent:

20160299928, Oct 13, 2016

Filed:

Apr 10, 2015

Appl. No.:

14/683757

Inventors:

- OREM UT, US
Dan Floyd - West Jordan UT, US
Jake Stowell - Orem UT, US
Mark Rawlins - Lehi UT, US

International Classification:

G06F 17/30

Abstract:

A computerized method for efficiently storing data entries within a database can comprise identifying a particular number of records within a hierarchical tree, which records can comprise fields. The method can also comprise writing to storage at least a portion of the fields of the hierarchical tree in a flat file order that is directly related to the order of records in the hierarchical tree. Writing to storage at least a portion of the fields of the hierarchical tree can comprise disregarding a plurality of fields that contains a particular value so that the disregarded plurality of fields do not exist in storage. Additionally, the method can comprise reading the tree so that when encountering a field not found in storage the field is designated for that record as containing the particular value.

US Patent:

20160275100, Sep 22, 2016

Filed:

Mar 15, 2016

Appl. No.:

15/071071

Inventors:

- OREM UT, US
Mark L. Rawlins - Lehi UT, US

International Classification:

G06F 17/30

Abstract:

A computerized method for storing multiple, distinct hierarchical data structures within a single ordered flat file. The method can comprise identifying a first hierarchically organized data structure and a second hierarchically organized data structure. The method can also comprise generating an ordered flat file comprising multiple entries—each entry can comprise an addressable location, a first linkage field, and a second linkage field. Further, the method can comprise generating a first ordered flat file representation of the first hierarchically organized data structure and a second ordered flat file representation of the second hierarchically organized data structure within the ordered flat file by determining linear linkages between each of the one or more tree nodes within the respective first hierarchically organized data structure and second hierarchically organized data structure. Individual linkages associated with each respective tree node can be stored within the various respective linkage fields.

US Patent:

20160275154, Sep 22, 2016

Filed:

Mar 15, 2016

Appl. No.:

15/071058

Inventors:

- OREM UT, US
Larry Nash - Provo UT, US
Dan Floyd - West Jordan UT, US
Mark Rawlins - Lehi UT, US

International Classification:

G06F 17/30

Abstract:

A server computer system can receive a database query comprising a request to return a calculated result based upon information stored in multiple entries within the hierarchically organized data structure. The server computer system accesses an ordered flat file database that comprises information stored within the hierarchically organized data structure. The information can include information associating each entry within the ordered flat file database with the entry's relative position within the hierarchically organized data structure. The server computer system can identify a first branch within the hierarchically organized data structure by reading the ordered flat file database progressively. The computer server system can then push one or more data entries upward within the first branch. Additionally, the computer system can identify a second branch within the hierarchically organized data structure by continuing to read the ordered flat file database progressively.

US Patent:

20160034700, Feb 4, 2016

Filed:

Jul 28, 2015

Appl. No.:

14/811555

Inventors:

- Orem UT, US
Dan Floyd - West Jordan UT, US
Mark Rawlins - Lehi UT, US
Jake Stowell - Orem UT, US

International Classification:

G06F 21/62
G06F 17/30

Abstract:

A server computer system can receive a database query directed towards returning information from one or more locations within a hierarchically organized data structure. A user identification can be associated with a particular entry within the hierarchically organized data structure. The system can then access an ordered flat file database that comprises the information stored within the hierarchically organized data structure. The stored information can include information associating each entry within the hierarchically organized data structure with the entry's relative position within the hierarchically organized data structure. The system can also return a query response that excludes particular information based upon a permission attribute applied to sequential entries within the ordered flat file database.