Larry B Nash

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:

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.