Abstract: Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.

Abstract: A computerized reference analysis tool utilizes a prior art reference collection process to create a relatively smaller set of relevant references, together with a computerized reference ranking engine that ranks the set of harvested references for relevance with respect to the entirety of a claim set for a patent or patent application. The results of the computerized reference analysis tool harvesting and ranking this smaller set of prior art references can be presented to a user as an aggregated relevance listing, together with a visually or graphically displayed representation of the relevance ranking of the prior art references relative to individual claims and/or to individual claim elements.

Abstract: A system extracts data from profiles on a social networking system. The system writes the data to a database when the data exceeds a first threshold. The system then determines a degree of similarity between the data and other similar data, and writes the data and a first portion of the other similar data to the database when the degree of similarity between the data and the first portion of the other similar data exceeds a second threshold. The system then receives into the computer processor input from a plurality of users. The input relates to an agreement or disagreement regarding the degree of similarity between the data and the first portion of the other similar data. The system writes the data and a second portion of the other similar data to the database as a function of the agreement or disagreement of the plurality of users.

Abstract: Query optimizer accuracy is tested by measuring the actual execution times on a database of each of a plurality of alternative query plans for each of a plurality of queries, first ranking the plans by the actual execution times, then ranking the plans by estimated execution times, and correlating the two rankings by computing a rank correlation metric. The rank correlation metric is normalized so that different optimizers can be objectively compared.

Abstract: A system including a processor and a memory storing instructions that, when executed, cause the system to: receive a stream of content including a plurality of content items; retrieve a plurality of related content items; identify a topic for at least one of the plurality of the related content items; rank the topics by relevance to the user and one of the plurality of items; associate the topic to the content item in the stream of content where the topic is ranked as being relevant to the content item; generate a marker for the topic; generate an interface including the marker associated with the content item in the stream of content; and provide the interface for display.

Abstract: Some embodiments provide a file system for purging content based on a single traversal of the file system that identifies the directory containing the content without performing a secondary traversal within the directory to target the operation to only the file that are associated with content such that other files contained in the directory are unaffected. The file system supplements traditional directory structures with file-level directories. Each file-level directory is created to contain a root file associated with particular content, different variants of the particular content, and supporting files. Consequently, the file system can complete an operation targeting particular content by performing that operation on the file-level directory containing the particular content, thereby eliminating the need to conduct a file-by-file traversal of the containing directory as a prerequisite to identifying the files associated with the particular content and performing the operation on the files individually.

Abstract: A method for providing a search sample without a search being triggered is disclosed. The method includes receiving at least one partial search term in a search box. Probable search terms are determined by comparing the at least one partial search term to a database of common search terms. The probable search terms are displayed in a format that include a link to a sample search of each probable search term and a backslide button. When the link to a sample search of a probable search term is selected in the probable search terms, the sample search is displayed in a format that includes a close link. When the close link is selected in the sample search, the probable search terms are displayed again. When the backslide button is selected, the right most word from the search term is deleted.

Abstract: A data storage system protects virtual machines using block-level backup operations and restores the data at a file level. The system accesses the virtual machine file information from the file allocation table of the host system underlying the virtualization layer. A file index associates this virtual machine file information with the related protected blocks in a secondary storage device during the block-level backup. Using the file index, the system can identify the specific blocks in the secondary storage device associated with a selected restore file. As a result, file level granularity for restore operations is possible for virtual machine data protected by block-level backup operations without restoring more than the selected file blocks from the block-level backup data.

Abstract: The present invention relates to systems and methods for cloud based consumer sentiment analysis with social insights. Data is integrated from a plurality of data sources, including a structured data source, an unstructured data source, a social data source, and a syndicated data source. Key attributes are selected from the integrated data, and may be name value pair requests. From these key attributes, consumer segments, sentiments and attribute correlations may be generated. The segments are generated from the social data. The correlation is generated using clustering algorithms. In some embodiments, generating sentiment and generating correlations dynamically utilizes models according to attributes of the integrated data. Polarity, emotion and topicality may be calculated for the generation of visualizations.

Abstract: Systems and methods are provided for data hub architecture to provide actionable data from remote sensor feeds. An exemplary method includes receiving, by a master hub of a plurality of data hubs, a request to access at least one first sensor in a first location and at least one second sensor in a second location from a data client, wherein the master hub is closest to the data client of the plurality of data hubs on a network, determining a first data hub that is closest to the at least one first sensor on the network, and determining a second data hub that is closest to the at least one second sensor on the network. The method further includes querying the first data hub and the second data hub for data and communicating the data to the data client.

Abstract: Capacity of a database system and/or a computing system that includes a database can be effectively changed from a current computing capacity to another computing capacity. This can be achieved by causing usage capacity of at least one of resource to be changed when the database is active. By way of example, capacity of a database system can be regulated by delaying the execution of the database work based on a target capacity. As a result, database work can take relatively longer to complete when the capacity of a database is effectively regulated to be below its full capacity. In effect, a portion of available capacity (excess capacity) can be made inaccessible to the database. However, excess capacity can be used to manage various services of the database in accordance with one or more service criteria (e.g., Service Level Goals or Agreements).

Abstract: Data from a database object are processed. Transaction information for a set of data of the database object is stored separate from the set of data in an allocated storage space, where the transaction information indicates visibility of the set of data to other transactions. A map structure is generated indicating storage of the set of data and the allocated storage space of the transaction information. The transaction information is altered in response to a transaction to the set of data to alter visibility of the set of data. Altering the transaction information is accomplished by providing updated transaction information within a new storage space in accordance with the transaction to the set of data and generating a descriptor for the transaction indicating an existing location of the set of data and the new storage space.

Abstract: A specified data type and pre-storage operation are receive. In response, an association between the two is created in storage metadata. After the association is created, data to be stored is received where the data has a data type. In response to receiving the data, the storage metadata, including the association, is accessed and it is determined if the data type of the data is the same as the specified one. If so, the specified pre-storage operation is automatically performed on the data in order to obtain an output and the output is stored.

Abstract: Systems and methods are provided herein for garbage collecting data previously tiered to cloud storage. A cloud object index can be generated and used to track objects stored in cloud storage. As objects within cloud storage are added or modified, the transactions can be tracked and the cloud object index can updated based on the activity. Expiration dates associated with cloud objects can be maintained in the cloud object index factoring in user defined retention periods, process defined retention periods for services like backup and snapshots, and regulatory defined retention periods depending on the type of data being tiered. Upon a determination that no active processes are linking to a cloud data object, that an expiration date has been met, and other custom factors, cloud objects can be removed from cloud storage permanently.

Abstract: Efficient logging in a control system is provided. A temporary history record corresponding to a message transaction placed onto a message queue data structure is generated. A total processing time for the received message transaction is determined. The total processing time is compared with a previously determined peak processing time value. In response to determining that the total processing time exceeds the previously determined peak processing time value, the temporary history record corresponding to the received message transaction is stored in an event log.

Abstract: A social graph is divided into a series of partial graphs having limited hops and reference counts. For each of a plurality of nodes in the social graph, a partial graph for the node is created having a first degree list of nodes reachable in one hop and a second degree list of nodes reachable in two hops. Reference counts of how many paths exist between the node and each node reachable in two hops are also added to the second degree list. A global inverted index is maintained containing a list of all nodes in the social graph and for each node in the social graph a list of nodes that directly connect to the node. The partial graphs created for each of the plurality of nodes are distributed across a plurality of data servers. An index of which partial graphs are stored on which data servers is maintained.

Abstract: A method is used in managing mounting of file systems. A request is received to mount a file system. The request to mount the file system is added in a pending file system mounts queue based on a policy. The file system is mounted in background. Access to the file system is provided before mounting the file system.

Abstract: Methods and systems may provide for monitoring shared content for changes by a plurality of users and selecting a subset of the shared content based on one or more collaboration characteristics associated with the changes by the plurality of users. In addition, an indexing schedule may be determined for the subset of the shared content based on the one or more collaboration characteristics. In one example, the collaboration characteristics include one or more user roles associated with one or more of the plurality of users, an operation type, a number of users making the changes and/or a frequency of the changes by the plurality of users.

Abstract: A method and system for improving an intent based search is provided. The method includes analyzing a search phase entered by a user with respect to a Website level search query for specified subject matter. In response, a subject based intent classification is determined to be associated with a confidence factor of less than 100 percent confidence with respect to the subject based intent classification being correct. The subject based intent classification is compared to search results data and a subset of search results correlating to the subject based intent classification is determined and presented to the user. An interaction of the user with respect to the subset of search results is determined and in response, a value of the confidence factor is derived.

Abstract: A database benchmark configuration is selected via an interface. At least one database partitioning scheme from a plurality of database partitioning schemes is selected via the interface. The selected database partitioning scheme is configured through the interface. The selected database partitioning scheme is evaluated based on the configuring step and the selected database benchmark configuration, and evaluation results are generated. A presentation is generated for the interface based on at least a portion of the evaluation results, wherein the presentation is configured to provide at least an indication of a performance of the selected database partitioning scheme given the configuring step and the selected database benchmark configuration.