Methods, apparatus and data structures for providing a uniform representation of various types of information

• US 20030126151A1
• Filed: 02/13/2003
• Published: 07/03/2003
• Est. Priority Date: 06/03/1999
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Edward K. Jung
• Inventors: Jung, Edward K.
• Granted Patent: US 6,950,827 B2
• Time in Patent Office: Days
• US Class Current: 707/100
• CPC Class Codes: G06F 16/86 Mapping to a database
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

Methods and apparatus for analyzing tasks performed by computer users by (i) gathering usage data, (ii) converting logged usage data into a uniform format, (iii) determining or defining task boundaries, and (iv) determining a task analysis model by “clustering” similar tasks together. The task analysis model may be used to (i) help users complete a task (such help, for example, may be in the form of a gratuitous help function), and/or (ii) to target marketing information to users based on user inputs and the task analysis model. The present invention also provides a uniform semantic network for representing different types of objects in a uniform way.

Claims

1. A method for representing steps corresponding to user inputs to a machine-based application in a uniform way, the method comprising steps of:

a) representing the machine-based application as related entities; and

b) representing the steps as a sub-set of related entities of the related entities representing the machine-based application.

2. The method of claim 1 wherein any attributes of the related entities representing the machine-based application are represented by entities which participate in a relationship with the entities to which they belong.

3. The method of claim 1 wherein the entities representing the machine-based application include machine-executable instructions defining methods.

4. The method of claim 1 wherein the machine-based application is a database interface and wherein the entities are related resources of the database.

5. The method of claim 4 wherein the related resources include at least one of structured objects, active objects, and linear objects.

6. The method of claim 1 wherein the machine-based application is a database interface, wherein the user inputs are queries to the database, and wherein the entities are related resources of the database.

7. The method of claim 6 wherein the related resources include at least one of structured objects, active objects, and linear objects.

8. The method of claim 1 wherein the user inputs are events, and wherein the entities are machine-executable instructions defining methods invoked by the events.

9. An apparatus for representing steps corresponding to user inputs to a machine-based application in a uniform way, the apparatus comprising:

a) means for representing the machine-based application as related entities; and

b) means for representing the steps as a sub-set of related entities of the related entities representing the machine-based application.

10. A machine readable medium having machine executable instructions which, when executed by the machine perform steps for representing steps corresponding to user inputs to a machine-based application in a uniform way, the steps comprising:

a) representing the machine-based application as related entities; and

b) for representing the steps as a sub-set of related entities of the related entities representing the machine-based application.

11. A machine readable medium having a data structure comprising:

a) related entities representing steps corresponding to user inputs to a machine-based application in a uniform way; and

b) a sub-set of related entities of the related entities representing the machine-based application representing the steps.

12. The machine readable medium of claim 11 wherein any attributes of the related entities representing the machine-based application are represented by entities which participate in a relationship with the entities to which they belong.

13. The machine readable medium of claim 11 wherein the entities representing the machine-based application include machine-executable instructions defining methods.

14. The machine readable medium of claim 11 wherein the machine-based application is a database interface and wherein the entities are related resources of the database.

15. The machine readable medium of claim 14 wherein the related resources include at least one of structured objects, active objects, and linear objects.

16. The machine readable medium of claim 11 wherein the machine-based application is a database interface, wherein the user inputs are queries to the database, and wherein the entities are related resources of the database.

17. The machine readable medium of claim 16 wherein the related resources include at least one of structured objects, active objects, and linear objects.

18. The machine readable medium claim 11 wherein the user inputs are events, and wherein the entities are machine-executable instructions defining methods invoked by the events.

19. A method for representing structured, linear, and active information in a uniform way, the method comprising steps of:

a) mapping structured information, if present, to a uniform representation;

b) mapping linear information, if present, to the uniform representation; and

c) mapping active information, if present, to the uniform representation.

20. The method of claim 19 wherein the uniform representation is a collection of elements,

wherein each of the elements is one of an entity and a relation, and

wherein a relation relates two ordered elements.

21. The method of claim 20 wherein a container entity contains other elements.

22. The method of claim 19 wherein the uniform representation is expressed as a list of predicates.

23. The method of claim 20 wherein the uniform representation is expressed as a list of predicates.

24. The method of claim 20 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as a hierarchy,

A) representing nodes of the hierarchy as entities, and

B) generating parent/child relations between the entities, consistent with the hierarchy.

25. The method of claim 20 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as a table,

A) representing the table as an entity,

B) representing column names of the table as entities,

C) representing row numbers of the table as entities,

D) generating contains relations between the entity representing the table and each of the entities representing the column names and row numbers,

E) generating entities corresponding to information contained in the table, and

F) generating contains relations between the entities representing the column names and row numbers and entities corresponding to the information contained in the table, consistent with the table.

26. The method of claim 20 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as a table,

A) representing the table as an entity,

B) representing column names of the table as an entity,

C) representing a dimension of the table as an entity,

D) representing information contained in the table as an entity,

E) generating a schema relation between the entity representing the table and the entity representing the column name,

F) generating a data relation between the entity representing the table and the entity representing information contained in the table, and

G) generating a dimension relation between the entity representing the tale and the entity representing a dimension of the table.

27. The method of claim 20 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as an entity-relationship diagram,

A) representing each of any attributes as an entity, and

B) generating has—

a relations between each of the entities representing attributes and the entities to which the attributes belonged, consistent with the entity-relationship diagram.

28. The method of claim 20 wherein the step of mapping linear information, if present, to a uniform representation, includes sub-steps of:

i) parsing the linear information into pieces;

ii) representing each of the pieces with an entity; and

iii) generating a proceeds/follows relation between each of the entities representing adjacent parsed pieces.

29. The method of claim 28 wherein the pieces are selected from a group consisting of (a) words, (b) sentences, (c) paragraphs, (d) sections, (e) headings, (f) phrases, and (g) alphanumeric strings.

30. The method of claim 20 wherein the step of mapping linear information, if present, to a uniform representation, includes sub-steps of:

i) representing a name of the sequence with an entity;

ii) representing the information of the sequence with an entity; and

iii) generating a data relation between the entity representing the name of the sequence and the entity representing the information of the sequence.

31. The method of claim 20 wherein the step of mapping active information, if present, to a uniform representation, includes sub-steps of:

i) representing a name of the active information as an entity;

ii) representing properties, if any, of the active information as entities;

iii) generating an of relation between the entity representing the name of the active information and each of the entities, if any, representing the properties of the active information;

iv) representing methods, if any, of the active information as entities; and

v) generating a to relation between the entity representing the name of the active information and each of the entities, if any, representing the methods of the active information.

32. The method of claim 31 wherein if a method gets a property, then further:

vi) generating a get relation between an entity representing the method and an entity representing the property.

33. The method of claim 31 wherein if a method sets a property, then further:

vi) generating a set relation between an entity representing the method and an entity representing the property.

34. The method of claim 31 wherein, if a method of the active information has parameters, then further:

vi) generating entities representing each of the parameters;

vii) generating a parameter list entity;

viii) generating a parameters—

of relation between the entity representing the method and the parameter list entity; and

ix) generating a contains relation between the parameter list entity and each of the entities representing the parameters.

35. The method of claim 19 wherein the uniform representation may include logical inconsistencies.

36. The method of claim 19 wherein the uniform representation may include ambiguities.

37. A machine readable medium having machine executable instructions which, when executed by the machine perform steps for representing structured, linear, and active information in a uniform way, the steps comprising:

a) mapping structured information, if present, to a uniform representation;

b) mapping linear information, if present, to the uniform representation; and

c) mapping active information, if present, to the uniform representation.

38. The method of claim 37 wherein the uniform representation is a collection of elements,

wherein each of the elements is one of an entity and a relation, and

wherein a relation connects two ordered elements.

39. The method of claim 38 wherein a container entity contains other elements.

40. The method of claim 37 wherein the uniform representation is expressed as a list of predicates.

41. The method of claim 38 wherein the uniform representation is expressed as a list of predicates.

42. The method of claim 38 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as a hierarchy,

A) representing nodes of the hierarchy as entities, and

B) generating parent/child relations between the entities, consistent with the hierarchy.

43. The method of claim 38 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as a table,

A) representing the table as an entity,

B) representing column names of the table as entities,

C) representing row numbers of the table as entities,

D) generating contains relations between the entity representing the table and each of the entities representing the column names and row numbers,

E) generating entities corresponding to information contained in the table, and

F) generating contains relations between the entities representing the column names and row numbers and entities corresponding to the information contained in the table, consistent with the table.

44. The method of claim 38 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as a table,

A) representing the table as an entity,

B) representing column names of the table as an entity,

C) representing a dimension of the table as an entity,

D) representing information contained in the table as an entity,

E) generating a schema relation between the entity representing the table and the entity representing the column name,

F) generating a data relation between the entity representing the table and the entity representing information contained in the table, and

G) generating a dimension relation between the entity representing the tale and the entity representing a dimension of the table.

45. The method of claim 38 wherein the step of mapping structured information, if present, to a uniform representation, includes sub-steps of:

i) if the information is structured as an entity-relationship diagram,

A) representing each of any attributes as an entity, and

B) generating has—

a relations between each of the entities representing attributes and the entities to which the attributes belonged, consistent with the entity-relationship diagram.

46. The method of claim 38 wherein the step of mapping linear information, if present, to a uniform representation, includes sub-steps of:

i) parsing the linear information into pieces;

ii) representing each of the pieces with an entity; and

iii) generating a proceeds/follows relation between each of the entities representing adjacent parsed pieces.

47. The method of claim 46 wherein the pieces are selected from a group consisting of (a) words, (b) sentences, (c) paragraphs, (d) sections, (e) headings, (f) phrases, and (g) alphanumeric strings.

48. The method of claim 38 wherein the step of mapping linear information, if present, to a uniform representation, includes sub-steps of:

i) representing a name of the sequence with an entity;

ii) representing the information of the sequence with an entity; and

iii) generating a data relation between the entity representing the name of the sequence and the entity representing the information of the sequence.

49. The method of claim 38 wherein the step of mapping active information, if present, to a uniform representation, includes sub-steps of:

i) representing a name of the active information as an entity;

ii) representing properties, if any, of the active information as entities;

iii) generating an of relation between the entity representing the name of the active information and each of the entities, if any, representing the properties of the active information;

iv) representing methods, if any, of the active information as entities; and

v) generating a to relation between the entity representing the name of the active information and each of the entities, if any, representing the methods of the active information.

50. The method of claim 49 wherein if a method gets a property, then further:

vi) generating a get relation between an entity representing the method and an entity representing the property.

51. The method of claim 49 wherein if a method sets a property, then further:

vi) generating a set relation between an entity representing the method and an entity representing the property.

52. The method of claim 49 wherein, if a method of the active information has parameters, then further:

vi) generating entities representing each of the parameters;

vii) generating a parameter list entity;

viii) generating a parameters—

of relation between the entity representing the method and the parameter list entity; and

ix) generating a contains relation between the parameter list entity and each of the entities representing the parameters.

53. The method of claim 37 wherein the uniform representation may include logical inconsistencies.

54. The method of claim 37 wherein the uniform representation may include ambiguities.

55. A machine readable medium having a data structure comprising at least three elements, each of the elements being one of an entity and a relation,

wherein a relation connects two ordered elements, and

wherein an entity may represent any one of

a) an attribute of an entity-relationship diagram,

b) an entry from information structured as a hierarchy,

c) a column name of a table,

d) a row number of a table,

e) an entry from a table,

f) text from information structured as a sequence,

g) a name of active information,

h) a property of active information,

i) a method of active information, and

j) a parameter of a method of active information.

56. The machine readable medium of claim 55 wherein, in the data structure, an entity may contain elements.

57. The machine readable medium of claim 55 wherein the data structure is expressed as a list of predicates.