Abstract: A method for event-based comment grouping for content items is disclosed. The method includes identifying comments corresponding to a content item, the comments comprising playback timestamp information transformed into selectable links to access a corresponding portion of the content item during playback of the content item, dividing the content item into a plurality of time interval segments, grouping the received comments into the time interval segments based on the playback timestamp information of each comment, selecting a time interval segment of the time interval segments, and providing comments corresponding to the selected time interval segment for display during playback of the content item.

Abstract: A system for providing an auto-complete query to a user terminal includes a query indexing unit configured to index search queries. Each of the search queries is associated with location information. The indexing includes incorporating the location information into an associated one of the search queries. At least one of the search queries being a previously provided auto-complete query. The system includes a keyword generating unit configured to generate a keyword by incorporating location information associated with the user terminal into a query inputted by the user terminal. The system includes a query providing unit configured to determine that at least one of the indexed search queries corresponds to the generated keyword, and provide, to the user terminal, the determined at least one of the indexed search queries as the auto-complete query.

Abstract: Enterprises express the concepts of their electronic business-to-business (B2B) communication in differently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.

Abstract: A method constructs data visualizations. The method receives a visual specification, which includes properties and corresponding user-selected property values. The visual specification defines a data visualization layout. One property value identifies source databases for the data visualization. The method constructs node queries from the visual specification corresponding to one or more data fields in the source databases. The method also constructs link queries from the visual specification corresponding to a relationship between rows of the source databases. The method retrieves node tuples from the database that satisfy at least one of the node queries and retrieves link tuples from the database that satisfy at least one of the link queries. The method displays visual marks corresponding to the retrieved node tuples and displays edge marks in the corresponding to the retrieved link tuples. Each edge mark visually connects a pair of visual marks corresponding to the node tuples.

Abstract: According to some embodiments, it may be determined that a plurality of hybrid database version upgrade migrations are to be performed. Each upgrade migration may include, for example, a schema change portion and a data change portion. A first database migration tool instance may be automatically run to perform the upgrade migration schema change portions. Similarly, a second database migration tool instance may be automatically run to perform the upgrade migration data change portions, wherein the second instance is not run until the first instance is complete.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table build phase involves executing vectorized instructions to determine whether a bucket in a hash table includes a free slot for inserting a key. A number of data elements from the bucket are loaded in a register. A vectorized instruction is executed against the register may be used to determine a position, within the register, that contains the “smallest” data element. If the data element at that position is zero (or negative), then it is determined that the corresponding position in the bucket is an available slot for inserting a key and corresponding data value.

Abstract: Search results may include both objective results and person results. In one example, a search query is evaluated to determine whether it is the type of query that a user might want to ask to a friend. If the query is of such a type, then the search engine may examine a social graph to determine which friends of the user who entered the query may have information that is relevant to answering the query. If such friends exist, then the friends may be displayed along with objective search results, along with an explanation of each friend's relevance to the query. Clicking on a person in the results may cause a conversation to be initiated with that person, thereby allowing the user who entered the query to ask his or her friend about the subject of the query.

Abstract: Embodiments of the present disclosure are directed to, among other things, managing inventory indexing of one or more data storage devices. In some examples, a storage service may store an index associated with archived data. Additionally, the storage service may receive information associated with an operation performed on the archived data. The storage service may also partition the received information into subsets corresponding to an identifier. In some cases, the identifier may be received with or otherwise be part of the received information. The storage service may also retrieve at least a portion of the index that corresponds to the subset. Further, the storage service may update the retrieved portion of the index with at least part of the received information. The updating may be based at least in part on the subsets.

Abstract: A datacenter management system uses data collection proxies to collect performance data and configuration data for different physical and virtual entities in the datacenter. A schema is used to represent the different entities, entity relationships, and entity properties in the datacenter. A search engine identifies the intent of a natural language based search query based on the schema and a datacenter dictionary. The search engine then searches the data based on the search query intent. A dictionary manager converts both periodic and aperiodic data into a time series. This allows the search engine to operate as a time machine identifying both performance data and configuration data for any selectable time period.

Abstract: Provided are techniques for the modification of social collaborative maps that include processors; a computer-readable storage medium (CRSM); a concept map stored on the CRSM, the concept map comprising a plurality of nodes; a plurality of connections between the plurality of nodes; and a plurality of social network connections, wherein each node of the plurality of nodes is coupled to a corresponding subset of the plurality of social network connections; and logic, stored on the CRSM and executed on the plurality of processors, for providing a user interface to provide a user access to the plurality of nodes and to the plurality of social network connections; collecting data corresponding to navigation of the user of the plurality of nodes and interaction by the user with the plurality of social network connections; analyzing the data and modifying, based upon the analyzing, the concept map to generate a modified concept map.

Abstract: A method for determining an index of an object in a sequence of objects, the method comprising the steps of: obtaining a unique identifier value of a given object O; obtaining a query definition Q of a sequence, the Q query including an order definition according to a parameter of the O object; constructing a Q? query based on the Q query, the Q? query being different from the Q query by having a reversed ordering of results, with respect to the Q query, and providing results having said parameter value of objects preceding or matching the parameter value of the object O in the sequence of objects in the Q query result set; executing the Q? query by a query execution engine; checking whether the object O is present as the first item in Q? result set and in case it is, obtaining the index of the O object in Q sequence by retrieving objects count of the Q? result set.

Abstract: Crawling computer-based documents by performing static analysis on a computer-based document to identify within the computer-based document one or more execution vectors, where each execution vector includes a computer program segment including a call to an entity that is external to the computer-based document, and one or more additional computer program segments whose execution precedes and leads ultimately to execution of the computer program segment that includes the call to the entity, and causing any of the computer program segments in any of the execution vectors to be executed during a crawling of the computer-based document, and any computer program segment within the computer-based document that is excluded from the execution vectors to be excluded from execution during the crawling of the computer-based document.

Abstract: Method and systems for executing an interactive computer simulation of a simulated vehicle comprising a remote data management system, a central repository, a remote repository and an interactive computer simulation station. The central repository stores a synthetic natural environment database (SNEDB) that comprises data records for a plurality of geographically-located terrain skin representations of a computer generated environment. The remote data management system maintains the remote repository storing a subset of data records from the SNEDB. Each one of the subset of data records has a priority tag. The station sends a data request for geographical locations from the SNEDB and allows users to interact in the simulation for controlling the simulated vehicle.

Abstract: A method of creating a contingency table is provided. Whether or not a variable level list exists for a second variable in tree data is determined. When the variable level list exists for the second variable in the tree data, a first node memory structure is determined for the second variable from the variable level list, a first value of a first variable is determined using a first observation indicator and the tree data, and a first counter value is added to the contingency table in association with the first value of the first variable and a first value of the second variable. The first node memory structure includes the first value indicator, the first counter value, and the first observation indicator. The first value indicator indicates a first value of the second variable.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.

Abstract: Methods and systems for publishing a playlist are disclosed. A user generates or selects a playlist, which is then provided (e.g., uploaded) for publishing. A playlist identifying at least one of one or more tracks and one or more albums is received. The playlist may then be published such that the playlist is viewable by one or more individuals. A user may then purchase one or more tracks/albums identified in the playlist via an online store.

Abstract: A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval.

Abstract: A processor determines a predicted quantity of updates to be made to a set of data using a history of updates. The set of data is associated with a category of replication that indicates a first frequency of data replication to be applied to the set of data. The processor determines whether the first predicted quantity of updates meets a first threshold for a frequency of replication of the set of data. The first threshold indicates an allowed number of updates and meeting the first threshold indicates that an adjustment to the frequency of replication of the set of data is to be initiated. The processor responds to a determination that the first threshold has been met by associating the set of data with a category of replication that has a second frequency of data replication to be applied to the set of data.

Abstract: A method and apparatus for performing storage and retrieval in an information storage system cache is disclosed that uses the hashing technique with the external chaining method for collision resolution. In order to prevent performance deterioration due to an unrestrained growth in the length of chains, an on-the-fly record removal technique is combined with background chain-pruning processes that continually trim long chains to keep chain lengths at an acceptable equilibrium without triggering abrupt, disruptive action at the time the system senses that it is stressed. More specifically, each insertion, retrieval, or deletion of a record is an occasion to rid an entire linked list of its records that have aged out. Additionally, concurrent background processes continually navigate the hash table, trimming those chains that are deemed excessively long.

Abstract: Accessing a file on a sequentially accessed storage device such as a magnetic tape often involves bypassing valid files and gaps between valid files. Presently taught is a method of copying valid files being bypassed to a second sequentially accessed storage device while not copying the gaps. When a read target file is reached, the read target file is read. During a write to a file writing position, valid files are copied to the second sequentially accessed storage device until the file writing position is reached and the file is written at the end of the valid files on the second sequentially accessed storage device.