The following commonly owned, co-pending United States Patents and Patent Applications, including the present application, are related to each other. Each of the other patents/applications are incorporated by reference herein in its entirety:
U.S. Provisional Patent Application No. 61/354,003 entitled METHODS AND SYSTEMS FOR ANALYZING SEARCH TERMS IN A MULTI-TENANT DATABASE SYSTEM ENVIRONMENT, by Olivier Y. Pin et al., filed Jun. 11, 2010; and
U.S. patent application Ser. No. 11/716,365 entitled METHOD AND SYSTEM FOR POSTING IDEAS, by Norimasa Yoshida et al., filed Mar. 8, 2007, which is now Pat. No. 7,831,455; and
U.S. patent application Ser. No. 11/786,882 entitled METHOD AND SYSTEM FOR MANAGING IDEAS, by Norimasa Yoshida et al., filed Apr. 13, 2007, which is now Pat. No. 7,818,194; and
U.S. patent application Ser. No. 11/801,572 entitled METHOD AND SYSTEM FOR INTEGRATING IDEA AND ON DEMAND SERVICES, by Norimasa Yoshida et al., filed May 9, 2007, which is now Pat. No. 7,840,413; and
U.S. Provisional Patent Application No. 61/354,604 entitled METHODS AND SYSTEMS FOR DYNAMICALLY SUGGESTING ANSWERS TO QUESTIONS SUBMITTED TO A PORTAL OF AN ONLINE SERVICE, by Patrick McFarlane et al., filed Jun. 14, 2010; and
U.S. patent application Ser. No. 13/111,195 entitled METHODS AND SYSTEMS FOR DYNAMICALLY SUGGESTING ANSWERS TO QUESTIONS SUBMITTED TO A PORTAL OF AN ONLINE SERVICE, by Patrick McFarlane et al., filed May 19, 2011; and
U.S. Provisional Patent Application No. 61/360,752 entitled METHODS AND SYSTEMS FOR SCORING AND RANKING ARTICLES IN AN ON-DEMAND SERVICES ENVIRONMENT, by Vinodh Rajagopal, filed Jul. 1, 2010; and
U.S. patent application Ser. No. 13/082,299 entitled METHOD AND SYSTEM FOR SCORING ARTICLES IN AN ON-DEMAND SERVICES ENVIRONMENT, by Vinodh Rajagopal, filed Apr. 7, 2011; and
U.S. Provisional Patent Application No. 61/402,576 entitled METHOD AND SYSTEM FOR PROVIDING SIMPLIFIED FORM FILLING IN AN ON-DEMAND SERVICE, by Nadia Naderi, filed Aug. 10, 2010; and
U.S. patent application Ser. No. 13/030,096 entitled METHOD AND SYSTEM FOR PROVIDING SIMPLIFIED FORM FILLING IN AN ON-DEMAND SERVICE, by Nadia Naderi, filed Feb. 17, 2011; and
U.S. Provisional Patent Application No. 61/351,620 entitled METHODS AND SYSTEMS FOR PROVIDING ANSWERS TO USERS OF A MULTI-TENANT DATABASE SYSTEM, by Norimasa Yoshida et al., filed Jun. 4, 2010; and
U.S. patent application Ser. No. 13/152,246 entitled METHOD AND SYSTEM FOR PROVIDING ANSWERS TO USERS OF A MULTI-TENANT DATABASE SYSTEM, by Norimasa Yoshida et al., filed Jun. 2, 2011; and
U.S. Provisional Patent Application No. 61/350,904 entitled METHOD AND SYSTEM FOR ANSWERS TO CASES ESCALATION, by Norimasa Yoshida et al., filed Jun. 2, 2010; and
U.S. patent application Ser. No. 13/151,784 entitled METHOD AND SYSTEM FOR ESCALATING CONTENT OF DISCUSSIONS TO PARTICULAR MEMORY LOCATIONS, by Norimasa Yoshida et al., filed Jun. 2, 2011.
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
The specification relates generally to analyzing search terms in a database network system.
The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mention in the background section. Similarly, a problem mentioned in the background section or associated with the subject matter of the background section should not be assumed to have been previously recognized in the prior art. The subject matter in the background section merely represents different approaches, which in and of themselves may also be inventions.
Some forms of supporting customers are phone support or email support. With the advent of the web, however, it is essential to provide software-like utility to users as a service. A “software as a service” approach may include a group of end users, who may wish to use the service offering collaboratively, or who may wish to share their input as a community. A database created from collaborative sharing in a community, which in this specification may be referred to as a forum, may be used is as an added tool for customer support. Accordingly, this specification recognizes that is may be desirable to provide techniques enabling sharing ideas to improve service offerings.
In the following drawings like reference numbers are used to refer to like elements. Although the following figures depict various examples, the one or more implementations are not limited to the examples depicted in the figures.
General Overview
Systems and methods are provided for analyzing search terms in a multi-tenant database network system.
Although various embodiments of the invention may have been motivated by various deficiencies with the prior art, which may be discussed or alluded to in one or more places in the specification, the embodiments of the invention do not necessarily address any of these deficiencies. In other words, different embodiments of the invention may address different deficiencies that may be discussed in the specification. Some embodiments may only partially address some deficiencies or just one deficiency that may be discussed in the specification, and some embodiments may not address any of these deficiencies.
As used herein, the term multi-tenant database system refers to a database system that has multiple tenants that each has a degree of access to at least a portion of the database system that may or may not be the same as the degree of access as other tenants. Each tenant may be an individual or an organization that may have representatives, members, employees, customers and/or other entities associated with the tenant, which in turn may also have different degrees of access to the database. The degree of access granted to those associated with the tenant and/or which entities (e.g., representatives, members, employees, customers and/or other entities) are associated with the tenant may be determined by the tenant. The database system may include multiple databases, and each database may be partitioned and/or otherwise shared amongst multiple tenants.
Next, mechanisms and methods for providing methods and systems for analyzing search terms will be described with reference to example embodiments. In this specification a community is a group of users that share a common interest and tend to communicate with one another about that common interest.
A community website is a website in which users share ideas that are related to the community, which may include at least a portion of one or more webpages. An on-demand community is a community website that is created by the tenant using pre-established tools specialized for creating communities. The multitenant database system may provide the pre-established tools specialized for creating the communities. In an embodiment, the focus of the communities may be on-demand enterprise communities, which are communities structured around a business' partners, customers, vendors, representatives, employees, and/or others associated with the business.
A knowledge base is a database for knowledge management. Knowledge bases can be part of community website. Knowledge base is a collection of articles related to problems and solutions related to the common interest of the community. Knowledge base systems may include tools that help in creating, editing and managing the database of articles. Knowledge base systems may offer documentation of knowledge and self-learning there by reducing the cost of customer support.
Analytics in this specification refers to the science of analysis concerned with extracting useful properties of data, typically involving extracting properties from large databases. Search analytics in this specification refers to the analysis and aggregation of search engine statistics. Search analytics may help in understanding and/or improving the performance of search engines. Search analytics may include determining search volume trends, analysis of searches, keywords, advertisements, search volume trends, keyword monitoring, search results, advertisement history, advertisement spending statistics, and/or comparisons of websites, for example. The comparison of websites may include a comparison of the number and/or type of users, advertisers, advertisements, keywords, search results, search trends, advertisement treads, and/or advertisement histories, for example.
In this specification a keyword refers to a word or a phrase relevant to a webpage document, via which the document may be found. Keyword can also be a word or a phrase entered in a search engine. In this specification, the term document is generic to a webpage, an article, or other document. Webpage of results from keyword search in a search engine may also be referred to as search engine results page. Keywords and search terms are used interchangeably in this specification and may be substituted for one another to obtain different embodiments. In this specification the term keyword search analytics refers to the analysis and aggregation of search engine data. Keyword search analytics can be helpful in understanding the trends and requirements of users which in turn helps in optimizing the database.
Server side system 100 may be part of a multitenant system. In an embodiment in a multi-tenant database system, web server 102 sends webpages to user systems (the user systems are described further in conjunction with
Software tools for data analysis may be referred to as analytical tools. Analytical tools may be designed for various purposes. Some tools may be customized to support a specific set of related analytical tasks, while some may be built for data analysis. Analytical tools that help in measurement, collection, analysis of data on a webpage may be referred to as web analytical tools. Web analytical tools may also help in measuring the traffic on a webpage, such as by providing useful information such as the number of visitors, page views, and/or other information about traffic on the webpage, which may be helpful in gauging the traffic and trends associated with visitors of the website. Analytical tools 202 may include a software tool for collecting, measuring and/or eventually generating a report for meaningful analysis in a multi-tenant database system. Knowledge report 206 can be a type of analytical tool for generating reports in a knowledge base, which is a database in the multi-tenant system.
Some managers may find it desirable to see and follow activities related to the usage of a customer support system for the employees as well as for the customers. Managers might also want to see the evolution of activities over time. Understanding user voting and viewing articles gives an idea of the effectiveness of the knowledgebase and/or the type of information that the company may want to add to the knowledge base (e.g., by adding links to other documents and/or by adding documents to the knowledge base). Administrators and publishers of articles may also need data to effectively maintain the knowledge base by, for example, associating new keywords with documents already in the system, but that users are not finding and/or removing an association of a document with a keyword that seems to be resulting in people being lead to documents unrelated to the information actually sought.
Continuing with the discussion of
Knowledge Base Report
In step 404, a knowledge base report can be generated using the current status of the knowledge base and a Custom Report Type (CRT) object, Knowledge Article. CRT objects may be XML files that define relationships between objects, so that the objects can be used to generate reports. The report may include a list of the articles that were most recently published, documents linked to customer cases, and/or documents that are not linked to any customer case among others. By knowing which documents are linked to customer cases, a manager can determine the effectiveness of the customer support system. By knowing which documents are not linked to customer cases, a manager can determine which articles users are not finding useful and/or which articles user do not find despite being relevant to the information sought. By knowing which articles were recently published, the manager can determine which articles are not accessed by users as a result of the article being new rather than as a result of the article not being of interest and/or how quickly after publishing users are able to locate the article.
In an embodiment, each of the steps of method 400 is a distinct step. In other embodiments, method 400 may not have all of the above steps and/or may have other steps in addition to or instead of those listed above. The steps of method 400 may be performed in another order. Subsets of the steps listed above as part of method 400 may be used to form their own method. In other embodiments, there could be multiple instances of method 400.
In step 502, the report generation method 500 reads the current status of the knowledge base (discussed in conjunction with
The normalized score may be proportional to the number of views an article receives. In an embodiment, the normalized score ranges from 0 to 100. In an embodiment, an article that is viewed most receives a normalized score of 100 and articles which are not viewed receive a normalized score of 0. For example, if three articles exist in the knowledgebase and the article ‘AAA’ is viewed 44 times and the article ‘BBB’ is viewed 32 times and the article ‘CCC’ is viewed 88 times, then the normalized score of article ‘CCC’ can be 100. ‘BBB’ can receive a normalized score of 0 and the article ‘AAA’ can receive a score of 50. In other embodiments the score may be normalized in other manners. The score may be normalized to be a value between a minimum value that is different than 0 and/or a maximum value that is different than 100. For example, the score may be normalized to be a value between 1 and 10. Voting information may include from which channel the vote came from. Total sum is the total number of points an article has accumulated from voting. In an embodiment, voting involves rating an article from 1 to 5 stars, based on the user system sending a vote liking an article and/or the user system sending an indication as to how many stars to award to the idea. An article that has the highest degree of being liked may be awarded a 5 star vote and least liked will receives 1 star vote. In an embodiment, an article which receives a 5 star vote from the user system is given 10 points, article which receives a 4 star vote from the user system is given 5 points, article which receives a 3 star vote from the user system is given 0 points, article which receives a 2 star vote from the user system is given −5 points and article which receives a 1 star vote from the user system is given −10 points. In an embodiment, the user system liking/disliking an article is not related to the rating an article. Total votes are the total number of votes an article has received since the initial posting of the article in the forum. In an embodiment, the normalized score is related to the number of views and the total votes is total number of votes the article has received. In other embodiment, the choices for how many stars may be awarded to an article may be different. For example, in other embodiments, a user may only be able to choose between 1 to 3 stars or may be able to choose as many as between 1 to 10 stars. Additionally, in other embodiments, the number of points awarded for each star may be different than described above. For example, the points may span between −3 and 3 points, depending on whether the minimum number of stars was awarded or the maximum number of stars was awarded.
In step 504 a knowledge base report can be generated using the current status of the knowledge base and voting information along with Custom Report Type (CRT) objects, ‘Knowledge Article’ and ‘Article Vote Statistics’.
The knowledge report containing voting statistics gives an idea of the quality of the knowledge base and also informs the one reviewing the reports of short comings. In an embodiment, the articles are also given a score of between 1 and 5 that indicates how long it has been since the article was rated. In other embodiments, other ranges of scores may be used, having a different minimum and maximum value, such as −3 to 3 or 0 to 10. The time decay makes the more recent articles to be more relevant than the older ones. Articles that do not receive votes for a longer period of time will have a score closer to 3. The highest rated articles may be listed per channel. In addition to being listed by channel, articles may be sorted according to the number of votes each article received with the highest rated article on the top of the list. Articles that do not receive new votes for a long period of time will be moved from the top highest/lowest list.
Similarly, the lowest rated articles are the articles which receive low scores. The very lowest rated articles are listed per channel and the listing associated with each channel contains articles that are sorted by their vote. The list of the very lowest articles gives an indication that the articles very not judged good by the users. This enables the administrator to make appropriate decisions about the article. Top rated articles with no time decay gives information about how the knowledge base is being used, while, as rated articles with time decay informs about the recent interest of the user system. The article rating may be the average of scores per organization. The report containing the articles with the least number of votes and the articles with the most number of votes is based on the number of votes.
In an embodiment, each of the steps of method 500 is a distinct step. In other embodiments, method 500 may not have all of the above steps and/or may have other steps in addition to or instead of those listed above. The steps of method 500 may be performed in another order. Subsets of the steps listed above as part of method 500 may be used to form their own method. In other embodiments, there could be multiple instances of method 500.
User Activity Report
Step 604 involves aggregating the tracked data. Aggregation will be further discussed in conjunction with
Tracking
Tracking system 700 may track the knowledge events such as the viewing of articles, voting on articles, and the searching the knowledge base, and tracking system 700 may store the knowledge events that were tracked. CRT objects are used to keep track of events in the knowledge base. Tracking may involve keeping count of the number of views, the number of votes, the number of searches along with type of votes, searched words, results of the search and the channels via which the community website is accessed. The results of the search, whether the keyword retrieved an article or not may be stored in Boolean format. View 702 is the portion of code of the tracking system 700 that receive requests to view a page to view an article in the knowledge base. KnowledgeArticleViews 704 is a CRT object, KnowledgeArticleViews that is the portion of code of tracking system 700 used to track knowledge base events when the user system requests an article. When an article from the knowledge base is viewed by the user system from any of the channels, the event is tracked. Vote 706 is the portion of code of the tracking system 700 for receiving a vote on an article from the user system. KnowledgeArticleVotes 708 is CRT object KnowledgeArticleVotes that is the portion of code of the tracking system 700 that is used to keep track of the votes received.
Article Search 710 can be the portion of code of the tracking system 700 via which keywords are received for keeping track of the number of times the keywords are used in searching the knowledge base. KnowledgeArticleSearches 712 is a CRT object KnowledgeArticleSearches that is used to keep track of the number of times a keyword is used in searching the knowledgebase. Keyword Search 714 is the portion of code of the tracking system 700 via which keywords are received for searching the knowledge base. KnowledgeKeywordSearches 716 is a CRT object that is used to keep track of keywords that are searched in the knowledge base and whether the keyword retrieved at least an article or not.
Store 718 can be portion of the code that may be used to temporarily store the tracked data in the memory of the application server (described later in conjunction with
Further discussing knowledge event table 800, cumulative_count 816 can be the eighth column in the knowledge event table that can store the total search count for a given unique key of the knowledge event table. In an embodiment, a composite key is used as the unique key for the knowledge event table which may be (organization_id, event_type, related_id, related_key_prefix, duration_enum, as_of_date, channel_enum). delta_count 818 can be the last column in the knowledge event table. delta_count can be the search count for a unique key during a given period which could be a day in daily row, a month in monthly row or a year in yearly row. During tracking all events whose unique key already exists will update the value of cummulative_count and delta_count for the corresponding row. delta_count is added to cummulative_count to generate new value of cummulative_count and delta_count is reset to zero. A new row is created if the key does not exist. Related_id can hold the value of role_id to store the information about the user who performed an action (view, vote or search) or article_id to store information about on which article the action was performed. When an article is viewed or voted, two rows in the database may be updated, one row where the related_id is the article_id and the second where the related_id is the role_id. However, searching updates only one row as the related_id is the role_id. Rows 820 contain example data of the knowledge event table.
Aggregation
Storing every searched keyword can lead to large memory requirements. Storing meaningful data can be helpful in managing the memory in a multi-tenant database system. The keywords can be of two categories, keywords that did not retrieve any article and keywords that retrieved at least one article. Keywords that do not yield any results can give an insight into customer requirements and trends which in turn can help in improving the quality of knowledge base. An optimal memory size can be achieved by storing the most frequently used keywords that retrieved results and the keywords that did not retrieve results.
In step 902, day's worth of data with unique key (organization_id, event_type, related_id, related_key_prefix, channel_enum) may create a new entry in the database and data with the key which already exists will update the value of cumulative_count and delta_count for the corresponding row and the value of the duration_enum may be set to ‘D’. At a set time, for example at 1 A.M. Pacific Standard Time, the daily aggregation may be performed. In step 902, ‘M’ number of keywords that were used most often and resulted in a successful search and ‘M’ number of keywords that were used most often and resulted in no search result may be stored in the database. For example, ‘M’ can be 300 per day per organization per channel. Older daily data, for example older than 90 days may be deleted from the database.
In step 904 a monthly aggregation may be performed, which may include aggregating the daily data computed for each day of the previous month at a set time. For example, at 1 A.M. Pacific Standard Time on the first of every month, a monthly aggregation may be performed.
In an embodiment, in step 904, a check may be made to determine whether the data from previous months have been aggregated; otherwise all missing monthly aggregate data may be created. Step 904 may involve creating a row for monthly data in the database. In an embodiment, the daily rows of the previous month may be aggregated into one row. In other words, all of the rows of the previous month may be deleted and instead of all of the previous month/s daily rows, one row of monthly data will be placed into the knowledge event table. The data aggregated daily and monthly may have the same set of keys (organization_id, event_type, duration_enum, related_id, related_key_prefix, channel_enum). The field duration_enum may be updated with ‘M’ (or another value) indicating that the data in that row was aggregated over a period of a month. The as_of_date filed may be updated with the date upon which the aggregation took place. delta_count in the monthly row is the sum of all the delta_count from the daily rows of the month. cummulative_count in the monthly row is the maximum value of cummulative_count encountered in the daily rows.
In step 904, ‘N’ number of keywords that were used most often and resulted in a successful search and ‘N’ number of keywords that were used most often and resulted in no search result can be stored in the database. For example, ‘N’ can be 150 per month per organization per channel. In step 904, older monthly data, for example older than 18 months may be deleted from the database.
In Step 906 a yearly aggregation may be performed. In step 906, monthly data of the last twelve months is aggregated) the monthly values to create yearly data. In an embodiment, the yearly aggregation may be performed to execute at a set date and time. For example, the yearly aggregation may occur at 1 A.M. Pacific Standard Time on the first day of the year.
In step 906, checks are made to ensure that each month's data was aggregated through out the entire previous year; otherwise all monthly yearly aggregate data are created. In an embodiment, a yearly data row is never deleted from the database. Step 906 may involve creating a row for the current year's yearly data in the database. In an embodiment, monthly rows of the previous 12 months with the same key (organization_id, event_type, duration_enum=‘M’, related_id, related_key_prefix, channel_enum) will be aggregated into 1 yearly row. duration_enum may be updated with value ‘Y’ or another value indicating that the duration of time over which the data of the current row was aggregated was one year. The as_of_date filed may be updated with first day of the previous year. delta_count in the yearly row is the sum of all the delta_count from the monthly rows of the year for the unique key. cummulative_count in the yearly row is the maximum value of cummulative_count encountered in the monthly rows with the unique key. In other embodiments, other aggregations may be performed in addition to or instead of the aggregations listed above. For example, an aggregation may be performed every 10 days and every 100 days in addition or instead of weekly and monthly aggregations.
In step 906, ‘P’ number of keywords that were used most often and resulted in a successful search and ‘P’ number of keywords that were used most often and resulted in no search result may be stored in the database. For example, ‘P’ can be 150 per year per organization per channel.
The aggregation discussed with reference to
90(days)*4(channels)*2(success)*300(keywords)=216000 daily data rows
18(months)*4(channels)*2(success)*150(keywords)=21600 monthly data rows
4(channel)*2(success)*150(keywords)=1200 yearly data rows
The number of rows can grow quickly the first three months and after that 1200 new rows may be added every year.
In an embodiment, each of the steps of method 900 is a distinct step. In other embodiments, method 900 may not have all of the above steps and/or may have other steps in addition to or instead of those listed above. The steps of method 900 may be performed in another order. Subsets of the steps listed above as part of method 900 may be used to form their own method. In other embodiments, there could be multiple instances of method 900.
Report Generation
In step 1004, CRT objects are used to generate the user activity report. CRT objects can include at least KnowledgeVoteEventHistory, KnowledgeViewEventHistory and KnowledgeSearchEventHistory. In step 1006, a user activity report is generated from the data collected during tracking and aggregation. The user activity report generated may include activities tracked over a period of time. The user system can set the options so that the host system (in response to receiving user instructions) can generate reports in such a manner as to ease analysis. The report may include graphs of voting, activity on the public knowledge base, search activity originating from various channels over a period of time and number of views for an organization for a period of time. Example user activity reports are discussed later in conjunction with
In an embodiment, each of the steps of method 1000 is a distinct step. In other embodiments, method 1000 may not have all of the above steps and/or may have other steps in addition to or instead of those listed above. The steps of method 1000 may be performed in another order. Subsets of the steps listed above as part of method 1000 may be used to form their own method. In other embodiments, there could be multiple instances of method 1000.
Screenshots
Screenshot 1100 is an embodiment of a user activity report listing the keywords that were searched the most. Report title 1102 recites the title of the report. In this example, the 10 keywords that were searched the most are listed. First column heading 1104 informs the viewer what content is placed in the first column. In this embodiment, the first column listed in the report are the keywords that were searched. Second column heading 1106 includes the heading of the second column, which is the sum of the count, which refers to the number of times the keyword was searched. First column 1108 lists the most searched keywords. Second column 1110 lists the number of times the keywords were searched.
The user activity report can be presented in at least a graph and may be placed in tabular formats.
Graph 1201 represents the user activity report in a graphical form. Graph title 1202 includes the title of the graph. Legend 1204 describes the representation of the colors in the graph. Graph 1201 is a bar graph of the percentage of successful and unsuccessful keyword searches along y-axis 1206 and date along the x-axis 1208. Graph 1201 gives an indication of the quality of the database.
Table 1203 is a report of keywords that did not retrieve any article and the number of times the keyword was used in searches. Table title 1210 includes the title of the report. First column heading 1212 includes the heading of first column. The second column heading 1214 is the heading of the second column in the report. First column 1216 is a list of keywords that did not retrieve any article when submitted as search terms in a search. Second column 1218 lists the number of times the keyword was entered as a search term.
The embodiment of the user activity report of
System Overview
Environment 1410 is an environment in which an on-demand database service exists. User system 1412 may be any machine or system that is used by a user to access a database user system. For example, any of user systems 1412 can be a handheld computing device, a mobile phone, a laptop computer, a work station, and/or a network of computing devices. As illustrated in
An on-demand database service, such as system 1416, is a database system that is made available to outside users that do not need to necessarily be concerned with building and/or maintaining the database system, but instead may be available for their use when the users need the database system (e.g., on the demand of the users). Some on-demand database services may store information from one or more tenants stored into tables of a common database image to form a multi-tenant database system (MTS). Accordingly, “on-demand database service 1416” and “system 1416” will be used interchangeably herein. A database image may include one or more database objects. A relational database management system (RDMS) or the equivalent may execute storage and retrieval of information against the database object(s). Application platform 1418 may be a framework that allows the applications of system 1416 to run, such as the hardware and/or software, e.g., the operating system. In an embodiment, on-demand database service 1416 may include an application platform 1418 that enables creation, managing and executing one or more applications developed by the provider of the on-demand database service, users accessing the on-demand database service via user systems 1412, or third party application developers accessing the on-demand database service via user systems 1412.
The users of user systems 1412 may differ in their respective capacities, and the capacity of a particular user system 1412 might be entirely determined by permissions (permission levels) for the current user. For example, where a salesperson is using a particular user system 1412 to interact with system 1416, that user system has the capacities allotted to that salesperson. However, while an administrator is using that user system to interact with system 1416, that user system has the capacities allotted to that administrator. In systems with a hierarchical role model, users at one permission level may have access to applications, data, and database information accessible by a lower permission level user, but may not have access to certain applications, database information, and data accessible by a user at a higher permission level. Thus, different users will have different capabilities with regard to accessing and modifying application and database information, depending on a user's security or permission level.
Network 1414 is any network or combination of networks of devices that communicate with one another. For example, network 1414 can be any one or any combination of a LAN (local area network), WAN (wide area network), telephone network, wireless network, point-to-point network, star network, token ring network, hub network, or other appropriate configuration. As the most common type of computer network in current use is a TCP/IP (Transfer Control Protocol and Internet Protocol) network, such as the global internetwork of networks often referred to as the “Internet” with a capital “I,” that network will be used in many of the examples herein. However, it should be understood that the networks that the one or more implementations might use are not so limited, although TCP/IP is a frequently implemented protocol.
User systems 1412 might communicate with system 1416 using TCP/IP and, at a higher network level, use other common Internet protocols to communicate, such as HTTP, FTP, AFS, WAP, etc. In an example where HTTP is used, user system 1412 might include an HTTP client commonly referred to as a “browser” for sending and receiving HTTP messages to and from an HTTP server at system 1416. Such an HTTP server might be implemented as the sole network interface between system 1416 and network 1414, but other techniques might be used as well or instead. In some implementations, the interface between system 1416 and network 1414 includes load sharing functionality, such as round-robin HTTP request distributors to balance loads and distribute incoming HTTP requests evenly over a plurality of servers. At least as for the users that are accessing that server, each of the plurality of servers has access to the MTS' data; however, other alternative configurations may be used instead.
In one embodiment, system 1416, shown in
One arrangement for elements of system 1416 is shown in
Several elements in the system shown in
According to one embodiment, each user system 1412 and all of its components are operator configurable using applications, such as a browser, including computer code run using a central processing unit such as an Intel Pentium® processor or the like. Similarly, system 1416 (and additional instances of an MTS, where more than one is present) and all of their components might be operator configurable using application(s) including computer code to run using a central processing unit such as processor system 1417, which may include an Intel Pentium® processor or the like, and/or multiple processor units. A computer program product embodiment includes a machine-readable storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the processes of the embodiments described herein. Computer code for operating and configuring system 1416 to intercommunicate and to process webpages, applications and other data and media content as described herein are preferably downloaded and stored on a hard disk, but the entire program code, or portions thereof, may also be stored in any other volatile or non-volatile memory medium or device as is well known, such as a ROM or RAM, or provided on any media capable of storing program code, such as any type of rotating media including floppy disks, optical discs, digital versatile disk (DVD), compact disk (CD), microdrive, and magneto-optical disks, and magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data. Additionally, the entire program code, or portions thereof, may be transmitted and downloaded from a software source over a transmission medium, e.g., over the Internet, or from another server, as is well known, or transmitted over any other conventional network connection as is well known (e.g., extranet, VPN, LAN, etc.) using any communication medium and protocols (e.g., TCP/IP, HTTP, HTTPS, Ethernet, etc.) as are well known. It will also be appreciated that computer code for implementing embodiments can be implemented in any programming language that can be executed on a client system and/or server or server system such as, for example, C, C++, HTML, any other markup language, Java™, JavaScript, ActiveX, any other scripting language, such as VBScript, and many other programming languages as are well known may be used. (Java™ is a trademark of Sun Microsystems, Inc.).
According to one embodiment, each system 1416 is configured to provide webpages, forms, applications, data and media content to user (client) systems 1412 to support the access by user systems 1412 as tenants of system 1416. As such, system 1416 provides security mechanisms to keep each tenant's data separate unless the data is shared. If more than one MTS is used, they may be located in close proximity to one another (e.g., in a server farm located in a single building or campus), or they may be distributed at locations remote from one another (e.g., one or more servers located in city A and one or more servers located in city B). As used herein, each MTS could include one or more logically and/or physically connected servers distributed locally or across one or more geographic locations. Additionally, the term “server” is meant to include a computer system, including processing hardware and process space(s), and an associated storage system and database application (e.g., OODBMS or RDBMS) as is well known in the art. It should also be understood that “server system” and “server” are often used interchangeably herein. Similarly, the database object described herein can be implemented as single databases, a distributed database, a collection of distributed databases, a database with redundant online or offline backups or other redundancies, etc., and might include a distributed database or storage network and associated processing intelligence.
User system 1412, network 1414, system 1416, tenant data storage 1422, and system data storage 1424 were discussed above in
Application platform 1418 includes an application setup mechanism 1538 that supports application developers' creation and management of applications, which may be saved as metadata into tenant data storage 1422 by save routines 1536 for execution by subscribers as one or more tenant process spaces 1404 managed by tenant management process 1410 for example. Invocations to such applications may be coded using PL/SOQL 1534 that provides a programming language style interface extension to API 1532. A detailed description of some PL/SOQL language embodiments is discussed in commonly owned U.S. Provisional Patent Application 60/828,192 entitled, PROGRAMMING LANGUAGE METHOD AND SYSTEM FOR EXTENDING APIS TO EXECUTE IN CONJUNCTION WITH DATABASE APIS, by Craig Weissman, filed Oct. 4, 2006, which is incorporated in its entirety herein for all purposes. Invocations to applications may be detected by one or more system processes, which manages retrieving application metadata 1416 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.
Each application server 1500 may be communicably coupled to database systems, e.g., having access to system data 1525 and tenant data 1523, via a different network connection. For example, one application server 15001 might be coupled via the network 1414 (e.g., the Internet), another application server 1500N-1 might be coupled via a direct network link, and another application server 1500N might be coupled by yet a different network connection. Transfer Control Protocol and Internet Protocol (TCP/IP) are typical protocols for communicating between application servers 1500 and the database system. However, it will be apparent to one skilled in the art that other transport protocols may be used to optimize the system depending on the network interconnect used.
In certain embodiments, each application server 1500 is configured to handle requests for any user associated with any organization that is a tenant. Because it is desirable to be able to add and remove application servers from the server pool at any time for any reason, there is preferably no server affinity for a user and/or organization to a specific application server 1500. In one embodiment, therefore, an interface system implementing a load balancing function (e.g., an F5 Big-IP load balancer) is communicably coupled between the application servers 1500 and the user systems 1412 to distribute requests to the application servers 1500. In one embodiment, the load balancer uses a least connections algorithm to route user requests to the application servers 1500. Other examples of load balancing algorithms, such as round robin and observed response time, also can be used. For example, in certain embodiments, three consecutive requests from the same user could hit three different application servers 1500, and three requests from different users could hit the same application server 1500. In this manner, system 1416 is multi-tenant, wherein system 1416 handles storage of, and access to, different objects, data and applications across disparate users and organizations.
As an example of storage, one tenant might be a company that employs a sales force where each salesperson uses system 1416 to manage their sales process. Thus, a user might maintain contact data, leads data, customer follow-up data, performance data, goals and progress data, etc., all applicable to that user's personal sales process (e.g., in tenant data storage 1422). In an example of a MTS arrangement, since all of the data and the applications to access, view, modify, report, transmit, calculate, etc., can be maintained and accessed by a user system having nothing more than network access, the user can manage his or her sales efforts and cycles from any of many different user systems. For example, if a salesperson is visiting a customer and the customer has Internet access in their lobby, the salesperson can obtain critical updates as to that customer while waiting for the customer to arrive in the lobby.
While each user's data might be separate from other users' data regardless of the employers of each user, some data might be organization-wide data shared or accessible by a plurality of users or all of the users for a given organization that is a tenant. Thus, there might be some data structures managed by system 1416 that are allocated at the tenant level while other data structures might be managed at the user level. Because an MTS might support multiple tenants including possible competitors, the MTS should have security protocols that keep data, applications, and application use separate. Also, because many tenants may opt for access to an MTS rather than maintain their own system, redundancy, up-time, and backup are additional functions that may be implemented in the MTS. In addition to user-specific data and tenant specific data, system 1416 might also maintain system level data usable by multiple tenants or other data. Such system level data might include industry reports, news, postings, and the like that are sharable among tenants.
In certain embodiments, user systems 1412 (which may be client systems) communicate with application servers 1500 to request and update system-level and tenant-level data from system 1416 that may require sending one or more queries to tenant data storage 1422 and/or system data storage 1424. System 1416 (e.g., an application server 1500 in system 1416) automatically generates one or more SQL statements (e.g., one or more SQL queries) that are designed to access the desired information. System data storage 1424 may generate query plans to access the requested data from the database.
Each database can generally be viewed as a collection of objects, such as a set of logical tables, containing data fitted into predefined categories. A “table” is one representation of a data object, and may be used herein to simplify the conceptual description of objects and custom objects. It should be understood that “table” and “object” may be used interchangeably herein. Each table generally contains one or more data categories logically arranged as columns or fields in a viewable schema. Each row or record of a table contains an instance of data for each category defined by the fields. For example, a CRM database may include a table that describes a customer with fields for basic contact information such as name, address, phone number, fax number, etc. Another table might describe a purchase order, including fields for information such as customer, product, sale price, date, etc. In some multi-tenant database systems, standard entity tables might be provided for use by all tenants. For CRM database applications, such standard entities might include tables for Account, Contact, Lead, and Opportunity data, each containing pre-defined fields. It should be understood that the word “entity” may also be used interchangeably herein with “object” and “table”.
In some multi-tenant database systems, tenants may be allowed to create and store custom objects, or they may be allowed to customize standard entities or objects, for example by creating custom fields for standard objects, including custom index fields. U.S. patent application Ser. No. 10/816,161, filed Apr. 2, 2004, entitled “Custom Entities and Fields in a Multi-Tenant Database System”, and which is hereby incorporated herein by reference, teaches systems and methods for creating custom objects as well as customizing standard objects in a multi-tenant database system. In certain embodiments, for example, all custom entity data rows are stored in a single multi-tenant physical table, which may contain multiple logical tables per organization. It is transparent to customers that their multiple “tables” are in fact stored in one large table or that their data may be stored in the same table as the data of other customers.
Method for Using the Environment (
Method for Creating the Environment (
In step 1704, system 1416 (
In step 1706, user system 1412 is communicatively coupled to network 1504. In step 1708, system 1416 is communicatively coupled to network 1504 allowing user system 1412 and system 1416 to communicate with one another (
Extensions and Alternatives
In the embodiment discussed in the specification, the voting of a like or dislike is not related to the article rating. In an alternate embodiment, the voting of liking/disliking an article may be related to the article rating. If a user system votes to like an article, then the minimum rating for the article can be set so that the user system cannot rate below the threshold. Similarly, when the user system votes to dislike an article, the maximum rating the article can receive from the user system can be set by the host system, above which the user system cannot rate the article.
Each embodiment disclosed herein may be used or otherwise combined with any of the other embodiments disclosed. Any element of any embodiment may be used in any embodiment.
Although the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the true spirit and scope of the invention. In addition, modifications may be made without departing from the essential teachings of the invention.
This application claims the benefit of U.S. Provisional Patent Application 61/354,003 entitled METHODS AND SYSTEMS FOR ANALYZING SEARCH TERMS IN A MULTI-TENANT DATABASE SYSTEM ENVIRONMENT, by Olivier Y. Pin et al., filed Jun. 11, 2010, the entire contents of which are incorporated herein by reference. A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Number | Name | Date | Kind |
---|---|---|---|
5577188 | Zhu | Nov 1996 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5649104 | Carleton et al. | Jul 1997 | A |
5715450 | Ambrose et al. | Feb 1998 | A |
5761419 | Schwartz et al. | Jun 1998 | A |
5819038 | Carleton et al. | Oct 1998 | A |
5821937 | Tonelli et al. | Oct 1998 | A |
5831610 | Tonelli et al. | Nov 1998 | A |
5873096 | Lim et al. | Feb 1999 | A |
5918159 | Fomukong et al. | Jun 1999 | A |
5963953 | Cram et al. | Oct 1999 | A |
5983227 | Nazem et al. | Nov 1999 | A |
6092083 | Brodersen et al. | Jul 2000 | A |
6161149 | Achacoso et al. | Dec 2000 | A |
6169534 | Raffel et al. | Jan 2001 | B1 |
6178425 | Brodersen et al. | Jan 2001 | B1 |
6189011 | Lim et al. | Feb 2001 | B1 |
6216133 | Masthoff | Apr 2001 | B1 |
6216135 | Brodersen et al. | Apr 2001 | B1 |
6230287 | Pinard et al. | May 2001 | B1 |
6233617 | Rothwein et al. | May 2001 | B1 |
6236978 | Tuzhilin | May 2001 | B1 |
6266669 | Brodersen et al. | Jul 2001 | B1 |
6288717 | Dunkle | Sep 2001 | B1 |
6295530 | Ritchie et al. | Sep 2001 | B1 |
6324568 | Diec et al. | Nov 2001 | B1 |
6324693 | Brodersen et al. | Nov 2001 | B1 |
6336137 | Lee et al. | Jan 2002 | B1 |
D454139 | Feldcamp et al. | Mar 2002 | S |
6367077 | Brodersen et al. | Apr 2002 | B1 |
6377944 | Busey et al. | Apr 2002 | B1 |
6393605 | Loomans | May 2002 | B1 |
6405220 | Brodersen et al. | Jun 2002 | B1 |
6411949 | Schaffer | Jun 2002 | B1 |
6434550 | Warner et al. | Aug 2002 | B1 |
6446089 | Brodersen et al. | Sep 2002 | B1 |
6535909 | Rust | Mar 2003 | B1 |
6549908 | Loomans | Apr 2003 | B1 |
6553563 | Ambrose et al. | Apr 2003 | B2 |
6560461 | Fomukong et al. | May 2003 | B1 |
6574635 | Stauber et al. | Jun 2003 | B2 |
6577726 | Huang et al. | Jun 2003 | B1 |
6601087 | Zhu et al. | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec et al. | Aug 2003 | B2 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier et al. | Sep 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6665648 | Brodersen et al. | Dec 2003 | B2 |
6665655 | Warner et al. | Dec 2003 | B1 |
6684438 | Brodersen et al. | Feb 2004 | B2 |
6711565 | Subramaniam et al. | Mar 2004 | B1 |
6711585 | Copperman et al. | Mar 2004 | B1 |
6724399 | Katchour et al. | Apr 2004 | B1 |
6728702 | Subramaniam et al. | Apr 2004 | B1 |
6728960 | Loomans et al. | Apr 2004 | B1 |
6732095 | Warshavsky et al. | May 2004 | B1 |
6732100 | Brodersen et al. | May 2004 | B1 |
6732111 | Brodersen et al. | May 2004 | B2 |
6754681 | Brodersen et al. | Jun 2004 | B2 |
6763351 | Subramaniam et al. | Jul 2004 | B1 |
6763501 | Zhu et al. | Jul 2004 | B1 |
6768904 | Kim | Jul 2004 | B2 |
6772229 | Achacoso et al. | Aug 2004 | B1 |
6782383 | Subramaniam et al. | Aug 2004 | B2 |
6804330 | Jones et al. | Oct 2004 | B1 |
6826565 | Ritchie et al. | Nov 2004 | B2 |
6826582 | Chatterjee et al. | Nov 2004 | B1 |
6826745 | Coker | Nov 2004 | B2 |
6829655 | Huang et al. | Dec 2004 | B1 |
6842748 | Warner et al. | Jan 2005 | B1 |
6850895 | Brodersen et al. | Feb 2005 | B2 |
6850949 | Warner et al. | Feb 2005 | B2 |
6907566 | McElfresh et al. | Jun 2005 | B1 |
6912486 | Wang | Jun 2005 | B2 |
7062502 | Kesler | Jun 2006 | B1 |
7069231 | Cinarkaya et al. | Jun 2006 | B1 |
7069497 | Desai | Jun 2006 | B1 |
7100111 | McElfresh et al. | Aug 2006 | B2 |
7130879 | Dayon | Oct 2006 | B1 |
7146416 | Yoo et al. | Dec 2006 | B1 |
7181758 | Chan | Feb 2007 | B1 |
7269590 | Hull et al. | Sep 2007 | B2 |
7289976 | Kihneman et al. | Oct 2007 | B2 |
7340411 | Cook | Mar 2008 | B2 |
7356482 | Frankland et al. | Apr 2008 | B2 |
7373599 | McElfresh et al. | May 2008 | B2 |
7401094 | Kesler | Jul 2008 | B1 |
7406501 | Szeto et al. | Jul 2008 | B2 |
7412455 | Dillon | Aug 2008 | B2 |
7454509 | Boulter et al. | Nov 2008 | B2 |
7508789 | Chan | Mar 2009 | B2 |
7599935 | La Rotonda et al. | Oct 2009 | B2 |
7603331 | Tuzhilin et al. | Oct 2009 | B2 |
7603483 | Psounis et al. | Oct 2009 | B2 |
7620655 | Larsson et al. | Nov 2009 | B2 |
7644122 | Weyer et al. | Jan 2010 | B2 |
7668861 | Steven | Feb 2010 | B2 |
7698160 | Beaven et al. | Apr 2010 | B2 |
7730478 | Weissman | Jun 2010 | B2 |
7747648 | Kraft et al. | Jun 2010 | B1 |
7779039 | Weissman et al. | Aug 2010 | B2 |
7779475 | Jakobson et al. | Aug 2010 | B2 |
7818194 | Yoshida et al. | Oct 2010 | B2 |
7827208 | Bosworth et al. | Nov 2010 | B2 |
7831455 | Yoshida et al. | Nov 2010 | B2 |
7840413 | Yoshida et al. | Nov 2010 | B2 |
7853881 | Assal et al. | Dec 2010 | B1 |
7945653 | Zukerberg et al. | May 2011 | B2 |
8005896 | Cheah | Aug 2011 | B2 |
8014943 | Jakobson | Sep 2011 | B2 |
8015495 | Achacoso et al. | Sep 2011 | B2 |
8032297 | Jakobson | Oct 2011 | B2 |
8073850 | Hubbard et al. | Dec 2011 | B1 |
8082301 | Ahlgren et al. | Dec 2011 | B2 |
8095413 | Beaven | Jan 2012 | B1 |
8095531 | Weissman et al. | Jan 2012 | B2 |
8095594 | Beaven et al. | Jan 2012 | B2 |
8103611 | Tuzhilin et al. | Jan 2012 | B2 |
8150913 | Cheah | Apr 2012 | B2 |
8209308 | Rueben et al. | Jun 2012 | B2 |
8209333 | Hubbard et al. | Jun 2012 | B2 |
8275836 | Beaven et al. | Sep 2012 | B2 |
8457545 | Chan | Jun 2013 | B2 |
8484111 | Frankland et al. | Jul 2013 | B2 |
8490025 | Jakobson et al. | Jul 2013 | B2 |
8504945 | Jakobson et al. | Aug 2013 | B2 |
8510045 | Rueben et al. | Aug 2013 | B2 |
8510664 | Rueben et al. | Aug 2013 | B2 |
8566301 | Rueben et al. | Oct 2013 | B2 |
8646103 | Jakobson et al. | Feb 2014 | B2 |
20010044791 | Richter et al. | Nov 2001 | A1 |
20020072951 | Lee et al. | Jun 2002 | A1 |
20020082892 | Raffel et al. | Jun 2002 | A1 |
20020129352 | Brodersen et al. | Sep 2002 | A1 |
20020140731 | Subramaniam et al. | Oct 2002 | A1 |
20020143997 | Huang et al. | Oct 2002 | A1 |
20020162090 | Parnell et al. | Oct 2002 | A1 |
20020165742 | Robbins | Nov 2002 | A1 |
20030004971 | Gong | Jan 2003 | A1 |
20030018705 | Chen et al. | Jan 2003 | A1 |
20030018830 | Chen et al. | Jan 2003 | A1 |
20030046098 | Kim | Mar 2003 | A1 |
20030066031 | Laane et al. | Apr 2003 | A1 |
20030066032 | Ramachandran et al. | Apr 2003 | A1 |
20030069936 | Warner et al. | Apr 2003 | A1 |
20030070000 | Coker et al. | Apr 2003 | A1 |
20030070004 | Mukundan et al. | Apr 2003 | A1 |
20030070005 | Mukundan et al. | Apr 2003 | A1 |
20030074418 | Coker et al. | Apr 2003 | A1 |
20030120675 | Stauber et al. | Jun 2003 | A1 |
20030151633 | George et al. | Aug 2003 | A1 |
20030159136 | Huang et al. | Aug 2003 | A1 |
20030187921 | Diec et al. | Oct 2003 | A1 |
20030189600 | Gune et al. | Oct 2003 | A1 |
20030204427 | Gune et al. | Oct 2003 | A1 |
20030206192 | Chen et al. | Nov 2003 | A1 |
20030225730 | Warner et al. | Dec 2003 | A1 |
20040001092 | Rothwein et al. | Jan 2004 | A1 |
20040010489 | Rio et al. | Jan 2004 | A1 |
20040015981 | Coker et al. | Jan 2004 | A1 |
20040027388 | Berg et al. | Feb 2004 | A1 |
20040128001 | Levin et al. | Jul 2004 | A1 |
20040186860 | Lee et al. | Sep 2004 | A1 |
20040193510 | Catahan et al. | Sep 2004 | A1 |
20040199489 | Barnes-Leon et al. | Oct 2004 | A1 |
20040199536 | Barnes-Leon et al. | Oct 2004 | A1 |
20040199543 | Braud et al. | Oct 2004 | A1 |
20040249854 | Barnes-Leon et al. | Dec 2004 | A1 |
20040260534 | Pak et al. | Dec 2004 | A1 |
20040260659 | Chan et al. | Dec 2004 | A1 |
20040268299 | Lei et al. | Dec 2004 | A1 |
20050050555 | Exley et al. | Mar 2005 | A1 |
20050091098 | Brodersen et al. | Apr 2005 | A1 |
20060036563 | Wu | Feb 2006 | A1 |
20080249972 | Dillon | Oct 2008 | A1 |
20090063415 | Chatfield et al. | Mar 2009 | A1 |
20090100342 | Jakobson | Apr 2009 | A1 |
20090177744 | Marlow et al. | Jul 2009 | A1 |
20090204478 | Kaib et al. | Aug 2009 | A1 |
20090276413 | Uchida | Nov 2009 | A1 |
20100057677 | Rapp et al. | Mar 2010 | A1 |
20110106808 | Hersans et al. | May 2011 | A1 |
20110218958 | Warshavsky et al. | Sep 2011 | A1 |
20110225119 | Wong et al. | Sep 2011 | A1 |
20110247051 | Bulumulla et al. | Oct 2011 | A1 |
20110276535 | Pin et al. | Nov 2011 | A1 |
20110276601 | Pin et al. | Nov 2011 | A1 |
20110302098 | Yoshida et al. | Dec 2011 | A1 |
20110307510 | Lopitaux et al. | Dec 2011 | A1 |
20120042218 | Cinarkaya et al. | Feb 2012 | A1 |
20120233137 | Jakobson et al. | Sep 2012 | A1 |
20120290407 | Hubbard et al. | Nov 2012 | A1 |
20130212497 | Zelenko et al. | Aug 2013 | A1 |
20130218948 | Jakobson | Aug 2013 | A1 |
20130218949 | Jakobson | Aug 2013 | A1 |
20130218966 | Jakobson | Aug 2013 | A1 |
20130247216 | Cinarkaya et al. | Sep 2013 | A1 |
20140359537 | Jakobson et al. | Dec 2014 | A1 |
20150006289 | Jakobson et al. | Jan 2015 | A1 |
20150007050 | Jakobson et al. | Jan 2015 | A1 |
20150095162 | Jakobson et al. | Apr 2015 | A1 |
20150142596 | Jakobson et al. | May 2015 | A1 |
Entry |
---|
instranet.com—“Company Overview, Contact, News”—May 24, 2008 Publisher: www.archive.org—pp. 5 URL:http://web.archive.org/web/20080518021817/http://instranet.com/index.asp. |
“Google Plus Users”, Google+Ripples, Oct. 31, 2011 [retrieved on Feb. 21, 2012 from Internet at http://www.googleplusers.com/google-ripples.html], 3 pages. |
Number | Date | Country | |
---|---|---|---|
20110307510 A1 | Dec 2011 | US |
Number | Date | Country | |
---|---|---|---|
61354003 | Jun 2010 | US |