Representing software development item relationships via a graph

• US 7,739,653 B2
• Filed: 07/05/2005
• Issued: 06/15/2010
• Est. Priority Date: 07/05/2005
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Venolia, Gina D.
• Primary Examiner(s): CHAVIS, JOHN Q
• Application Number:
  US11/175,568
• Publication Number:
  US 20070011659A1
• Time in Patent Office: 1,806 Days
• Field of Search: 717/101
• US Class Current: 717/101
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/9038 Presentation of query results
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957

Abstract

Software development items can be represented in a graph data structure. Relationships between the represented items can be detected and reflected in the graph data structure. Queries can be run against the data structure to determine which software development items are related to each other. Implicit query can be implemented in a software development context. A graph browser can present panes showing related items.

Claims

1. One or more computer-readable storage media having computer-executable instructions for performing a method comprising:

receiving a request to indicate software development items related to a specified software development item;

responsive to the request, inspecting a data structure representing software development items as a plurality of nodes in a graph data structure, wherein the specified software development item is represented as one of the nodes in the graph data structure;

detecting at least one relationship for a plurality of the software development items represented in the graph data structure;

responsive to detecting the relationship, representing the detected relationship in the graph data structure; and

presenting results indicating the software development items having nodes connected in the data structure to the node representing the software development item in the graph data structure for the specified software development item;

wherein the presenting ranks the software development items according to distance from one or more nodes meeting specified criteria; and

wherein the computer-readable storage media further comprise computer-executable instructions for performing at least one selected from the group consisting of;

weighting the distance based on edge cost within the graph data structure; and

ranking based at least on a number of edges incident to an intervening node between two nodes.

2. The one or more computer-readable media of claim 1 wherein:

the detecting comprises detecting relationships in a plurality of disconnected data collections;

whereby the graph data structure represents the relationships detected in the plurality of disconnected data collections.

3. The one or more computer-readable media of claim 2 wherein:

at least one of the disconnected data collections is an email database; and

at least one of the disconnected data collections is a non-email database.

4. The one or more computer-readable media of claim 1 wherein:

the graph data structure comprises heterogeneous nodes of different object classes representing respective different kinds of software development items.

5. The one or more computer-readable media of claim 4 wherein:

the different object classes inherit from a same parent object class in a class hierarchy.

6. The one or more computer-readable media of claim 1 wherein:

the software development items comprise at least one software developer;

at least one of the nodes represents the software developer; and

at least one node representing the software developer shares an edge with at least one other node representing a software development item other than a software developer.

7. The one or more computer-readable media of claim 1 wherein:

the detecting comprises recognizing that a software development item has been mentioned in plain text; and

representing the detected relationship comprises modifying the graph data structure to indicate a relationship for the mentioned software development item.

8. The one or more computer-readable media of claim 7 wherein:

the detecting comprises recognizing that at least one selected from the following group has been mentioned in plain text;

an object class;

a method of an object class;

a structure; and

an enumerated type.

9. The one or more computer-readable media of claim 7 wherein:

the plain text appears in an email sent by a developer; and

representing the detected relationship comprises modifying the graph to indicate a relationship between the mentioned software development item and the developer.

10. The one or more computer-readable media of claim 1 wherein:

the graph data structure comprises at least one node representing a bug;

the detecting comprises recognizing that a software development item has been mentioned in plain text of a bug report for the bug; and

representing the detected relationship comprises modifying the graph data structure to indicate a relationship between the mentioned software development item and the bug.

11. One or more computer-readable storage media having computer-executable instructions for performing a method comprising:

receiving a request to indicate software development items related to a specified software development item;

responsive to the request, inspecting a data structure representing software development items as a plurality of nodes in a graph data structure, wherein the specified software development item is represented as one of the nodes in the graph data structure; and

presenting results indicating the software development items having nodes connected in the graph data structure to the node representing the software development item in the graph data structure for the specified software development item;

wherein the presenting ranks the software development items according to distance from one or more nodes meeting specified criteria; and

wherein the computer-readable storage media further comprise computer-executable instructions for performing an action selected from the group consisting of;

weighting the distance based on edge cost within the graph data structure; and

ranking based at least on a number of edges incident to an intervening node between two nodes.

12. The one or more computer-readable media of claim 11 wherein:

the request is implicitly generated based on non-query user activity inside an application without an explicit query action by a user.

13. The one or more computer-readable media of claim 11 wherein:

the request indicates that results are to be limited to a particular type of software development item; and

responsive to the request, the presenting presents results limited to the particular type of software development item.

14. The one or more computer-readable storage media of claim 11, wherein the method comprises:

weighting the distance based on edge cost within the graph data structure.

15. The one or more computer-readable storage media of claim 11, wherein the computer-readable storage media comprise computer executable instructions for ranking based at least on a number of edges incident to an intervening node between two nodes.