Abstract: Systems, components, devices, and methods for generating suggestions for content files are provided. A non-limiting example is a method for generating suggestions for arranging content. The method includes the step of receiving a content file from a client, the content file including a content region and a content element. The method also includes the step of analyzing the content file to select a blueprint for the content region. The method further includes the step of generating a suggestion for arranging the content region based on the selected blueprint. Additionally, the method includes the step of transmitting the suggestion to the client.

Abstract: A snapshot analysis system analyzes a plurality of data snapshots taken in connection with data stored on a block device allocated by a data storage system. The snapshot analysis system may include an ingestor capable of initially detecting new snapshots and adding a root node for the snapshots. The system may include a block device analyzer that analyzes each snapshot to determine its contents, the relationship within data structures extant within the snapshot, and the snapshot's relationship to other snapshots and/or that of other block devices. The system may also include a clustering analyzer capable of determining whether snapshots are associated with multipart block devices, such as LVM or MD-RAID devices. The system may further include a block device emulator that exposes data associated with a given snapshot as an addressable block device without necessitating retrieval or exposure of the full block device to which the snapshot is associated.

Abstract: According to one set of embodiments, a computer system can receive a request/command to delete a snapshot from among a plurality of snapshots of a dataset that are stored in cloud/object storage. In response, the computer system can determine a first minimum chunk identifier (ID) and a first maximum chunk ID of a range of data chunks referred to by the first snapshot, and a second minimum chunk ID and a second maximum chunk ID of a range of data chunks referred to by an immediate child snapshot of the first snapshot. The computer system can then, for each data chunk identified by a chunk ID spanning from the second minimum chunk ID to the first maximum chunk ID, check whether the data chunk is referred to by the immediate child snapshot and if not, delete the data chunk from the cloud/object storage.

Abstract: A method includes accessing a first top level entry of a first table of the base volume, the first top level entry having at least a first bottom level entry. The method also includes receiving a first request for a metadata snapshot of the base volume, including the first bottom level entry. The method also includes generating a second top level entry of the first table, the second top level entry configured to point to the at least first bottom level entry of the first table, and the second top level entry configured to operate as a first snapshot of the first table including the at least first bottom level entry.

Abstract: A log file processing system sorts records from large log files and groups them by session without making a complete copy of the log files by capturing a subset of the log files in a sliding memory window and identifying all records in the window that form a complete user session. Records belonging to a complete session are output for analyzing, and the remaining records are output as raw log data for additional processing. Using a ring buffer to implement the sliding memory window, data structures are used to group records by session, to identify completed sessions, and to index into the ring buffer to retrieve records for completed sessions that are to be directly analyzed. Any records remaining in the ring buffer at the end of slide window processing may be output as raw log file data and are processed as incomplete or malformed session records. An embodiment of the log file processing system provides a significant improvement on the speed of data extraction from log files into analyzable session data.

Abstract: A caseless file lookup in a distributed file system is disclosed. A request to store a file in a volume may be received. In response to the request, the type of client system issuing the request may be identified. Based on the type of client system that has been identified, a first hash value or a second hash value may be calculated for the name of the file to generate and assign a hash value to the file. The file may be stored in a storage resource based on the first or second hash value that has been generated for the file.

Abstract: A method and apparatus for a search function are provided in a touch-sensitive device that supports a search for contents in a list view by using a dedicated keypad displayed in the list view. In the method, the apparatus displays the dedicated keyboard for a content search in the list view, and performs the content search in the list view in response to an interaction inputted on the dedicated keyboard. The apparatus then displays at least one execution item associated with at least one found content, and executes the content associated with a selected one among the at least one execution item.

Abstract: An approach to de-duplicating data in an electronic text repository by performing the following steps: (i) processing one or more text documents associated with an electronic text repository to identify first instances of a plurality of words; (ii) adding words associated with the identified first instances of the plurality of words to a list, wherein each word added to the list is assigned a unique serial number; and (iii) replacing the plurality of words included in the one or more text documents with serial numbers corresponding to the words associated with the list for generating one or more reduced documents.

Abstract: Systems and methods are described to provide consistent cross-reference between electronic documents from distributed storage servers. A first document server may receive a query relating to a first document referencing a second document. The first document is stored on the first document server, and the second document is stored on a second document server. The first document server may obtain data relating to a copy of the second document associated with a revision number. The first document server may then send, to the second document server, an update request including the revision number, and then receive from the second document server, data relating to operations that have been committed to the second document after a time associated with the revision number.

Abstract: Provided is a data management system including a master group including a data manager configured to manage data, a process manager configured to manage a process of analyzing the data, and a meta data storage unit configured to store meta data information for managing the data; and at least one work group including a work manager configured to manage resources, the data, and a data process on the basis of a scope of groups, and at least one node manager configured to manage the resources, the data, and the data process on the basis of a scope of nodes. The master group and the at least one work group are dispersed from each other.

Abstract: Embodiments are directed to a file system engine that provides a file system that includes a plurality of blocks on a file storage tier with portion of the blocks associated with a cache storage tier. A cache engine provides heat extents that include a heat score and a run length value such that the heat extents are represent activities associated with the blocks. Heat extents associated with file system activities are determined based on a position of the blocks that corresponds with the run length values of the heat extents and sectors on the file storage tier. Heat scores associated with the heat extents may be modified based on the activities and distribution models to conform the heat extents with the distribution models. Blocks associated with heat scores that are less than a threshold value provided by the distribution models may be disassociated from the cache storage tier.

Abstract: A virtual machine container file is analyzed to determine which portion of the virtual machine container file corresponds to a virtual machine file system metadata of the virtual machine container file. One or more differences between a first version of a virtual machine container file and a second version of the virtual machine container file are determined at least in part by traversing a snapshot structure associated with the virtual machine container file. The determined one or more differences that corresponds to the virtual machine file system metadata portion of the virtual machine container file are identified based at least in part on the analysis of the virtual machine container file.

Abstract: Retrieving backup parameters for recovery is described. A clone copy is created of a backup file stored on a disk. The clone copy is stored on an external destination node including an external disk and/or a tape. Backup parameters are stored to a backup catalog. The backup parameters identify a location of the clone copy. A request is received to recover the clone copy. The backup parameters are retrieved from the backup catalog. The clone copy is recovered from the external destination node based on the backup parameters. The clone copy is restored to a database associated with the backup file.

Abstract: A system includes reception of a first data record, identification of one or more component elements in the first data record, application of a cleansing operation to change a first component element of the one or more component elements to a first cleansed component element, the first cleansed component element being different from the first component element, automatic determination a change significance of the change, and storage an identifier of the first cleansed component element in association with an identifier of the change significance.

Abstract: A computer-implemented method, computer program product and system for data sampling in a storage system. The storage system includes a dataset comprising records and a buffer. The dataset is scanned record-by-record to determine whether the current record belongs to a random sample. If so, then the current record may be added to a first set of records. Otherwise, at least one storage score may be calculated or determined for the current record using attribute values of the current record. Next, it may be determined whether the buffer includes available size for storing the current record. In case the buffer comprises the available size, the current record may be stored in the buffer. Otherwise, at least part of the buffer may be free up. A subsample of the dataset may be provided as a result of merging the first set of records and at least part of the buffered records.

Abstract: A computer-implemented method, computer program product and system for data sampling in a storage system. The storage system includes a dataset comprising records and a buffer. The dataset is scanned record-by-record to determine whether the current record belongs to a random sample. If so, then the current record may be added to a first set of records. Otherwise, at least one storage score may be calculated or determined for the current record using attribute values of the current record. Next, it may be determined whether the buffer includes available size for storing the current record. In case the buffer comprises the available size, the current record may be stored in the buffer. Otherwise, at least part of the buffer may be free up. A subsample of the dataset may be provided as a result of merging the first set of records and at least part of the buffered records.

Abstract: A multi-level storage architecture and method of performing a partial merge are disclosed. A main store is partitioned into a passive main part and an active main part, the active main part being empty at a start of the partial merge, the passive main part storing encoded data records of the main store that are not subject to the partial merge. A values index corresponding to a sorted dictionary of the passive main part is set to a cardinality of n. The data records of a second level storage structure is merged into the active main part, the active main part having a dictionary that starts with a value of n+1, such that the merging into the active main part continues an encoding scheme according to the values index of the passive main part.

Abstract: A technique includes applying a first mapping to associate a plurality of data records for a plurality of database nodes with a plurality of segments of a storage that is shared by the database nodes; and applying a many-to-many second mapping to associate the segments with the database nodes.

Abstract: A data management apparatus manages a database that has a plurality of items each of which has item attribute data. The data management apparatus includes determining, when an update request to the database is accepted, whether an item that is designated in the update request is included in the items, adding, when the designated item is not included in the items, the designated item to the items, and setting a definition setting flag included in item attribute data of the designated item to a second state that is different from a first state to which a definition setting flag included in item attribute data of an item approved as an item of the database is set.

Abstract: A method, computer program product and/or computer system assigns access to a quorum disk in a split-storage cluster environment when a communication link between storage systems fails. Access to the quorum disk is based on storage system I/O performance. Priority is given to the storage system that has a higher performance before the link failure. When the communication link fails, both storage systems attempt to access the quorum disk. If the system that first attempts to access the quorum disk is the non-priority storage system, a timer is started. If the priority system attempts to access the quorum disk within a predetermined time interval, the priority system locks the quorum disk and forms the cluster. If the priority system does not attempt to access the quorum disk within the predetermined time interval, the non-priority system locks the quorum disk and forms the cluster.

Abstract: A log-structured data store may implement optimized log storage for asynchronous log updates. In some embodiments, log records may be received indicating updates to data stored for a storage client and indicating positions in a log record sequence. The log records themselves may not be guaranteed to be received according to the log record sequence. Received log records may be stored in a hot log portion of a block-based storage device according to an order in which they are received. Log records in the hot log portion may then be identified to be moved to a cold log portion of the block-based storage device in order to complete a next portion of the log record sequence. Log records may be modified, such as compressed, or coalesced, before being stored together in a data block of the cold log portion according to the log record sequence.

Abstract: The present disclosure relates to maintaining consistency in a content management system. A content management system generally includes a transactional database for storing content metadata and a non-transactional data repository for storing content. According to one embodiment, a content management system generates a set of content identifiers. The content management system receives a request to upload content to the content management system. Upon receiving the request, the content management system associates the content with a content identifier from the set of content identifiers and generates a name for the content from the content identifier. The content management system stores the content, with the generated name, in a non-transactional data repository and persists metadata related to the content in a transactional data store.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) on distributed file systems. In example embodiments, a subquery of a distributed file system is received from a query engine, where the subquery is one of multiple subqueries that are scheduled to execute on a cluster of server nodes. At this stage, a user defined function that comprises local, role-based functionality is executed, where the partitioned magic table triggers parallel execution of the user defined function. The execution of the UDF determines a sequence number based on a quantity of the cluster of server nodes and retrieve nonconsecutive chunks from a file of the distributed file system, where each of the nonconsecutive chunks is offset by the sequence number.

Abstract: The present invention provides a database access method, where the method includes the following steps: receiving an access request input by a client, where the access request includes at least one command statement; performing rule matching between the command statement included in the access request and a rule in a preset rule set, and performing transformation processing on a statement that is included in the access request and that matches the rule, so as to generate a sinking statement that satisfies an execution requirement of a data source, where the sinking statement is a statement that is delivered to a database and executed by the data source; and transmitting the sinking statement to the database to which the sinking statement points. The present invention further provides a database access apparatus and a database system to which the foregoing method is applied.

Abstract: The invention is directed towards a database access coordination arrangement (23) in a federated database system (10) comprising applications (Ai, A2, A3) that access databases (34-50) under the control of a number of query handlers (24-32), the database access coordinating arrangement providing a group of traffic distribution units (16-22), each having connections to corresponding query handlers, and a traffic control unit (TCU), which traffic control unit selects traffic distribution unit for a query (Qi) from an application (Ai) based on at least one connectivity map of the connections existing between traffic distribution units, query handlers and databases and connectivity states of connections between traffic distribution units and query handlers, and schedules the query to the selected traffic distribution unit for accessing a database.

Abstract: Beneficial query parameterization of one or more databases may be automatically determined. Data associated with a workload of the one or more databases may be automatically gathered and accessed. The gathered data may then be automatically analyzed to determine whether query parameterization would be beneficial to the one or more databases. Based on the analysis one or more query parameterization recommendations may be generated for presentation to a user of the one or more databases. A user response associated with implementing at least one of the one or more query parameterization recommendations may then be received. Upon implementing at least one of the one or more recommendations, the at least one implemented recommendation may be automatically verified whether an expected improvement of the one or more databases has been realized. When the expected improvement has not been realized, the one or more databases may be reverted to a previous state.

Abstract: Mechanisms for improving resource usage of a computing system by properly balancing the timing of performance degradation analysis of an executable action set of a query based on an impact on the workload of that query. The mechanism collects workload metrics for each of multiple queries and their associated executable action sets. Performance degradation occurs when the current executed action set is no longer appropriate for the corresponding query such that more resources are used than are necessary. For each query, the system determines whether to perform degradation analysis of the current executable action set in a manner that is workload aware. That is, queries that occupy more computing resources or that impact the overall workload more will tend to have degradation analysis performed more frequently than those queries that have less impact on the overall workload. This results in improved resource usage for the workload with low overhead.

Abstract: A system for cardinality estimation for database query planning is provided. In some implementations, the system performs operations comprising selecting a subset of data from a set of data on which a database query is to be executed, the set of data including a first quantity of tuples and the subset of data including a second quantity of tuples. The operations can further comprise determining, based on evaluating one or more predicates on the subset, a third quantity of tuples in the subset which satisfy the one or more predicates. The operations can further comprise determining, based on the first quantity, the second quantity, and the third quantity, a range within the subset that comprises estimated cardinalities of the one or more predicates within a predetermined error threshold range. Related systems, methods, and articles of manufacture are also described.

Abstract: Techniques are described for scaling an in-memory data grid to satisfy the needs of client applications requesting data from the in-memory data grid. The in-memory data grid may monitor a variety of factors, such as data traffic or number of received queries from a particular geographical region, to determine whether to create a proximity grid. A proximity grid is an extension of the in-memory data grid that services queries originating from a defined geographic region. Each proximity grid stores data objects relevant to the proximity grid's assigned geographic region. Queries originating from the client applications within the geographic regions are then routed to the corresponding proximity grid for execution. The proximity grid may be terminated when the need of the client applications within the geographic region has subsided.

Abstract: A system and method for detecting songs in a continuous audio stream are disclosed. A detection server segments the continuous audio stream, and analyzes the audio stream to determine song candidates according to various processes disclosed herein. In one embodiment, the candidates are determined to be accurate when temporally ordered fingerprints exceed a predetermined threshold, adjacent audio stream segments are determined to have the same best song candidate, and the determined song detection has not been previously detected in the data stream within a predetermined period of time.

Abstract: Search results are improved, in one embodiment, through the use of subscription information about the status of a subscription to content. The subscription information can be transmitted to a cloud storage service used by a user account of a device; later, a search query from the device causes the receipt of search results from a search using the subscription information and these search results can show the status of the subscription such as whether the content is playable.

Abstract: The current disclosure generally relates to database management systems (DBMSs) and may be generally directed to methods and systems of using artificial intelligence (i.e. machine learning and/or anticipation functionalities, etc.) to learn a user's use of a DBMS, store this “knowledge” in a knowledgebase, and anticipate the user's future operating intentions. The current disclosure may also be generally directed to associative methods and systems of constructing DBMS commands. The current disclosure may also be generally directed to methods and systems of using a simplified DBMS command language (SDCL) for associative DBMS command construction. The current disclosure may also be generally directed to artificially intelligent methods and systems for associative DBMS command construction. The current disclosure may also be generally directed to methods and systems for associative DBMS command construction through voice input.

Abstract: Non-limiting examples of the present disclosure describe a unified ranking model that may be used by a plurality of entry points to return ranked results in response to received query data. The unified ranking model is provided as a service for a plurality of entry points. A query is received from an entry point of the plurality of entry points. Results data for the query data is retrieved. A unified ranking model is executed to rank the results data. Execution of the unified ranking model manipulates feature data of the unified ranking model based on user context signals associated with the received query data and acquired result retrieval signals corresponding with the retrieved results data. Execution of the unified ranking model generates ranked result data. Ranked results data is returned to the processing device corresponding with the entry point. Other examples are also described.

Abstract: A system for generating web pages for improving organic search rankings, associated with a website, the system comprising: a keyword generating module adapted to: retrieve one or more candidate keyword sets associated with website content, analyze the candidate keyword sets, and generate one or more target keyword sets based on the analysis of the candidate keyword sets; a web page generating module adapted to: retrieve website content data associated with the website content, and generate web pages based on the generated target keyword sets and the retrieved website content data; wherein the web page generating module is further adapted to communicate with a publicly visible web page server to enable the publicly visible web page server to store and serve the generated web pages; and a link logic module adapted to: define one or more of i) a number of links and ii) a type of link relationship between the target keyword sets, keywords in the target keyword sets, the web pages generated and pages on the websit

Abstract: A system and method may allow for improved accuracy for name matching. The system may receive a name input and preprocess the name input. The name input may be tokenized to create a name token. The name token may be compared to a stored name. The system may calculate a first name matching score based on the comparison. The system may permute the name token to form a second level permutation name, compare the second level permutation name with the stored name, and calculate a second name matching score based on the comparison. The first name matching score may be compared with the second name matching score to improve accuracy in name matching.

Abstract: A system and method for performing a universal search for resources across platforms in an enterprise system are described. A search server may receive one or more characters of a search query input at a user device of a user that is a member of an organization and identify one or more resources having metadata or content that includes the one or more characters. For each identified resource, the server may determine a category to which the identified resource belongs, receive source access data indicating resource access patterns of users in the organization, and rank the one or more resources based on the resource access data. The server may provide, to the user device, search result data for display that indicates the ranked one or more resources.

Abstract: A computer-based method of formulating and delivering dynamic, severity-based weather peril scoring includes ingesting human-observed weather data and radar weather data, applying a grid that has a plurality of cells to a map of a geographical region to divide the geographical region into a plurality of areas, with each area being defined by a corresponding one of the grid cells, for each area/grid cell: calculating, with a computer-based processor, a first severity-weighted risk index for at least one weather peril based on the human-observed weather data, calculating, with the computer-based processor, a second severity-weighted risk index for the at least one weather peril based on the radar weather data, and blending, with the computer-based processor, the first severity-weighted risk index and the second severity-weighted risk index to produce a blended risk index.

Abstract: In an approach for managing computing interruptions, a processor receives a computing interruption on a computing device. A processor monitors computing activity of a user on the computing device. A processor accesses user preferences, wherein the user preferences are based on an analysis of previous responses by the user to previous computing interruptions. A processor determines a minimum threshold, based on the computing activity of the user and the user preferences, wherein the minimum threshold identifies when a computing interruption is allowed to be presented to the user. A processor determines from the computing interruption, a sender and a context of the computing interruption. A processor assigns a ranking to the computing interruption based on the sender and the context of the computing interruption. A processor compares the ranking to the minimum threshold. A processor determines whether to present the computing interruption, based on the comparison.

Abstract: In an approach for managing computing interruptions, a processor receives a computing interruption on a computing device. A processor monitors computing activity of a user on the computing device. A processor accesses user preferences, wherein the user preferences are based on an analysis of previous responses by the user to previous computing interruptions. A processor determines a minimum threshold, based on the computing activity of the user and the user preferences, wherein the minimum threshold identifies when a computing interruption is allowed to be presented to the user. A processor determines from the computing interruption, a sender and a context of the computing interruption. A processor assigns a ranking to the computing interruption based on the sender and the context of the computing interruption. A processor compares the ranking to the minimum threshold. A processor determines whether to present the computing interruption, based on the comparison.

Abstract: A method and apparatus for delivering engineering data to a portable device for use in performing an operation. Engineering data for each part in a set of parts is stored in a file system on the portable device. A set of entries, each entry including a part identifier and a target locator for a part, is created for the set of parts to form a table. An initial locator constructed by a visualization tool is matched to a target locator in the table for a selected part. The target locator identifies a physical location in the file system of requested engineering data for the selected part. A local server on the portable device retrieves the requested engineering data based on the target locator. The local server serves the requested engineering data to a browser, which displays the requested engineering data for use in performing the operation on the selected part.

Abstract: Methods, systems, and computer program products for determining a recommended set of actions from operational data are provided herein. A computer-implemented method includes associating multiple action templates with a set of operational data corresponding to a query; selecting a first action template from the multiple action templates; identifying one or more attributes associated with the first action template; forming a first step of a resolution action in response to the query by populating the first action template with at least one of the attributes; repeating, based on the first step of the resolution action and the set of operational data, said selecting, said identifying, and said forming for at least a second action template to form a second step of the resolution action; and outputting the resolution action, wherein the resolution action comprises a fixed sequence of at least the first step and the second step.

Abstract: Various embodiments provide a so-called companion experience in which content consumed on a primary screen can serve as a source for an automatic search that returns related content that can be presented on an auxiliary screen. The companion experience can be considered to reside in a layer that can be moved across different screens. The different screens can include different physical screens, such as those associated with different computing devices, or the same physical screen in which the companion experience would be rendered in a frame or sub-window.

Abstract: Systems, methods, and computer program products to perform an operation comprising receiving, by a database management system (DBMS) from an application, a request specifying to generate a global temporary table (GTT) of a first format, identifying a first GTT, of a plurality of GTTs stored by the DBMS, that has a second format, different than the first format, modifying the first GTT such that at least a portion of the modified first GTT is of the first format, and providing the modified first GTT to the application.

Abstract: A data intake and query systems processes events received via the hypertext transfer protocol (HTTP). The HTTP events are associated with tokens. The received events are received by event collectors and distributed for storage. The data intake and query system receives requests to provide analyses and visualizations regarding the stored HTTP events. These requests can be customized based on selected tokens and selected data storage components. The visualizations are generated in response to the requests, and transmitted to the requesting device.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method identifies an original catalog object associated with a set of data and creates a duplicate copy of the original catalog object without copying the data itself. The method allows access to the set of data using the duplicate catalog object and supports modifying the data associated with the original catalog object independently of the duplicate catalog object. The duplicate catalog object can be deleted upon completion of modifying the data associated with the original catalog object.

Abstract: Example resource provisioning systems and methods are described. In one implementation, an execution platform accesses multiple remote storage devices. The execution platform includes multiple virtual warehouses, each of which includes a cache to store data retrieved from the remote storage devices and a processor that is independent of the remote storage devices. A resource manager is coupled to the execution platform and monitors received data processing requests and resource utilization. The resource manager also determines whether additional virtual warehouses are needed based on the data processing requests and the resource utilization. If additional virtual warehouses are needed, the resource manager provisions a new virtual warehouse.

Abstract: Examples describe mechanisms for maintaining consistent subscriber data on geo-redundant subscriber databases. In an example, a request to perform an operation related to subscriber data may be received on a subscriber database, wherein the subscriber database may be a geo-redundant deployment of a separate subscriber database. The connectivity status of a synchronization link between the subscriber database and the separate subscriber database may be determined. In response to the determination that the connectivity status of the synchronization link between the subscriber database and the separate subscriber database is disconnected, the request to perform the operation related to the subscriber data on the subscriber database may be denied.

Abstract: A first cloud is provided with a first abstraction layer between a first instance of an application and a first set of different storage types. A second cloud, remote from the first cloud, is provided with a second abstraction layer between a second instance of the application and a second set of different storage types. A replication protection appliance (RPA) is connected between the first and second abstraction layers. The first abstraction layer intercepts a write command from the first instance of the application to storage of a particular type among the first set of different storage types. The first abstraction layer sends a copy of the write command to the RPA. The RPA replicates the write command to the second abstraction layer for the second abstraction layer to send to corresponding storage of the particular type among the second set of different storage types.

Abstract: A first store and a second store can be configured to store a first partition of a table of a database and a second partition of the table of the database, respectively. A database management system can be configured to at least update at least a first portion of the first partition where the update includes an update to a first primary key column in the first partition and verify that the first primary key column is unique across the first partition and the second partition. A first row having a first primary key value of the first primary key column from the first partition can be deleted, when the first primary key value in the first partition conflicts with a second primary key value of a second primary key column in the second partition.