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.

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.

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.