Abstract: A Computer-executable method, system, and computer program product for managing tiers of data storage in a data storage environment using a data storage system, the Computer-executable method, system, and computer program product comprising a non-transitory computer readable medium encoded with computer-executable program code for using read signatures in replication, the code configured to enable the execution of initializing a data stack, updating a map of the data stack; and distributing the map of the data stack to a compute node.

Abstract: A method for query processing includes receiving a query, and determining a query type by determining if the query is a structured query language (SQL) query including multiple distinct aggregates (MDAs), or a SQL query including cube, rollup or grouping sets operations. Based on the determination, the method includes processing the query to generate an output, and performing a predetermined number of maximum group by operations on the output based on the query type to generate a response to the query.

Abstract: Provided are techniques for holding versions of a document. In response to adding a version of an item to a hold container, another version of the item is automatically added to the hold container based on a hold version policy type associated with the hold container.

Abstract: A processing device receives a query comprising a first field value and a time period. The processing device performs a first search of a data store using the first field value to identify a first plurality of events having the time period and a field that comprises the first field value. The processing device determines, for one of the plurality of events, a second field value of a second field that is specified in a first context definition, the second field having an assigned field type. The processing device automatically performs a second search of the data store using the additional field value to identify a second plurality of events having the time period and the additional field value. Information from the first plurality of events and the second plurality of events is aggregated, and a response to the query is generated that comprises the aggregated information.

Abstract: Methods and apparatus are provided for filtering dynamically loadable namespaces (DLNs). In one exemplary embodiment, a method comprises the steps of, in response to a job submitted by an application, obtaining a dynamically loadable namespace (DLN) portion of a global single namespace of a file system, wherein the DLN is associated with the job and is maintained in a capacity tier of object storage of a storage system; obtaining one or more filtering directives from a user; reducing the DLN based on the one or more filtering directives to generate a filtered DLN; and dynamically loading the filtered DLN, including the metadata only for the filtered DLN, from the capacity tier of object storage into a performance tier of storage of the storage system for processing by the application. The filtered DLN is merged into the original DLN following one or more modifications to the filtered DLN.

Abstract: Impact analysis of an object is performed by selecting an object and determining impacted objects corresponding to the object. A type of the object is determined. A query is formulated and executed to retrieve relationship objects from a relationship table matching the type of the selected object. Nested properties associated with the relationship objects for the individual relationship objects are determined iteratively. A parent property associated with the nested properties is identified. A query is formulated and executed to fetch dependent values corresponding to the dependent values. The dependent values are added to a list. A query is formulated and executed to determine impacted objects corresponding to the dependent values. The impacted objects are displayed in a graphical chart.

Abstract: An application specification system and method have a storage unit with an XML based schema definition for an application definition language and one or more cells with each cell having one or more components that define computational and data access aspects of an application and one or more presentations. The system and method also have a web presence that performs one or more applications that is instantiated from a cell instance that has one or more components.

Abstract: Methods and apparatuses for storing structured information are disclosed. A hash value computed over structured information determined for a host is compared to a hash value computed over a corresponding structured information stored in a remote database for the host where after an update of at least a part of the stored structured information can take place in response to determining a difference in the hash values and the stored structured information is kept in the database as it is in response to determining that the hash values are equal.

Abstract: A system for efficiently responding to proximity queries may include a memory storing an index for searching a graph-based data store, the index including posting lists for one or more proximity ranges compatible with a space. A posting list can include one or more entities of a type compatible with the space, each entity having a location within the space, the location being a basic unit in a location hierarchy for the space and, for each entity, at least one node in the location hierarchy that falls within the proximity range of the posting list with reference to the location of the entity. The system may also include a memory storing instructions that cause the system to use the index to respond to a query that includes a query proximity range for the space. The space can be a geographic space or a time space.

Abstract: A method includes selectively controlling, at a computing device having a memory, initiation of a full garbage collection operation based on a total resource usage metric and a managed object metric. The managed object metric is based on objects managed by a runtime application.

Abstract: Methods for progressive continuous range query (PCRQ) are provided. A method can include using branch-and-bound to index interest points with a tree-index and generating a nearest enter split-point for a root node in the tree-index and adding to min-heap. Next, whether min-heap has more elements and whether a next split-point in min-heap is closer than a destination can be determined. Whether a query point has reached a split-point can be investigated followed by retrieving an entry that has generated the split-point. The split-point can be then be removed from min-heap.

Abstract: An apparatus having a circuit is disclosed. The circuit may be configured to (i) generate a sequence of hash values in a table from a stream of data values with repetitive values, (ii) find two consecutive ones of the hash values in the sequence that have a common value and (iii) create a shortened hash chain by generating a pointer in the table at an intermediate location that corresponds to a second of the two consecutive hash values. The pointer generally points forward in the table to an end location that corresponds to a last of the data values in a run of the data values.

Abstract: An approach is provided dynamically prioritizing question requests based on extracted question data. In the approach, performed by an information handling system, a number of question requests to a question and answering (QA) system are received from a computer network, and a plurality of question priority parameters are identified, including one or more question topics and a plurality question context parameters, by performing natural language processing (NLP) analysis of each question request. The approach determines a target priority value for each question request based on the plurality of question priority parameters identified for said question request. By evaluating the target priority values for the plurality of question requests, processing of the question requests is prioritized by applying an artificial intelligence (AI) learned models and rule-based logic at the information handling system to evaluate the target priority values for the plurality of question requests.

Abstract: Methods and systems are provided for processing data objects in a computer system. In one embodiment, a method is provided that comprises (a) storing a first data object in a database in a non volatile storage, (b) creating a second data object assigned to the first data object, step (b) being triggered by step (a), and (c) processing the second data object by means of an object processor, the object processor creating a third data object using data contained in the second data object, data contained in the first data object and data contained in the database by applying a set of one or more pre-settable rules to the data contained in the first and second data objects and in the database.

Abstract: Mechanisms to help a computing system respond to a request for information within a data model. After determining that there is insufficient information within the data model to respond to the request, the computing system identifies one or more additional data sources that are external to the data model and that contain information suitable to respond to the request. The computing system then automatically supplements the data model with at least one of such additional data sources. The computing system then responds to the request using the supplemented data model. In some embodiments, the supplementation is performed in advance of the request by analyzing the characteristics of the data model and/or by anticipating possible future requests. Thus, a data model grows automatically in response to particular usage of that data model to satisfy requests.

Abstract: A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted.

Abstract: A method performed by one or more processing devices, comprising: receiving a request for data associated with search terms; identifying, in a storage device, the data associated with the search terms; identifying search queries associated with the search terms; determining amounts of advertising revenue for at least a plurality of the search queries; and selecting, from the plurality of the search queries and based on the amounts of advertising revenue, one or more search queries for display with the data associated with the search terms.

Abstract: Instead of transferring a large original file, such as a virtual-machine image file, from a source system to a target system, the original file is encoded to define a recipe file that is transferred. The recipe is then decoded to yield a duplicate of the original file on the target system. Encoding involves identifying standard blocks in the original file and including standard-block identifiers for the standard blocks in the recipe in lieu of the original blocks. Decoding involves an exchange with a standard-block identifier server system, which provides standard blocks in response to received standard-block identifiers.

Abstract: Methods and systems allow users to enter natural language terms that describe a particular web site into an address field of a browser instead of a formal URL. The terms are evaluated to determine whether they correspond, with a high likelihood, to a particular web site. If so, this web site may be immediately accessed. If not, a list of search results based on the terms may be displayed by the browser.

Abstract: A method for generating a dataset structure for location-based services includes partitioning a geographical area, including areas of interest, into tiles. The tiles are associated with servers, wherein each of the tiles is associated with at least one server based on a consistent hashing function. For each of the tiles, a first dataset is generated which includes the areas of interest intersecting the tile. The areas of interest of the first dataset are trimmed by edges of the tile or completely contained in the tile. For each of the tiles, a second dataset is generated which includes overflowed parts. Each of the overflowed parts is part of an areas of interest of the first dataset, is trimmed by an edge of the tile and is located outside of the tile. For each of the tiles, the first and second datasets are stored at the server(s) associated to the tile.