Abstract: Embodiments of the present invention address deficiencies of the art in respect to element identification for elements in a collaborative computing environment and provide a method, system and computer program product for identifying unstructured elements of a collaborative place in a hierarchically structured manner. In one embodiment of the invention, a method for locating an unstructured element in a collaborative computing environment can be provided. The method can include receiving a request for an unstructured element in the collaborative environment, extracting a hierarchy of unique identifiers from the request, locating a last folder referenced by the hierarchy of unique identifiers, and returning a reference to the folder as a location of the unstructured element.

Abstract: A computer-implemented method for providing increased scalability in deduplication storage systems may include (1) identifying a database that stores a plurality of reference objects, (2) determining that at least one size-related characteristic of the database has reached a predetermined threshold, (3) partitioning the database into a plurality of sub-databases capable of being updated independent of one another, (4) identifying a request to perform an update operation that updates one or more reference objects stored within at least one sub-database, and then (5) performing the update operation on less than all of the sub-databases to avoid processing costs associated with performing the update operation on all of the sub-databases. Various other systems, methods, and computer-readable media are also disclosed.

Abstract: A system for extracting customer feedback from a microblog site includes a retrieval unit coupled to the microblog site to capture microblog updates. A filter unit coupled to the retrieval unit filters the captured microblog updates according to filter criteria that remove non-actionable items from the captured microblog updates. A learning unit coupled to the filter unit prioritizes the filtered microblog updates, and a classification unit coupled to the learning unit classifies the filtered and prioritized microblog updates. An action unit coupled to the classification unit performs appropriate actions based on the classified, filtered and prioritized microblog updates.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document lists for the tokens are stored at leaf nodes. When performing a fuzzy full text search, the system uses an edit distance greater than zero. After receiving search tokens, the system traverses the NVC tree to generate document error lists. The system then compares the error lists to identify relevant document identifiers and provides a result set.

Abstract: Database schema changes are managed in a database management system by identifying and marking one or more database objects for a database schema change, identifying and processing accesses to identified database objects and storing information pertaining to the identified accesses, where the identified accesses are processed with respect to the database schema without the change, evaluating the stored information to determine a frequency with which identified objects are referenced by the identified accesses over a select time period, and implementing the database schema change in response to an indication that the frequency is below a threshold value.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for locally defining related reports using a global definition. These mechanisms and methods for locally defining related reports using a global definition can provide a single global definition that is applicable to various reports. The ability to provide such single global definition can enable multiple local definitions that are report specific to be configured, at least in part, using the single global definition.

Abstract: According to conventional arts, object data must be included in video data in advance. However, including the object data in the video data causes a problem to increase a data amount to be transmitted from a broadcasting station (transmission terminal) to a reception terminal. In addition, according to the conventional arts, since there is no opportunity to previously insert the object data in video data of real-time broadcasting such as live broadcasting, the user cannot display detailed information of a desired object. Provided is a technique to display detailed information of a desired object in video without increasing an amount of data in distribution of the video data when a user indicates the object in the video through a touch panel or the like, by transmitting indicated coordinate information and indication timing information corresponding to such indication to a search server, obtaining corresponding object data from the search server and displaying the object data on the display.

Abstract: Techniques for deduplicating structured datasets using hybrid chunking and header removal. According to one embodiment, a request is received to deduplicate a file having a plurality of data blocks, each data block having a header and a data portion. The data blocks are anchored using first anchors to indicate block boundaries based on their headers. At least one second anchor is added within a data portion of at least one data block if the data portion of at least one data block satisfies a predetermined condition. The data blocks are then deduplicated based on the first and second anchors.

Abstract: Embodiments of the present invention provide a method, system and computer program product for mapping models to relational databases for reporting tools. In an embodiment of the invention, a model mapping method for models of a model driven development (MDD) environment can include initializing a database table and selecting a data source storing a modeling framework representation of a model. A first query can be executed against an application programming interface (API) of the data source supporting a modeling framework query language to retrieve selected elements of the model. Likewise, a second query can be executed against the API of the data source to retrieve selected attributes of the selected elements of the model. Finally, rows of the database table can be populated with the retrieved selected elements of the model and corresponding columns of the database table can be populated with the retrieved selected attributes of the selected elements of the model.

Abstract: The subject matter of this specification can be implemented in, among other things, a computer-implemented method for identifying and storing stem variants of search query terms. The method includes receiving a first query and a user selection of a first search result from the first query. The method further includes receiving a second query and a user selection of a second search result from the second query. The method further includes determining that the first search result and the second search result have the same category. The method further includes identifying a first term in the first query and a second term in the second query as stem variants of one another by determining that the first term is within a threshold edit distance of the second term. The method further includes storing the first term and the second term in a stem-variant repository.

Abstract: Described herein are systems and methods for managing business objects. In overview, various embodiments provide software, hardware and methodologies underlying a data driven application including a data driven business layer, optionally in combination with a data driven user interface and presentation layer. In overview, an object-oriented computer program includes a presentation layer, a business layer, and a database. The business layer provides business objects, which effectively interpose the presentation layer with the database. Substantive business object data is defined within the database, and loaded to the business layer following the receipt of a page call-up request at the presentation layer.

Abstract: At least one case from a set of cases is identified in response to a query relating to at least one category. An indication is received regarding whether the at least one case belongs to the category. A categorizer is trained based on the received indication. A quantification measure associated with cases in the category is computed based on output from the categorizer.

Abstract: A system of proposing a creative keyword and a method thereof are provided, in which the system includes a search server which receives the request for search from a user terminal, analyzes in a real-time basis energy consumption of coordinate regions according to a plurality of information searched by an extracted user's keyword, and modifies association among the searched words by increasing or decreasing accessibility to associated searched words related to the request for search based on the analysis, wherein the user terminal which requests search by transmitting the user's search keyword to the search server, and receives and displays on a screen the resultant associated words.

Abstract: Techniques are described herein that are capable of provisioning and/or synchronizing a data store using common metadata. For instance, a common instance of metadata may be used in lieu of multiple instances of the metadata that correspond to respective items in the data store for indicating a time at which the data store was provisioned. Each time a change occurs with respect to an item in a data table of the data store after provisioning of the data store, a record may be added or updated in a corresponding tracking table. When a request is made for changes that have occurred with respect to the items in a data table, the common instance of the metadata may be used to generate a record in the corresponding tracking table for each item in the data table that did not change since the data store was provisioned.

Abstract: Technology is described herein for creating new, inferred queries that are suitable for use as query suggestions. The technology includes mapping different past queries that represent different information requests, but that share a number of terms having the same or similar form. An inferred query is created by replacing unshared terms in one mapped query with the unshared terms in another mapped query, based on the similarity between the unshared terms in the two mapped queries. The inferred query thus represents a new information request that is derived from the information requests of the past queries used to form it. The inferred query can then be provided as a query suggestion, which increases the likelihood of providing query suggestions that will assist users in finding the information they seek. In doing so, meaningful query suggestions can be provided to users seeking information outside the coverage of the past queries.

Abstract: A technique for resizing a first RCU-protected hash table stored in a memory. A second RCU-protected hash table is allocated in the memory as a resized version of the first hash table having a different number of hash buckets, with the hash buckets being defined but initially having no hash table elements. The second hash table is populated by linking each hash bucket thereof to all hash buckets of the first hash table containing elements that hash to the second hash bucket. The second hash table is then published so that it is available for searching by hash table readers. The first table is freed from memory after waiting for a grace period which guarantees that no readers searching the first hash table will be affected by the freeing.

Abstract: A technique for resizing a first RCU-protected hash table stored in a memory. A second RCU-protected hash table is allocated in the memory as a resized version of the first hash table having a different number of hash buckets, with the hash buckets being defined but initially having no hash table elements. The second hash table is populated by linking each hash bucket thereof to all hash buckets of the first hash table containing elements that hash to the second hash bucket. The second hash table is then published so that it is available for searching by hash table readers. The first table is freed from memory after waiting for a grace period which guarantees that no readers searching the first hash table will be affected by the freeing.

Abstract: A method of assessing the value of tags in a collaborative tagging system can include monitoring user interaction with each of a plurality of tags and/or artifacts associated with tags, wherein each of the plurality of tags has been previously associated with at least one artifact of the collaborative tagging system. For each of the plurality of tags, a measure of value for the tag can be determined according to user interaction with the tag. A list comprising at least one tag and an indication of the measure of value of the tag can be output.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for analyzing quality of user-generated content involve identifying interactions between users through an electronic network and assigning a weighting factor to each interaction representing a quality of the interaction. A user credential score is generated for each user based on the weighting factors for each interaction. The user credential scores are stored in association with a user identifier on a computer-readable storage device.