Method and system for displaying a relational abstraction of a data store

• US 20050021538A1
• Filed: 01/09/2004
• Published: 01/27/2005
• Est. Priority Date: 07/25/2003
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: ActiveViews, Inc. (Microsoft Corporation)
• Inventors: Meyers, Robert Alan, Meyers, Aaron Stephen, Meyers, Eric Stephen
• Application Number:
  US10/754,288
• Publication Number:
  US 20050021538A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2423 Interactive query statement specification based on a database schema
• CPC Class Codes: G06F 16/2428 Query predicate definition using graphical user interfaces, including menus and forms G06F16/2423 takes precedence
• CPC Class Codes: G06F 16/248 Presentation of query results

Abstract

A method and system for displaying a relational abstraction data store are disclosed. A relational abstraction of a data store is defined, the definition including a plurality of views, scalar or aggregate fields associated with the views, and relations between the views. The fields and relations associated with views are displayed and related to a base view through a sequence of relations. The fields displayed are constrained based upon the sequence of relations from the base view. Scalar fields are displayed where the sequence of relations does not contain a to-many relation. Aggregate fields are displayed where the sequence of relations contains at least one to-many relation. Distinct aggregate fields are displayed where the relation path sequence contains a to-many relation followed by a many-to-one relation. A field may be displayed with additional information indicating how, or whether, the fields may be used. The display of fields may be constrained in predetermined ways. The display of relations may be displayed with additional information about the nature of the relations and the sequence of the relation path. Fields and relations may be displayed using a hierarchical means of display such as in trees structures or lists, or may be displayed using a natural language description.

Claims

1. A method for displaying a relational abstraction of a data store, comprising the steps of:

a) defining a relational abstraction of a data store, the definition including a plurality of views, scalar or aggregate fields associated with the views, and relations between the views; and

b) displaying the fields and relations associated with a view related to a base view through a sequence of one or more relations.

2. The method of claim 1 wherein the view is the base view and the sequence of relations is empty.

3. The method of claim 1 wherein the fields displayed are constrained to scalar fields where the sequence of relations does not contain a to-many relation.

4. The method of claim 1 wherein the fields displayed are constrained to aggregate fields where the sequence of relations contains at least one to-many relation.

5. The method of claim 1 wherein a field is displayed with additional information indicating at least one way the field may be used.

6. The method of claim 5 wherein an aggregate field is displayed with additional information indicating it may be used to generate a total.

7. The method of claim 5 wherein a field for which grouping is meaningful is displayed with additional information indicating the field may be used for grouping.

8. The method of claim 1 wherein the fields displayed are constrained to those which may be used in a predetermined way.

9. The method of claim 8 wherein the fields displayed are constrained to aggregate fields when a selected field will be used to generate a total.

10. The method of claim 8 wherein the fields displayed are constrained to those for which grouping is meaningful when a selected field will be used for grouping.

11. The method of claim 1 wherein additional information is displayed indicating there may be one or many items in a related view associated with a single item in a previous view in the relation sequence.

12. The method of claim 1 wherein additional information is displayed indicating there may be duplicate items in a related view associated with a single item in a previous view in the relation sequence.

13. The method of claim 1 wherein the means of displaying the fields associated with a view is any means of displaying hierarchical data.

14. The method of claim 13 wherein the means of displaying the fields associated with a view is a tree.

15. The method of claim 13 wherein the means of displaying the fields associated with a view is a list.

16. The method of claim 1 wherein the means of displaying the relations originating from a view is any means of displaying hierarchical data.

17. The method of claim 16 wherein the means of displaying the relations originating from a view is a tree.

18. The method of claim 16 wherein the means of displaying the relations originating from a view is a list.

19. The method of claim 1 wherein the sequence of relations is displayed.

20. The method of claim 19 wherein the means of displaying the sequence of relations is a list.

21. The method of claim 19 wherein the means of displaying the sequence of relations is a delimited path.

22. The method of claim 19 wherein the means of displaying the sequence of relations is a natural language description.

23. The method of claim 8 wherein the means of specifying a predetermined field usage is the selection of a target area.

24. The method of claim 8 wherein the means of specifying a predetermined field usage is a plurality of buttons.

25. The method of claim 8 wherein the means of specifying a predetermined field usage is a plurality of menu items.

26. A computer system for displaying a relational abstraction of a data store, the system comprising:

a) means for defining a relational abstraction of a data store, the definition including a plurality of views, scalar or aggregate fields associated with the views, and relations between the views; and

b) means for displaying the fields and relations associated with a view, the view comprising a base view or a view related to a base view through a sequence of one or more relations.