Abstract: A method of providing an index structure in a database comprising a plurality of types of objects, each type of objects comprising at least one object. It comprises the steps setting one position of an identity index bit vector of each object in said database to one and all other positions to zero, said position being different for each object, and forming, for each object in said database, a relation index bit vector by combining all identity index bit vectors of objects that said each object is related to, wherein each bit vector has a length equal to the number of objects.

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Meaningful words or phrases may be extracted from the information and used as tags. Weights may be determined for the tags, and tag clouds may be generated for the items. The tag clouds may be stored to a data store. Information specifying a tag cloud may be received. Recommended items for which the tag clouds most closely match the specified tag cloud may be identified. Standard vector space distance calculations, for example the cosine distance between the tag clouds, may be used to determine cloud similarity. The results may be filtered to optimize relevance, novelty and familiarity in accordance with preferences of the user. The recommended items may be displayed to a user interface. Users may interact with the user interface to steer the recommendations towards more relevant content.

Abstract: Aspects of this disclosure generally are related to significant systems and methods of processing qualitative, comment-style, responses provided by a population, and for corresponding production of significant visualizations configured to efficiently facilitate insight into population characteristics and matters important to the population. According to some embodiments, qualitative, or open-ended, comment-style responses are assigned priority values by participants. Based at least on an analysis of these priority values, groups of participants, qualitative responses, or both, are identified, according to some embodiments. In some embodiments, a significant visualization is generated that visually presents the groups at least in part via clusters of visual representations of participants, qualitative responses, or both based at least on results of the analysis.

Abstract: The present disclosure relates to evaluating different semantic interpretations of a search query. One example method includes obtaining a set of search results for a particular search query submitted to a search engine; obtaining a set of semantic interpretations for the particular search query; obtaining, for each semantic interpretation of the set, a canonical search query; generating a modified search query based at least in part on the particular search query and the canonical search query for the semantic interpretation; obtaining a set of search results for the modified search query for the semantic interpretation; and determining, for each semantic interpretation of the set, a degree of similarity between (i) the set of search results of the modified search query for the semantic interpretation, and (ii) the set of search results for the particular search query.

Abstract: Disclosed is a method and system for enabling storytelling on a computing device. A processor (a) analyzes a first set of media items associated with a user, where each media item has associated metadata; (b) identifies, based on analysis of the associated metadata in the first set, one or more related characteristics among the media items in the first set; (c) forms a cluster of media items associated with an event based on the one or more characteristics; (d) repeats steps (a) and (b) for a second set of media items; (e) adds one or more media items in the second set having the one or more related characteristics, from a computing device associated with the second set, to the cluster; (f) edits selected media items in the cluster to fit into selected templates; and (g) creates a mixed-media module comprising the templates organized into a desired sequence.

Abstract: A query may be rewritten to leverage information stored in a structured XML index. An operator in the query may be analyzed to determine an input source database object for the operator by traversing an operator tree rooted at the operator. The path expressions associated with the operator tree may be fused together to form an effective path expression for the operator. If the effective path expression directly matches a path expression derived from the index, the query may be rewritten using references to the index. Operators in a query that have effective paths that refer to data in the same index table may be grouped together. A single subquery may be written for a group of operators. Also, a structured XML index may be used as an implied schema for indexed XML data. This implied schema may be used to optimize queries that refer to the indexed XML data.

Abstract: Embodiments provide an approach for efficiently searching a temporal key index as well as enforcing key distinctiveness property in a database table corresponding to the index. For example, by addressing time range overlaps in an index having a sort order for temporal keys, a database management tool of a server system may efficiently process client requests while enforcing a temporal key property in the database table.

Abstract: A computer is programmed to identify failures and perform recovery of data. Specifically, in several embodiments, the computer is programmed to automatically check integrity of data in a storage structure to identify a set of failures related to the storage structure. The computer is further programmed in some embodiments to identify, based on one failure in the set of failures, a group of repairs to fix that one failure. Each repair in the group of repairs is alternative to another repair in the group. The computer is also programmed in some embodiments to execute at least one repair in the group of repairs, so as to generate corrected data to fix the one failure. In certain embodiments, the corrected data is stored in non-volatile storage media of the computer.

Abstract: Disclosed herein are embodiments of a system and method for the dynamic provisioning of static content. In one embodiment, information presented on a content delivery system can be refreshed based on information published on a content management system. One embodiment can interface the content delivery system and the content management system at the page level. More specifically, content dependencies across pages employing the same content or portion(s) thereof can be tracked in a timely, accurate manner. Upon receiving a notification of a change to the content or a portion thereof from the content management system, a content generation system may operate to determine, based on the dependencies, what pages are affected by the change and, based on the determination, dynamically regenerate any and all affected pages. The regenerated pages may then be stored and/or pushed to the web tier for delivery to end users.

Abstract: A service-related repository provides access to subscriber information to third party application service providers without providing the third party application service providers with access to a main network repository. The service-related repository stores subscriber information in a standardized format and in a format tailored for each third party application service provider. The subscriber information stored within the service-related repository mirrors network subscriber information stored within the main network repository. The main network repository is distinct from a secondary repository that includes the service-related repository. The secondary repository also includes a subscriber-related repository for storing the subscriber information in a standardized format.

Abstract: The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).

Abstract: Embodiments of the present invention provide a system and method for collaborative data intelligence. Embodiments of the present invention can include one or more data stores and one or more data warehouses (DWHs), each individually configured to communicate with a physical storage management system. Embodiments of the present invention can be used to manage the chaotic disorder of social data in real time, using a collaborative DWH model and big data store, in order to assess the potential of data integration to reporting and decision management.

Abstract: Techniques are provided for selectively refreshing a materialized view. A portion of a materialized view is refreshed (or updated) while other portions of the materialized view are not refreshed. Thus, the other portions of the materialized view may contain “stale” data that does not accurately reflect current data in the base table(s) upon which the materialized view is based. In one technique, a user indicates the portion of the materialized view that is to be refreshed. In another technique, a user indicates a plurality of portions of a materialized view and it is automatically determined which portion should be refreshed first. Change data that indicates information about changes made to different portions of one or more base tables and/or read data that indicates information about reads to different portions of the materialized view may be taken into account to determine which portion of a materialized view to refresh.

Abstract: A method for capturing patterns and associated points of variability includes providing an XML schema defining elements representing different point of variability (POV) types for a pattern. The elements belong to an XML schema “substitution group” to enable the POV types to be substituted for one another. In selected embodiments, the method enables a pattern author to add new or custom POV types to the “substitution group,” thereby allowing the pattern author to extend the pattern meta model to include new POV types. Once the desired POV types are defined, the method enables the pattern author to generate an instance of the XML schema, defining the points of variability for a specific pattern, using the elements defined in the XML schema “substitution group.” A corresponding apparatus and computer program product are also disclosed and claimed herein.

Abstract: Various systems and methods precalculate client-side deduplication signatures. For example, one method can identify a data object to be included in a backup and then calculate a signature of a data object prior to the start of a backup operation to create the backup. The signature identifies the data object within a deduplicated data store configured to store a backup of the data object. The signature can be calculated in response to detecting that a current usage level of system resources (e.g., such as a current processor utilization) of a client computing device is less than a threshold usage level.

Abstract: A system and method for connecting a social network to a geospatial data repository, comprising: accepting geospatial data from a user; linking the geospatial data to the user in the social network; and allowing the geospatial data to be searched and/or combined with other geospatial data from the user or other users in the social network.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for implementing algebraic data types in database query languages. One of the methods includes receiving an expression in a database query language, the expression having a programming language construct representing an algebraic data type, wherein the expression specifies two or more alternative subtypes. Respective domain relations are generated using definitions of each of the alternative subtypes within the expression. Unique domain identifiers are assigned among domain tuples belonging to each alternative subtype. A union relation is generated for the algebraic data type. Unique union identifiers are assigned for union tuples belonging to the union relation. Respective injector relations are generated for each of the alternative subtypes.

Abstract: A non-transient computer information storage medium storing an audio track inverted index, and method of its creating and maintaining, the audio track inverted index comprising a plurality of sets of posting lists, each posting list within the plurality of sets of posting lists being a posting list of chroma words, each chroma word being a component of an audio fingerprint, each of chroma words being split into a plurality of bytes, each of chroma words comprising a beginning portion of the chroma word, the beginning portion of the chroma word being a sub-plurality of bytes having a first byte and a following byte, the following byte located immediately after said first byte; within a given set of posting lists of the plurality of postings lists: each posting list contains chroma words having the same first byte within the beginning portion of the chroma word, and a first one of the plurality of posting lists being different from a second one of the plurality of posting lists by the associated chroma words ha

Abstract: A method of indexing in a skip list is disclosed. Key/value pairs are randomly inserted at an appropriate page in a skip list. A new page is created at the lowest level in the skip list. When creating the new page, the page is incremented to a higher level with a write probability. Reading the new page during a search. When reading the new page, the page is incremented to a higher level with a read probability. The read probability is not equal to the write probability.