Abstract: Methods, devices and systems to make compressed backup copies of in-use compressed database indices are described. In general, an “oldest” time at which index pages in working memory had been updated is identified. Compressed index pages may be directly copied without the need to bring them into working memory or uncompressing them. The identified “oldest” time is then associated with the compressed backup copy. In some embodiments, an entire compressed backup copy may be associated with a single point in time (e.g., the identified “oldest” time). In other embodiments, a compressed backup copy may be associated with multiple points in time (e.g., one time for each portion of the compressed index that is being backed-up). Compressed indices copied in accordance with the invention may be used during restore operations to reconstruct database indices using the identified “oldest” time and database log files.

Abstract: Methods and apparatuses are provided that facilitate providing one or more profiles to an application executing on a device. The application can request one or more profiles, which can relate to an application type. The application type can be specified in the profile request, determined based on a profile indicated in the profile request, etc. Where the application type corresponds to an operator-specific application type, one or more operator identifiers in the profile request can be verified with one or more other operator identifiers in an identity module of the device. Where the operator identifiers match, the requested profile can be provided to the application. Where the operator identifiers do not match, an invalid profile, error code, etc. can be provided to the application. In this regard, operators can control utilization of specific profiles that can be defined by the operator.

Abstract: According to example configurations, a digital asset manager receives a digital asset. The digital asset manager generates multiple sets of thumbnail data based on the digital asset. Each of the multiple sets of thumbnail data can be encoded to support display of a different thumbnail resolution of the digital asset. The digital asset manager initiates storage of the multiple sets of thumbnail data in a unit of storage of a repository. The unit of storage can be pre-allocated for storing the multiple sets of thumbnail data associated with the digital asset. Accordingly, in lieu of storing data for each thumbnail in a different file as in conventional methods, configurations herein can include storing thumbnail data in the same unit of storage or file. Thus, multiple sets of thumbnail data for a corresponding digital asset can be stored in a single file.

Abstract: Methods and systems for augmenting a token lexicon are presented. In one embodiment, a method comprising identifying a first token from a search request, storing the first token in a lexicon data storage, receiving a character string comprising a second token, wherein the second token is substantially similar to the first token, and parsing the character string using the lexicon data storage to resolve the second token is set forth. According to another embodiment, a method comprising identifying a first token from an internet article, storing the first token in a lexicon data storage, receiving a character string comprising a second token, wherein the second token is substantially similar to the first token, and parsing the character string using the lexicon data storage to resolve the second token is set forth.

Abstract: A particular case is matched to further cases, where the matching is based on plural attributes contained in the particular case and in the further cases, wherein one of the plural attributes relates to a flow of activities taken to address the respective case.

Abstract: A system, method, and computer program product are provided where non-convertible lines in a database that that are comprised of characters that are not recognized by a codepage of the database are identified as result of a predefined assessment and are then exported from the database. The exported non-convertible lines are automatically converted to convertible lines by using a mapping table, and the non-convertible lines are deleted from the database. After deleting the non-convertible lines, a predefined conversion command is executed on the database, thereby converting all characters of the database from an ISO format to a UTF8 format, and then the convertible lines are imported into the database utilizing a predefined import utility that automatically converts all characters of the convertible lines, once inserted into the database, from the ISO format to the UTF8 format.

Abstract: The index scan device acquires information on a search space in a multi-dimensional space corresponding to a search range of a query; sets, as a search point, a data point corresponding to at least one of a minimum and a maximum of values obtained by changing each data point in the multi-dimensional space to be one-dimensional, from among data points contained in the search space or the partial search space; identifies index data associated with a partial space containing the search point; estimates a boundary line passing through the search space on the basis of identification information on the partial space obtained from the identified index data; and determines, from among divided search spaces obtained by dividing the search space by the estimated boundary line.

Abstract: A method and computer-readable storage media are provided for reorganizing a database. The method may monitor the database to determine whether the database reorganization is required. The method may also include determining the database reorganization is required. The method may further include determining a first and second amount of space to add to the database for additional entries of a category of data according to a first and second predictive sizing calculation. The method may further include the selecting of either the first or second amount of space to add to the database for additional entries of the category of data during the reorganization. The method may further include performing the reorganization of the database including allocating the selected amount of space to add to the database for additional entries in the database of the category of data by using the computer system operatively coupled to the storage device.

Abstract: A method and computer-readable storage media are provided for reorganizing a database. The method may monitor the database to determine whether the database reorganization is required. The method may also include determining the database reorganization is required. The method may further include determining a first and second amount of space to add to the database for additional entries of a category of data according to a first and second predictive sizing calculation. The method may further include the selecting of either the first or second amount of space to add to the database for additional entries of the category of data during the reorganization. The method may further include performing the reorganization of the database including allocating the selected amount of space to add to the database for additional entries in the database of the category of data by using the computer system operatively coupled to the storage device.

Abstract: A method is provided for searching for multimedia content items on the internet. According to the method, a search page of a search provider is loaded, search text is transmitted from the client to the search provider, an application is executed at the search provider to detect multimedia content items stored in servers and associated with the search text, a results page is transmitted from the search provider to the client. Additionally, each detected multimedia content item is associated with a predetermined type of content items, the results page is divided into multiple areas that are each associated with a corresponding type, and internet addresses of the detected multimedia contents are placed into each of the areas.

Abstract: A system and method for generating query refinement suggestions may include collecting refinement data for at least one received source query. The collected refinement data is then clustered to form at least one cluster. At least one potential refinement query suggestion is identified from the refinement data within the at least one cluster.

Abstract: A system providing a method for implementing effective date constraints in a role hierarchy is described. In one embodiment, for example, the method comprises the steps of: storing data that represents a first effective date constraint on a role of a role hierarchy, the first effective date constraint having a start date and an end date; storing data in a database that represents a second effective date constraint on a grant of the role to a grantee, the second effective date constraint having a start date and an end date; storing data in a database that represents a third effective date constraint on the grantee, the third effective date constraint having a start date and an end date; and computing a net effective date constraint for the role by computing the intersection of the first effective date constraint, the second effective date constraint, and the third effective date constraint.

Abstract: The present invention relates to a method and an apparatus for data migration of a first file system in a data storage system comprising a plurality of client computers 100, a first file system managing unit 310 for managing the first file system and being connected to the plurality of client computers 100, and a second file system managing unit 410 for managing a second file system and being connected to the first file system managing unit 310, the second file system comprising a plurality of data files and the first file system comprising a plurality of external link objects, each external link object of the first file system being associated with a respective data file of the second file system for enabling client access to the respective data file of the second file system.

Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.

Abstract: Native applications inherit transaction contexts when invoked by primary applications running in separate hosting environments, by: receiving, by an interface of a native application server in a first hosting environment, a unique transaction context identifier for an invocation of the native application at the native application server by the primary application at a primary application server in a second hosting environment; receiving a SQL statement from the native application by the interface of the native application server; sending the SQL statement and the unique transaction context identifier to the primary application server for execution by the interface of the native application server; receiving a result of the execution of the SQL statement and the unique transaction context identifier from the primary application server by the interface of the native application server; and sending the result to the native application by the interface of the native application server.

Abstract: Contextual or cumulative interpretation is applied to individual user queries to improve the accuracy of sponsored and/or non-sponsored search results. Queries are interpreted based on present features derived from a user query in the context of past features derived from qualified past queries such as those previously received during a user query session. Based on contextual interpretation, present features may be augmented using past features. A search is performed using augmented features instead of present features. Contextual interpretation of queries improves search system understanding of the context in which queries are submitted, which is particularly helpful when interpolating query intent to develop features not expressed in a query. Contextual interpretation permits queries to be interpreted and treated more uniformly and more intelligently. As a result, users and advertisers benefit from more precise sponsored and/or non-sponsored search results.

Abstract: Aspects are disclosed for publishing contents of a content store. A storage operation is performed, and a completion of the storage operation is detected. Here, the storage operation redundantly stores contents of a content set onto instances associated with a content store. The contents stored in the instances are then published in response to the completion of the storage operation. In another aspect, a dataset table is generated to facilitate storing contents of a content set, which include payload and metadata. The payload is stored onto a payload table, and the metadata is stored onto a metadata table. For this embodiment, the dataset table includes a first foreign key to the payload table, whereas the metadata table includes a second foreign key to the dataset table. The dataset table is monitored to determine a storage status of the contents, and the contents are subsequently published based on the storage status.

Abstract: The technology is directed to providing sequential access to data using scalable data structures. In some embodiments, the scalable data structures include a first data structure, e.g., hash map, and a second data structure, e.g., tree data structure (“tree”). The technology receives multiple key-value pairs representing data associated with an application. A key includes a prefix and a suffix. While the suffixes of the keys are distinct, some of the keys can have the same prefix. The technology stores the keys having the same prefix in a tree, and stores the root node of the tree in the first data structure. To retrieve values of a set of input keys with a given prefix, the technology retrieves a root node of a tree corresponding to the given prefix from the first data structure using the given prefix, and traverses the tree to obtain the values in a sequence.

Abstract: A method and system for analyzing data records includes allocating groups of records to respective processes of a first plurality of processes executing in parallel. In each respective process of the first plurality of processes, for each record in the group of records allocated to the respective process, a query is applied to the record so as to produce zero or more values. Zero or more emit operators are applied to each of the zero or more produced values so as to add corresponding information to an intermediate data structure. Information from a plurality of the intermediate data structures is aggregated to produce output data.

Abstract: In an information management system, activity data is collected and analyzed for patterns. The information management system may be policy based. Activity data may be organized as entries including information on user, application, machine, action, object or document, time, and location. When checking for patterns in the activity or historical data, techniques may include inferencing, frequency checking, location and distance checking, and relationship checking, and any combination of these. Analyzing the activity data may include comparing like types or categories of information for two or more entries.