Patent Application

App. No. 15/141,037

Abstract

Claims (72)

1 . A method comprising:

receiving, by one or more computers through one or more data channels from a first client device associated with a first participant account, a meeting request that specifies the first participant account and a proposed topic for a meeting;

determining, by the one or more computers reading and traversing a database in a data storage system, one or more second participant accounts for the meeting that are linked to the proposed topic in the database; and

scheduling, by the one or more computers, the meeting with the first participant account and the one or more second participant accounts by transmitting meeting invites through the one or more data channels to the first client device and one or more second client devices associated with the one or more second participant accounts;

and wherein:

the database contains data for a plurality of accounts associated with entities, a plurality of events involving the entities, a plurality of prior topics derived from the events, and a plurality of links between the accounts, events and prior topics; and

the meeting request activates the reading and traversing of the database by the one or more computers to determine the one or more second participant accounts;

and wherein the plurality of accounts includes the first participant account and the one or more second participant account.

2 . The method of claim 1 , wherein:

the database is a graph database having account vertices for the plurality of accounts, event vertices for the plurality of events, topic vertices for the plurality of prior topics, topic edges linking the topic vertices to the event vertices, and non-topic edges linking the account vertices to the event vertices;

the reading and traversing of the database further comprises reading a first account vertex for the first participant account, traversing from the first account vertex through a first non-topic edge to a first event vertex, traversing from the first event vertex through a first topic edge to a first topic vertex, and traversing from the first event vertex through a second non-topic edge to a second account vertex for a first one of the one or more second participant accounts; and

the method further comprises determining, by the one or more computers, whether the first one of the one or more second participant accounts is linked to the proposed topic by comparing a first prior topic of the first topic vertex to the proposed topic.

3 . The method of claim 1 , further comprising:

determining, by the one or more computers reading and traversing the database in the data storage system, a relevance of a subset of the plurality of accounts to the proposed topic;

and wherein the determining of the one or more second participant accounts further comprises selecting, by the one or more computers, the one or more second participant accounts from the subset of the plurality of accounts.

4 . The method of claim 3 , further comprising:

determining, by the one or more computers reading and traversing the database in the data storage system, a rank of the relevance of the accounts in the subset of the plurality of accounts to the proposed topic;

and wherein the determining of the one or more second participant accounts further comprises selecting, by the one or more computers, the one or more second participant accounts from the subset of the plurality of accounts in accordance with their rank.

5 . The method of claim 4 , wherein:

the determining of the rank further comprises determining how recently and how actively the accounts in the subset of the plurality of accounts have been involved with the proposed topic.

6 . The method of claim 1 , further comprising:

determining, by the one or more computers reading and traversing the database in the data storage system, one or more documents for the meeting that are linked to the proposed topic in the database.

7 . The method of claim 1 , further comprising:

prior to transmitting meeting invites, transmitting, by the one or more computers, a proposed schedule for the meeting to the first client device for presentation to a meeting organizer to approve or change the proposed schedule.

8 . The method of claim 1 , further comprising:

collecting, by the one or more computers, prior email data and prior meeting data; and

forming, by the one or more computers, the database in the data storage system from the prior email data and the prior meeting data.

9 . The method of claim 8 , wherein the forming of the database further comprises:

extracting the prior topics from the prior email data and the prior meeting data.

10 . A computing system, comprising:

one or more processors; and

electronic memory that comprises computer-executable instructions that, when executed by the one or more processors, cause the at one or more processors to perform acts including:

receiving, by the one or more processors through one or more data channels from a first client device associated with a first participant account, a meeting request that specifies the first participant account and a proposed topic for a meeting;

determining, by the one or more processors reading and traversing a database in a data storage system, one or more second participant accounts for the meeting that are linked to the proposed topic in the database; and

scheduling, by the one or more processors, the meeting with the first participant account and the one or more second participant accounts by transmitting meeting invites through the one or more data channels to the first client device and one or more second client devices associated with the one or more second participant accounts;

and wherein:

the database contains data for a plurality of accounts associated with entities, a plurality of events involving the entities, a plurality of prior topics derived from the events, and a plurality of links between the accounts, events and prior topics; and

the meeting request activates the reading and traversing of the database by the one or more processors to determine the one or more second participant accounts;

and wherein the plurality of accounts includes the first participant account and the one or more second participant account.

11 . The computing system of claim 10 , wherein:

the database is a graph database having account vertices for the plurality of accounts, event vertices for the plurality of events, topic vertices for the plurality of prior topics, topic edges linking the topic vertices to the event vertices, and non-topic edges linking the account vertices to the event vertices;

the reading and traversing of the database further comprises reading a first account vertex for the first participant account, traversing from the first account vertex through a first non-topic edge to a first event vertex, traversing from the first event vertex through a first topic edge to a first topic vertex, and traversing from the first event vertex through a second non-topic edge to a second account vertex for a first one of the one or more second participant accounts; and

the memory further comprises computer-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform acts including: determining, by the one or more processors, whether the first one of the one or more second participant accounts is linked to the proposed topic by comparing a first prior topic of the first topic vertex to the proposed topic.

12 . The computing system of claim 10 , the memory further comprising computer-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform acts including:

determining, by the one or more processors reading and traversing the database in the data storage system, a relevance of a subset of the plurality of accounts to the proposed topic;

and wherein the determining of the one or more second participant accounts further comprises selecting, by the one or more processors, the one or more second participant accounts from the subset of the plurality of accounts.

13 . The computing system of claim 12 , the memory further comprising computer-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform acts including:

determining, by the one or more processors reading and traversing the database in the data storage system, a rank of the relevance of the accounts in the subset of the plurality of accounts to the proposed topic;

and wherein the determining of the one or more second participant accounts further comprises selecting, by the one or more processors, the one or more second participant accounts from the subset of the plurality of accounts in accordance with their rank.

14 . The computing system of claim 13 , wherein:

the determining of the rank further comprises determining how recently and how actively the accounts in the subset of the plurality of accounts have been involved with the proposed topic.

15 . The computing system of claim 10 , the memory further comprising computer-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform acts including:

determining, by the one or more processors reading and traversing the database in the data storage system, one or more documents for the meeting that are linked to the proposed topic in the database.

16 . The computing system of claim 10 , the memory further comprising computer-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform acts including:

prior to transmitting meeting invites, transmitting, by the one or more processors, a proposed schedule for the meeting to the first client device for presentation to a meeting organizer to approve or change the proposed schedule.

17 . The computing system of claim 10 , the memory further comprising computer-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform acts including:

collecting, by the one or more processors, prior email data and prior meeting data; and

forming, by the one or more processors, the database in the data storage system from the prior email data and the prior meeting data.

18 . The computing system of claim 17 , wherein the forming of the database further comprises:

extracting the prior topics from the prior email data and the prior meeting data.

19 . A non-transitory computer-readable medium comprising instructions stored thereon that, when executed on one or more computers, perform the steps of:

receiving, by the one or more computers through one or more data channels from a first client device associated with a first participant account, a meeting request that specifies the first participant account and a proposed topic for a meeting;

determining, by the one or more computers reading and traversing a database in a data storage system, one or more second participant accounts for the meeting that are linked to the proposed topic in the database; and

scheduling, by the one or more computers, the meeting with the first participant account and the one or more second participant accounts by transmitting meeting invites through the one or more data channels to the first client device and one or more second client devices associated with the one or more second participant accounts;

and wherein:

the database contains data for a plurality of accounts associated with entities, a plurality of events involving the entities, a plurality of prior topics derived from the events, and a plurality of links between the accounts, events and prior topics; and

the meeting request activates the reading and traversing of the database by the one or more computers to determine the one or more second participant accounts;

and wherein the plurality of accounts includes the first participant account and the one or more second participant account.

20 . The non-transitory computer-readable medium of claim 19 , wherein:

the database is a graph database having account vertices for the plurality of accounts, event vertices for the plurality of events, topic vertices for the plurality of prior topics, topic edges linking the topic vertices to the event vertices, and non-topic edges linking the account vertices to the event vertices;

the reading and traversing of the database further comprises reading a first account vertex for the first participant account, traversing from the first account vertex through a first non-topic edge to a first event vertex, traversing from the first event vertex through a first topic edge to a first topic vertex, and traversing from the first event vertex through a second non-topic edge to a second account vertex for a first one of the one or more second participant accounts; and

the instructions further comprise instructions, that when executed on the one or more computers, perform the steps of: determining, by the one or more computers, whether the first one of the one or more second participant accounts is linked to the proposed topic by comparing a first prior topic of the first topic vertex to the proposed topic.

Assignments (10)