WO2017008858A1

WO2017008858A1 - Improvements in or relating to data structures

Info

Publication number: WO2017008858A1
Application number: PCT/EP2015/066250
Authority: WO
Inventors: Jos LOECKX
Original assignee: Chapps Ip
Priority date: 2015-07-16
Filing date: 2015-07-16
Publication date: 2017-01-19

Abstract

Described herein is a hierarchical data structure comprising a plurality of data levels, each data level being associated with and linked with at least one other data level. A property record includes such a hierarchical data structure in which the property comprises a first data level (400). At least the interior of the property comprises second data level (500) with which is associated at least one third data level (600, 610, 620, 630, 640, 650, 660). In turn, each third data level is associated with at least one fourth data level (700, 710, 720) etc. The fourth data level (700) is set as a focus level providing access to associated fifth data level (800, 810, 820, 830, 840, 850, 800a, 810a, 820a, 830a, 840a) and associated sixth data level (900a, 910a, 920a, 930a). Toggling at the focus level collapses or expands lower data levels whilst maintaining access to higher data levels.

Description

IMPROVEMENTS IN OR RELATING TO DATA STRUCTURES

Field of the invention

The present invention relates to improvements in or relating to data structures, and is more particularly, although not exclusively, concerned with hierarchical data structures.

Background of the invention

For the property rental market, it is important that an accurate inspection of a property is made both at the start and at the end of a rental period. Such inspections are designed to determine the status of the property, and any inventory within the property (if applicable) at predetermined periods of time. Before the initial rental of a property, a checklist needs to be generated against which subsequent inspections are compared to determine if the property has been damaged in any way during rental periods.

An initial inspection tends to be time-consuming as each aspect of the property, for example, each room, fixtures and fittings within each room etc., needs to be catalogued in detail in order to protect the landlord or management company renting the property. Subsequent inspections may also be time-consuming as they need to be compared to the initial inspection report (or latest inspection report if there is more than one inspection report).

Whilst there are software applications that assist in these property inspections, they tend to be cumbersome to use as navigation through the application requires a great deal of scrolling through and resizing of the display to be able to access the relevant information. This particularly cumbersome when using a device with a limited screen size as such tablets and smartphones etc., which are more portable than larger devices such as laptops.

Summary of the invention

It is therefore an object of the present invention to provide a method of providing ready access to each aspect of a property in a property registry without having to perform excessive scrolling and resizing of a display.

It is a further object of the present invention to provide a hierarchical data structure which allows easy access between all data levels within the structure.

In accordance with one aspect of the present invention, there is provided a hierarchical data structure comprising:- a data hierarchy comprising at least one first data level and a plurality of subsequent data levels associated with said at least one first data level, each first data level and associated plurality of subsequent data levels forming a tree structure; and

at least one focus level corresponding to at least one of said plurality of subsequent data levels, each focus level being configured to expand and to collapse subsequent data levels at a data level lower than the focus level while maintaining access to the associated first data level and subsequent data levels higher than the focus level.

By providing a focus level, it is possible to move between expanded data levels below the focus level whilst still providing visibility and access to higher data levels without unnecessary scrolling.

In general, said focus level corresponds to an mth data level, and n data levels below the mth data level are expandable and collapsible from the mth data level, where m corresponds to an integer greater than 1 and n corresponds to an integer which is greater than 2.

Each focus level may form a head of a sub-tree structure within the tree structure. This enables each focus level and its associated subsequent lower data levels to be readily discernible and accessible. The sub-tree structure may be displayed either alone or with the main tree structure.

In one embodiment, the hierarchical data structure comprises more than one focus level, each focus level being configured to expand and collapse subsequent data levels separately.

In this way, the hierarchical data structure can be tailored to the requirements of any data record.

Each focus level may be assigned to a different data level. Alternatively, each focus level is assigned to the same data level. In this way, the hierarchical data structure can readily be configured for multi-level or same level access.

In one embodiment, each focus level is configured to expand and collapse subsequent data levels simultaneously. This provides a way of providing ready access to the subsequent data levels at the same time.

In another embodiment, each focus level is configured to expand and collapse subsequent data levels one at a time. This provides a more controlled way of providing access to the subsequent data levels.

In a further embodiment, at least one data level is omitted from the hierarchical data structure and at least one data level lower than the at least one omitted data level is directly associated with at least one data level higher than the at least one omitted data level. In accordance with another aspect of the present invention, there is provided a multi-level data record having a hierarchical data structure as described above.

The multi-level data record may relate to a property to be managed, wherein the property comprises the first data level and the plurality of subsequent data levels associated with the first data level relate to at least one feature associated with that property.

In one embodiment, said at least one feature may comprise an aspect of the property to be managed and which is at a second data level of the hierarchical data structure. Said at least one feature may comprise a parameter related to the aspect of the property and which is at a third data level. Said at least one feature may comprise an element related to the parameter and which is at a fourth data level of the hierarchical data structure. Said at least one feature may comprise a detail related to the element and which is at a fifth data level of the hierarchical structure. Said at least one feature may comprise an item related to the detail and which is at a sixth data level of the hierarchical data structure.

In accordance with a further aspect of the present invention, there is provided a computer-implemented method for generating a hierarchical data structure, the method comprising:- configuring a data hierarchy which comprises at least one first data level and a plurality of subsequent data levels associated with said at least one first data level, each first data level and associated plurality of subsequent data levels forming a tree structure; and

configuring at least one of said plurality of subsequent data levels as a focus level, the focus level being configured to expand and to collapse subsequent data levels at a data level lower than the configured focus level while maintaining access to data levels higher than the focus level.

By configuring the hierarchical data structure in this way, ready access is provided to all data levels in the tree structure without excessive scrolling.

In accordance with yet a further aspect of the present invention, there is provided a non-transitory computer readable medium storing a program for causing a computer to execute the steps of the method described above.

Brief description of the drawings

For a better understanding of the present invention, reference will now be made, by way of example, to the accompanying drawings in which:-

Figure 1 illustrates a comparison between a hierarchical data structure having "no focus" and having a "focus" in accordance with the present invention;

Figure 2 illustrates toggling between the "focus" shown in Figure 1 and a "high focus" and between the "focus" and an "in-depth focus" in accordance with the present invention;

Figure 3 illustrates a comparison between a hierarchical data structure having "no group focus" and one having a "group focus";

Figure 4 illustrates an example of a plurality of property records in a hierarchical structure in accordance with the present invention;

Figure 5 illustrates an example of a hierarchical structure in the form of a property inspection record;

Figure 6 illustrates the property inspection record of Figure 5 in more detail; Figure 7 is similar to Figure 6 but illustrating features associated with one aspect of the property inspection record in more detail;

Figure 8 illustrates is similar to Figure 7 but illustrating details relating to one of the elements of the property inspection record; and

Figure 9 illustrates an example of the hierarchical structure with respect to an aspect of the property inspection record.

Description of the invention

The present invention will be described with respect to particular embodiments and with reference to certain drawings but the invention is not limited thereto. The drawings described are only schematic and are non-limiting. In the drawings, the size of some of the elements may be exaggerated and not drawn on scale for illustrative purposes.

Although the present invention will be described with reference to a particular implementation of the invention, it will readily be appreciated that the invention can have other implementations. In accordance with the present invention, navigation in a hierarchical tree structure is optimised by providing a "focus level" (a working data level) and an associated "focus group" (data levels associated with the working data level). The tree structure comprises a plurality of data levels which may be considered to be either folders containing pieces of information or single pieces of information. A specific focus system has been created to provide more efficient navigation through the hierarchical tree structure.

A toggle function is provided which maintains access to levels below the focus level whilst providing access, if needed, to higher data levels. The toggle function also enables data levels below the focus level to be expanded or compressed as required. In accordance with the present invention, in a hierarchical data structure with more than one main data level and where each main data level has underlying or subsequent levels, navigation through the hierarchical data structure is achieved using the focus level which can be selected at any data level within the data structure.

The selected focus level forms a 'head' data level which is at a lower or subsequent level than the main data level. Data levels below the 'head' data level can be collapsed and expanded within the hierarchical tree structure using a toggle function associated with the focus level. This collapsing and expanding of the data levels enables the nesting of the tree structure to be visible below the focus level as required.

In one embodiment, the data levels below the focus level can be expanded one at a time so that only one is accessible at any one time.

In another embodiment, more than one focus level may be provided and each focus level and associated lower or subsequent data levels can be used independently of one another.

The terms "hierarchical data structure" and "hierarchical tree structure" as used herein refer to a data or tree structure which has a main data level from which subsequent or lower data levels depend.

The term "main data level" as used herein refers to a data level at the top of a hierarchical tree structure.

The terms "subsequent data level" and "lower data level" as used herein refer to data levels which are below the main data level in the hierarchical tree structure. It will readily be understood that the term subsequent or lower data levels may also be used when referring to data levels which are relative to data levels other the main data level, for example, third and fourth data levels are below first and second data levels. The term "higher data level" as used herein refers to a data level which is at a higher level in the hierarchical tree structure than a particular data level, for example, first and second data levels are higher than third and fourth data levels.

The term "data level entry" as used herein refers to the information or data stored at a particular data level within the hierarchical structure.

The term "omitted data level" as used herein refers to a data level that has been omitted between data levels. For example, in the hierarchical data structure, if there is a second data level and a fourth data level but not third data level, the third data level is the omitted data level. In effect, an omitted data level can only be between two existing data levels. It will readily be appreciated that there may be more than one omitted data level between two existing data levels. For clarity, an "omitted data level" is different to a "non-existent data level" as the data level above such a level comprises a terminating data level and forms the end of a branch of the tree structure forming the hierarchical data structure, and there are no data levels below the terminating data level.

The term "focus level" as used herein refers to a data level about which collapsing and expanding of subsequent or lower data levels takes place.

The term "high focus" as used herein refers to data levels above the focus level (higher data levels) and which are generally always accessible.

The term "in-depth focus" as used herein refers to data levels below the focus level (subsequent or lower data levels) which can be expanded for access and collapsed when access is no longer required. Figure 1 illustrates a hierarchical data structure in accordance with the present invention. The first (left-hand) column indicates a hierarchical structure in which there is "no focus" and the second (right- hand) column indicates a "focus" or focussed data structure where all data levels above a predetermined data level are shown but the data levels below the predetermined data level are collapsed or compressed and not accessible.

In this particular embodiment, two main data levels are shown where for "top level 1 ", only data levels at a third data level or higher are visible (where "higher" in this case means the first and second data levels) as the focus level is set at the third data level, and, for "top level 2", only the first and second data levels are shown as the focus level is set at the second data level.

Starting from the "focus" or focussed data structure as shown in the second (right-hand) column of Figure 1 and placing this column as a first or central column in Figure 2, it is possible to access "high focus" or higher data levels only as shown in a second or left-hand column by toggling between the "focus" and the "high focus". This toggling has the effect of compressing or collapsing the "focus" to provide access to only the first and second data levels of top level 1 and only the first data level of top level 2.

Similarly, starting from the "focus" in the first or central column, it is possible to access "in-depth focus" or lower data levels as indicated by a third or right-hand column by toggling between the "focus" and the "in-depth focus". Toggling between the "focus" and "in-depth focus" has the effect of expanding the "focus" to provide access to lower data levels in the hierarchical structure. In this case, for top level 1 , the third data levels are expanded to provide access to fourth data levels, and, for top level 2, the second data levels are expanded to provide access to third data levels. As shown for top level 2, the second sublevel or second data level provides a focus level at the third data level.

By using a "focus" or "focus level", an overview of the higher data levels is always present so that any one of such data levels can be accessed when required. Similarly, it is easy to go from the "focus" or "focus level" to "in-depth focus" or lower data levels.

Figure 3 illustrates a comparison between having "no focus group" (first or left-hand column) and having a "focus group" (second or right-hand column). In a hierarchical data structure, many data levels can be expanded at once; this multi-level expansion tends not to provide information that may be required at all levels. Scrolling is normally required to reach higher data levels which located in positions which are not immediately inaccessible. By having a "focus level", lower data levels can still be expanded but only when required so that there is ready accessibility to all higher data levels.

As shown in Figure 3, by choosing a "focus level" at the third data level as indicated in the first or left-hand column corresponding to the "no focus group", only the levels which are the same or higher are visible below the chosen "focus level" as shown in the second or right-hand column corresponding to "focus group". In this particular case, for the second sublevel (corresponding to a second data level) of top level 1 , only the fourth data levels are visible.

Naturally, the "focus level" can be selected in accordance with the desired accessibility of the data levels and can be re-selected as required to provide the appropriate focus. In particular, by combining a main "focus level" with a "focus group", it is possible to provide improved navigation throughout a hierarchical data structure. The present invention will be described in more detail below with respect to an implementation of the invention in a property management system in which at least list:- a property (first data level entry);

aspects of the property (second data level entries); parameters associated with each aspect of the property (third data level entries);

elements associated with each parameter (fourth data level entries);

details associated with each element (fifth data level entries); and

items associated with each detail (sixth data level entries).

Each aspect, each parameter, each element, each detail and each item comprises data or information relating to the property as a whole which is structured in a hierarchy to have different levels within the property record (first data level).

Although first to sixth data level entries will be described below, it will be appreciated that any number of data levels may be provided within the hierarchical structure. For example, there may be m data levels where m is an integer greater than 1.

In the present invention, a hierarchical data structure is used to provide a checklist which enables access to lower data levels within the property record whilst still providing visibility of higher data levels so that a user can readily toggle between a higher data level and a lower data level and vice versa to access the information or data at each data level and to be able to update the information as data stored at that data level as required. As described above, the toggling operates to collapse or expand the data levels below the focus level. The term "property record" as used herein refers to a record relating to a property to be managed using the property management system. A new property record can be created from a reference property or from a checklist, the reference property effectively comprising a template. The property record is considered to be a first data level for the embodiment of the invention described below.

The term "record" as used herein refers to a data record throughout the description which relates to aspects, parameters, elements, details and items associated with a property.

The term "aspect" as used herein refers to a feature relating to an individual property in a property management system, for example, interiors such as entrance halls, rooms, etc., and exteriors such as gardens, driveways etc. The interiors and exteriors may be listed separately at a higher level than the entrance halls, rooms etc., or at the same level. Each aspect is considered to be a second data level for the embodiment of the invention described below with a first toggle link linking it to at least its associated first data level.

The term "parameter" as used herein refers to a feature associated with an aspect, for example, walls, floors, ceilings etc. Each parameter is considered to be a third data level for the embodiment of the invention described below with a first toggle link linking it to at least its associated second data level.

The term "element" as used herein refers to a feature associated with a parameter, for example, light fittings, carpets etc. Each element is considered to be a fourth data level for the embodiment of the invention described below with a first toggle link linking it to at least its associated third data level. The term "detail" as used herein refers to a feature associated with an element, for example, light bulbs etc., and/or the condition of the element, for example, bad, good etc. Each detail is considered to be a fifth data level for the embodiment of the invention described below with a first toggle link linking it to at least its associated fourth data level.

The term "item" as used herein refers to a feature associated with a detail. Each item is considered to be a sixth data level for the embodiment of the invention described below with a first toggle link linking it to at least its associated fifth data level.

Although only six data levels are described herein, it will be appreciated that the hierarchical structure of the present invention is not limited to only six data levels, and may comprise more or fewer data levels in accordance with the particular data to be stored in the data record.

The term "feature" as used herein refers to data or information associated with a particular data level, for example, aspects, parameters, elements, details and items as described above.

The term "checklist" as used herein refers to a hierarchical structure in which information or data is stored and from which information or data can be retrieved. In particular, a checklist can be used for comparison with a physical object, for example, determining the presence of the object, its condition etc. A checklist can also be used to check whether an action has been completed or not.

Figure 4 illustrates a property management display 100 which comprises a plurality of property records 1 10, 120, 130, 140, 150. Each property record corresponds to a main or first data level within the hierarchical tree structure with which at least one subsequent or lower data level is associated. In this particular implementation of the present invention, more than one subsequent or lower data levels are associated with each main or first data level.

Although five property records are shown, it will be appreciated that any number of property records may be stored within a property management system associated with the property management display 100 and which are available for display as required. Selection of a property record opens the hierarchical data structure associated with the selected property record.

New property records can be created by selecting "Add property" link 160. This creates a window 170 in which information relating to the new property can be entered and saved. For each new property, an inspection record needs to be created which stores and links aspects, parameter, elements, details, items etc. of the particular property in a hierarchical structure.

The new property record may be based on a predefined checklist (or other hierarchical structure) relating to a particular property type, for example, a furnished apartment with two bedrooms, and is linked to the new property record.

As an alternative to basing the new property record on a predefined checklist, the new property record may be based on a reference property. By using a reference property, there is no need to re-define fully the property record but it may be necessary to make minor modifications customise the reference property record according to features in the new property record.

In either case, that is, if the new property record is to be created from a checklist or a reference property, the new property record for the new property can be tailored accordingly, for example, by adding and removing rooms, etc. When using a reference property to create a new inspection record, only the descriptions of the aspects, parameters, elements, etc. will be used and not the actual data stored in the base reference property record. In effect, the hierarchical structure of the reference property forms the basis for the hierarchical structure of the new property record and in particular, the new inspection record.

It will be appreciated that, when creating a new property record, only one new inspection record is created which relates to data associated with the property at each level in the hierarchical structure associated with the reference property. One of the inspection records for the reference property can be used as a reference or template for the creation of the new inspection record. At a later stage, when the property is to be vacated, a "move-out" inspection record can be created, based on the new inspection record for the new property, which is then available for use a reference for other new inspection records for new property records.

Figure 5 illustrates a property record 300 which includes information relating to the property, namely: at 310, the address of the property; at 320, the inspection record to be applied; at 330, information relating to access to the property; at 340, tenant details with the option to add a "Tenant's representative"; and, at 350, landlord details with the option to add a "Landlord's representation". In addition, circumstances may be selected as indicated at 360. This information is indicated when the property record 300 is selected as shown. Whilst this data may be considered to be second level data relating to the property, in this particular embodiment, this data does not have any subsequent or lower data levels and forms a specific branch of the hierarchical tree which is independent of the rest of the hierarchical data structure. Within the property record 300, the address of the property 400 is identified as the first data level of the hierarchical structure in accordance with the invention with Figure 4 illustrating a plurality of such first data level entries. The address of the property 400 is also reflected in bod 310 as described above.

Parameters relating to property record 400 are also indicated, for example, "interior" 500 and "building's envelope" 510, which correspond to the second data level and which are linked to the first data level. Other data stored at the second data level comprises, for example, "technical installations" 520, "keys" 530, "meters" 540 and "documents" 550. The second data level entries relating to the "building's envelope" 510 and the "technical installations" 520 are associated with lower data level entries as indicated by a character ">" in relevant data level entry as shown.

The second data level entry relating to the "interior" 500 has a character "v" which indicates that this data level entry has been expanded to provide access to its third data level entries as will be discussed in more detail below.

Not all the other information items may be linked to other data levels, for example, "keys" 530, "meters" 540 and "documents" 550 as described above where there is only a single data level. The fact that there is no link to a lower data level is indicated by the absence of a character ">" in relevant data level entry as shown.

Rooms 610, 620, 630, 640, 650, 660, 670 of the "interior" 500 are entries at the third data level and are linked to an associated second data level entry within the hierarchical data structure. As shown by the presence of a character ">" in each of the third data level entry indicates that there are at least one associated subsequent or lower data entry levels, for example, at least fourth data level entries. Only one such associated subsequent or lower data level entry is required for the presence of character ">", but in most instances of the embodiment described herein, there is more than one associated fourth data level entry with each third data level entry.

Whilst the "interior" 500 and "building's envelope" 510 are listed as second data level entries in this instance, in some embodiments, these second data level entries may not be present and the rooms 610, 620, 630, 640, 650, 660, 670 of the "interior" 500 may directly define the second data level entries.

Whilst the "building's envelope" 510 is listed at the second data level, in this embodiment, it will be appreciated that this data entry may either be linked directly to the first data level (the property 400 as shown) or be linked indirectly to the first data level via another data level which, in turn, is linked to the first data level either directly or indirectly. For example, not shown, the property record may comprise a second data level entry termed "facilities" which may include the features associated with the "building's envelope" 510, "technical installations" 520, "keys" 530, "meters" 540 and "documents" 550 at a third data level.

Rooms 610, 620, 630, 640, 650, 660, 670 associated with the "interior" 500 comprise third data levels in this embodiment, and include the following: "entrance" 610; "living room" 620; "kitchen" 630; "toilet" 640; "hallway" 650; "bedroom" 660 and "bathroom" 670. The third data level entries may be considered to be elements which are associated with a predetermined parameter or second data level entry. It will be appreciated that other rooms may be present (not shown) which would be included in the "interior" 500, for example, further bedrooms, a study, a dining room, etc. Each of the third data levels, that is, "entrance" 610; "living room" 620; "kitchen" 630; "toilet" 640; "hallway" 650; "bedroom" 660 and "bathroom" 670, are linked to an associated second data level, and, are also linked to associated fourth data level entries as will be described below with respect to Figures 6 to 9 below.

Figure 6 illustrates a property record 300a after a room or third data level entry (parameter) has been selected. In the specific embodiment illustrated, the entrance 600 has been selected which has elements "basic" 700, "equipment" 710 and "electricity" 720 at the fourth data level, the "basic" element 700 being expanded to show the details associated therewith, that is, entries at the fifth data level. In this case, selection of "basic" 700 at the fourth data level expands to show the entries at the fifth data level ("floor" 800, "ceiling" 810, "wall" 820, "door" 830, "window" 840 and "heating 850) as well as further information linked to that entry as indicated at 700a.

In this case, "basic" 700 at the fourth data level may be considered to be a focus level which enables the expansion and compression (collapse) of the lower levels as will be described in more detail below.

When the focus level corresponding to "basic" 700 is expanded, associated fifth data level entries are shown, for example "floor" 800, "ceiling" 810, "wall" 820, "door" 830, "window" 840, and "heating" 850. The fifth data level entries are shown both on the left-hand side of the record as a "high focus" and on the right-hand side of the record as "in- depth focus".

On the left-hand side of the record, it can clearly be seen that data levels at the same or at a higher level can readily be accessed. On the right-hand side of the record, the fourth data level entry corresponding to "basic" and referenced as 700a is shown linked to both respective fifth and sixth data level entries.

Entries at the fifth data level are indicated by the same reference numeral as on the left-hand side of the record 300a but with the suffix "a" added, and entries at the sixth data level are indicated by 900a, 910a, 920a, 930a etc. and which correspond to respective ones of the fifth level data entries 800a, 810a, 820a, 830a etc., which in this embodiment, comprises a plurality of forms for completion.

As shown, the expanded "basic" entry 700a also includes boxes 702a, 704a for indicating whether evaluation is possible or if further evaluation is not necessary. A check box 706a is also provided which indicates that the data entry at this level has been completed when checked.

In addition to linking the fifth data level entries 800a, 810a, 820a, 830a, 840a within the "basic" entry 700a, the sixth data level entries are displayed in an expanded view as indicated by 900a, 910a, 920a, 930a, 940a (only part of which is visible) etc. In the illustrated embodiment, the sixth data level entries comprise elements of each form 900a, 910a, 920a, 930a, 940a. In other embodiments, each item on the form may comprise another lower data level, for example, a seventh data level.

In the described embodiment, it will readily be appreciated that, in addition to being able to access directly data levels on the left-hand side of the record, it is possible to access directly the first, second, third and fourth data levels from either the sixth data level or from the fifth data level without having to scroll through all the subsequent and lower data levels associated with those higher data levels.

In summary, when selecting an entry at the fourth data level ("basic" 700) in the specific embodiment described, details for that entry, at the fifth data level, are displayed, for example, "floor" 800, "ceiling" 810, "wall" 820, "door" 830, etc., and, selecting an entry corresponding to a detail provides the items at the sixth data level, the form, which can be completed as part of the creation of a new inspection record or a subsequent or follow- up inspection record.

The checklist so generated comprises an intelligent focus system which ensures that it is always possible to see the higher data levels than the data level being accessed. The data level which is being accessed may be indicated in a different way to data levels not being accessed, for example, a different colour or highlighting can be used. Moreover, selection of the property 400 at the first data level operates to collapse or expand the checklist therefor so that the lower data levels are either made inaccessible or accessible respectively. Additionally, as described above, within the checklist, selection of a focus level at a particular level expands and collapses subsequent or lower data levels, for example, a focus level at "basic" 700 enables expanding and collapsing of the fifth and sixth data levels.

Figure 7 is similar to Figure 6 but illustrates a property record 300b for another property 400A. Identical components which have been described above with reference to Figures 5 and 6 are numbered the same and are not described again here in detail. Similar components to those described with reference to Figures 5 and 6 for a different property are numbered alike but with a suffix "A" added and are not described again here in detail.

In property record 300b as shown in Figure 7, inspection for fifth data level has been completed, that is, the "floor" 800A as shown on the left-hand side. Photos can be taken and stored part of the information at this data level as indicated by icon 802a, and, check box 804a can be checked to indicate that this entry is complete. A check box 806 may also be displayed with the fifth data level entry ("floor" 800A) to indicate the progress of the creation of the property record and corresponds to the check box 804a shown on the right-hand side of the record. In this example, the information relating to the "floor" 800b comprises sixth data level information 900b. Similarly, although not completed, for each fifth data level 810a, 820a, 830a, there is an associated and linked sixth data level 910a, 920a, 930a. For fifth data level 840a (only partly shown), it will readily be appreciated that there is a corresponding sixth data level (not shown).

Figure 8 illustrates a property record 300c for property 400 (as described above with reference to Figures 5 and 6). Components which have been described above with reference to Figures 5 and 6 are numbered the same and are not described again here in detail.

Property record 300c illustrates the selection of "door" 830 at the fifth data level on the left-hand side, this door being from the "entrance" (as "door" is at a level below the "entrance" 600) to the "kitchen". Naturally, if there are other "doors" from the "entrance" 600, although not specifically shown, these will be accessible from the fifth data level.

Returning to the specific embodiment illustrated in Figure 8, the selection of "door" 830 is expanded at 830a to display associated sixth data level information, namely, "structure" 900a, "material" 910a, "finishing" 920a, "colour" 930a, "parts" 940a, "evaluation" 950a, and "issues" 960a. In addition, photo data 970a, notes 980a and additional information 990a may be included either at the sixth data level or at a subsequent or lower data level.

Moreover, in other embodiments of the hierarchical data structure in accordance with the present invention, each of photo data 970a, notes 980a and additional information 990a may be at a different level than the sixth data level. For example, the hierarchical data structure may be compiled such that each of these features may be at a specific separate data level which is dedicated to "photo data", "notes" and "additional data" respectively.

In Figure 8, the selection of "door" 800 provides "door to kitchen" is shown in more detail on the right-hand side. It will readily be appreciated that similar sixth data level information may be provided for other doors (corresponding to fifth data level entries) into other rooms under "basic" (corresponding to fourth data level entries) which connect to the "entrance" 600 (third data level entry).

It is to be noted that doors between rooms, for example, kitchen to living room, bathroom to bedroom, etc., have two sides and may be considered as being part of the kitchen or living room, or, part of the bathroom or bedroom. In this case, these doors may comprise a different data level entry depending on other information with which the door is associated, that is, information within one of the rooms.

Figure 9 illustrates a property record 300d for a further property 400B. Components which are similar to those described above with reference to Figures 5 to 8 have the same reference number but with a suffix "B" added.

For property 400B, "furniture & accessories" 760B (fourth data level) have been selected for the "living room" 610B (third data level). Expansion of the fourth data level provides information at the fifth data level as shown at 760a. The "living room" 610B is shown with its fourth data levels, namely, "basic" 730B, "equipment" 740B, and "electricity" 750B. "Furniture & accessories" 760B is considered to be fourth data level information and is expanded at fifth data level to indicate items of furniture, such as, table 865b, chairs, 865c and couch 865d, with check box 865a being included in the expanded fourth data level information 760a. Here, information within the firth data level, that is, information indicated generally as 965b, 965c, 965d, correspond to sixth data level entries associated with respective ones of the fifth data level entries, that is, "table", "chairs", "couch" etc. As before, a check box 765B is shown in the same field as the "furniture & accessories" 760B to indicate that this has been completed.

It will readily be appreciated from the description above that information at a given data level does not need to be the same. For example, as described with reference to Figures 8 and 9, the fifth data level information may be included with the sixth data level information in different ways. In Figure 8, the sixth data level entries relate to "common characteristics" of "door" 830 (fifth data level), and in more particular, "door to kitchen". In Figure 9, the sixth data level entries relate to items relating to details (fifth data level) of an element (fourth data level) within a room ("living room" at a third data level).

However, if information of a specific type is to be allocated to a specific data level, more data levels will be required and the links between specific information will not follow the 'nested' groupings as described above. For example, all first data level entries are defined as properties, all second level entries are defined as either being an "interior" or an "exterior", all third data level entries are defined as rooms, all fourth data level entries include "furniture & accessories", all fifth data level entries are defined as being "items", and all sixth data level entries are defined as relating to "condition" of the items, then, for an "exterior", there are no rooms but there may be "furniture & accessories" which relate to the "exterior" (garden tables, garden chairs, hammocks etc.). In this case, there is no third data level and fourth data level ("furniture & accessories") may be associated directly with second data level ("exterior").

Naturally, each feature in the hierarchical data structure needs to be listed in accordance with its relevance to the particular data to be stored therein. As an example, external windows (windows looking from the inside of the property to the outside of the property) form part of both the "interior" and the "exterior" and need to be categorised and assigned the correct data level accordingly. In effect, the same window may be assigned to a different data level when considering the "exterior" of the property than the data level to which it is assigned on the "interior" of the property.

For example, "window" 840 is classified as a fifth data level entry as shown in Figure 8 when associated with a fourth data level ("basic" 700) of a room ("entrance" 600 - third data level) of the "interior" 500 (second data level). For the "exterior" (second data level), the third data levels may comprise "garden", "walls", "roof", "garage", etc., with the "windows" nominally being at the fourth data level and associated with the "walls". However, for consistency with the "interior", each window may be classified at the same level as the "interior". As described above, "window" 840 is at a fifth data level in the "interior" and therefore the same "window" associated with the "exterior" is classified at the fifth data level instead of the fourth data level. In this way, the fifth data level (the "window" associated with the "exterior") is directly associated with the third data level (the "walls") and there is no fourth data level. The fourth data level in this case is considered to be an omitted data level which exists between the third data level and the fifth data level.

It will readily be understood that the "window" from the "interior" may be assigned to be at the same data level as the "window" from the "exterior" with data levels being skipped to provide the desired consistency. In addition, the "windows" may be at a different data level than that associated with the "interior" and/or the "exterior" if desired.

It will be appreciated that, in accordance with the present invention, data in a data record may be assigned to one or more data levels depending on the complexity of the data, and, the hierarchical data structure can be configured to accommodate that complexity whilst providing the ability to have a focus level which allows expanding and collapsing of subsequent of lower data levels while maintaining accessibility to higher data levels, that is, all data levels higher than the focus level and the focus level itself.

More than one focus level may be provided which enables subsequent or lower data levels associated with each focus level to be accessible simultaneously. Each focus level could be considered to be the 'head' of a "sub-tree" extending therefrom within the overall hierarchical data structure. This provides access to each focus level and associated subsequent or lower data levels so that it is possible to switch between two or more 3 "sub-trees" of the hierarchical data structure. In addition, switching between "sub-trees" of the hierarchical data structure has the effect of collapsing a first "sub-tree" and expanding a second "sub-tree" so that only one "sub-tree" is expanded at any one time. For example, if there are three or more focus levels each of which forms a head of a "sub-tree", only one set of associated subsequent or lower data levels are accessible at any one time, and, moving from "sub-tree" to another, that is, from a first "sub-tree" to a second "sub-tree", has the effect of expanding a second set of associated subsequent or lower data levels associated with the second "sub-tree" and collapsing a first set of associated subsequent or lower data levels associated with the first "sub-tree" etc.

Claims

CLAIMS:

1. A hierarchical data structure comprising:- a data hierarchy comprising at least one first data level and a plurality of subsequent data levels associated with said at least one first data level, each first data level and associated plurality of subsequent data levels forming a tree structure; and

2. A hierarchical data structure according to claim 1 , wherein said focus level corresponds to an mth data level, and n data levels below the mth data level are expandable and collapsible from the mth data level, where m corresponds to an integer greater than 1 and n corresponds to an integer which is greater than 2.

3. A hierarchical data structure according to claim 1 or 2, wherein each focus level forms a head of a sub-tree structure within the tree structure.

4. A hierarchical data structure according to any one of claims 1 to 3, comprising more than one focus level, each focus level being configured to expand and collapse subsequent data levels separately.

5. A hierarchical data structure according to claim 4, wherein each focus level is assigned to a different data level.

6. A hierarchical data structure according to claim 4, wherein each focus level is assigned to the same data level.

7. A hierarchical data structure according to any one of claims 4 to 6, wherein each focus level is configured to expand and collapse subsequent data levels simultaneously.

8. A hierarchical data structure according to any one of claims 4 to 6, wherein each focus level is configured to expand and collapse subsequent data levels one at a time.

9. A hierarchical data structure according to any one of claims 1 to 8, wherein at least one data level is omitted and at least one data level lower than the at least one omitted data level is directly associated with at least one data level higher than the at least one omitted data level.

10. A multi-level data record having a hierarchical data structure according to any one of claims 1 to 9.

1 1 . A multi-level data record according to claim 10, relating to a property to be managed, wherein the property comprises the first data level and the plurality of subsequent data levels associated with the first data level relate to at least one feature associated with that property.

12. A multi-level data record according to claim 1 1 , wherein said at least one feature comprises an aspect of the property and which is at a second data level of the hierarchical data structure.

13. A multi-level data record according to claim 12, wherein said at least one feature comprises a parameter related to the aspect of the property and which is at a third data level of the hierarchical data structure.

14. A multi-level data record according to claim 13, wherein said at least one feature comprises an element related to the parameter and which is at a fourth data level of the hierarchical data structure.

15. A multi-level data record according to claim 14, wherein said at least one feature comprises a detail related to the element and which is at a fifth data level of the hierarchical data structure.

16. A multi-level data record according to claim 15, wherein said at least one feature comprises an item related to the detail and which at a sixth data level of the hierarchical data structure.

17. A computer-implemented method for generating a hierarchical data structure, the method comprising:- configuring a data hierarchy which comprises at least one first data level and a plurality of subsequent data levels associated with said at least one first data level, each first data level and associated plurality of subsequent data levels forming a tree structure; and

18. A method according to claim 17, wherein said focus level corresponds to an mth data level, and n data levels below the mth data level are expandable and collapsible from the mth data level, where m corresponds to an integer greater than 1 and n corresponds to an integer which is greater than 2.

19. A method according to claim 17 or 18, further comprising configuring each focus level to form a head of a sub-tree structure within the tree structure.

20. A method according to any one of claims 17 to 19, further comprising configuring more than one focus level, and configuring each focus level to expand and collapse subsequent data levels separately.

21 . A method according to claim 20, wherein each focus level is configured at a different data level.

22. A method according to claim 20, wherein each focus level is configured at the same data level.

23. A method according to any one of claims 20 to 22, further comprising configuring each focus level to expand and collapse subsequent data levels simultaneously.

24. A method according to any one of claims 20 to 22, further comprising configuring each focus level to expand and collapse subsequent data levels one at a time.

25. A method according to any one of claims 17 to 24, further comprising omitting at least one data level and directly associating at least one data level lower than the at least one omitted data level with at least one data level higher than the at least one omitted data level.

26. A method according to any one of claims 17 to 25, wherein the hierarchical data structure comprises a multi-level data record.

27. A non-transitory computer readable medium storing a program for causing a computer to execute the steps of the method according to any one of claims 17 to 26.