Abstract: Techniques are disclosed to manage use of a global pool of memory comprising at least a portion of the runtime-managed heap. A request to reserve use of a portion of the global pool of memory is received from each of a plurality of transactions comprising a transactional workload of a database management system. A corresponding portion of the global pool of memory is allocated to each of at least a subset of the requesting transactions, to be used as a local pool of memory available to be used by the transaction to process the transaction.

Abstract: Disclosed herein are systems and method for multiplexing data of an underlying index. In an exemplary aspect, an index handler may: search for a data file in a plurality of data buckets associated with an index, wherein at least one respective data bucket of a plurality of data buckets is attached to a respective slot of a plurality of slots; identify, based on the searching, a first data bucket of the plurality of data buckets that comprises the data file; in response to determining that the first data bucket is not attached to any of the plurality of slots, attach the first data bucket to a first slot of the plurality of slots; and enable access to the data file via the first data bucket attached to the first slot.

Abstract: A system for handling Implicit transactions in a hybrid cloud cache. The hybrid cloud cache maintains folders in a metadata file system that includes a hierarchy of cached folders, and maintains a meta-file containing metadata of files and folders. The system obtains a meta-file from a cloud platform and compares that to a meta-file obtained from the hybrid cloud cache. An object associated with an Implicit metadata transaction is transferred to an internal namespace of the hybrid cloud cache if the comparison indicates that certain conditions are met. The system may perform a bottom-up traversal of the namespace and may abort the traversal if an outstanding explicit transaction for the object is present or the object exists in the cloud platform. An object may be moved to a temporary storage location if there is no explicit transaction on it and the object does not exist in the cloud platform.

Abstract: The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

Abstract: Disclosed are database systems, computing devices, methods, and computer program products for identifying recurring sequences of user interactions with an application. In some implementations, a server of a database system provides a user interface of the application for display at a computing device. The database system stores data objects identifying a first plurality of user interactions with the application. The server receives information representing a second plurality of user interactions with the application. The server updates the database system to further identify the second user interactions. The server identifies a recurring sequence of user interactions from the first and second user interactions as resulting in a first target state of the application. The server updates the database system to associate the recurring sequence of user interactions with the first target state of the application.

Abstract: A computer implemented system and method allow database performance testing and improvement. The method comprises using a database system (DBS) for embedding a virtual resource simulation system (VRSS) into a node of the DBS, loading a new configuration parameter of a database into the VRSS, receiving, by the VRSS from the DBS, an action control block (ACB), and dynamically activating and assigning a service task by a service task dispatcher of the VRSS to process the ACB. The method further comprises simulating a process of database execution based on a content of the ACB by creating a limited database internal data structure that is based on the ACB and the new configuration parameter, and manipulating the limited database internal structure to produce a simulation result. The method further comprises utilizing a metric associated with the simulation result of the new configuration parameter in the simulated process of database execution.

Abstract: In one general embodiment, a computer program product for determining whether to process a uniform resource locator (URL) comprises a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, and where the program instructions are executable by a processor to cause the processor to perform a method comprising selecting, by the processor, a portion of a hash table, identifying, by the processor, a plurality of uniform resource locators (URLs) stored within the selected portion of the hash table, and for each of the plurality of identified URLs, individually determining, by the processor, whether to process the identified URL, based on data associated with the identified URL.

Abstract: A method for receiving an additional dataset including a plurality of additional data records; determining a record type using classifiers and an internal domain knowledge corpus; dividing the plurality of additional data records into a plurality of indexing groups; assigning the given additional data record to a match set based on completeness and similarity of natures of attributes of the given additional data record; and assigning the given additional data record to and a comparison group based on completeness and similarity of natures of attributes of the given additional data record.

Abstract: A storage control system manages a utilization of data blocks of a storage volume which is partitioned into data blocks having a unique block identifier (ID) and a same block size. The storage control system receives data items and assigns a respective unique data ID to each data item, which include consecutive data IDs. The data items are written to a free data block as a whole, and a record for the written data block is inserted into a node of a first tree structure. The record includes the unique block ID of the written data block, a first data ID of the data items, and a bitmap which maps the consecutive data IDs of the data items in the written data block, starting from the first data ID, to a respective bit whose value indicates whether the data item associated with the data ID is valid or invalid.

Abstract: A search device includes: a storage unit configured to store a video obtained from a camera; a screen unit to display the video; and a control unit to control operation of the storage unit and the screen unit, wherein the screen unit may display a time control interface for receiving a time condition, wherein the search device may search for videos and events stored in the storage unit in response to the time condition, and wherein the time control interface may include an AM control interface for receiving a morning time as the time condition and a PM control interface for receiving an afternoon time as the time condition.

Abstract: A system providing for user-initiated, account-type limiting, association-limiting, and duration-dependent public access file disclosures over a semi-private network.

Abstract: A system comprising a database containing user data, an interface engine that communicates with the database and parses the data, an application server that communicates with the interface engine, a user device that receives and displays the parsed data, receives user-provided information, and sends the user-provided information to the application server, wherein the application server automatically updates the user device display with the parsed data, receives user-provided information from said user device, and provides the user-provided information to the interface engine for updating the database.

Abstract: Systems and methods are disclosed for processing electronic content, such as text, videos, and images. According to certain embodiments, user interactions with electronic content may be tracked over a plurality of modalities, such as web pages, email, mobile applications, and social media. The tracked user interactions may include copy/paste events, explicit user highlighting, social sharing, and user voting. Key passages of electronic content may be identified based on the tracked user interactions and ranked against one another. Ranking of passages may be based, for example, on a raw or normalized score for the identified key passages. Alternatively, the ranking of a passage may be based on a ratio of user interactions with the passage to total views of the electronic text containing the passage. One or more of the identified key passages (e.g., the highest ranked passages) may be published to one or more applications.

Abstract: A machine for improving content delivery generates a graph representing a personalized conversational flow for sequenced delivery of digital content. The graph includes nodes representing interactive dialogues between a machine and a user, and edges that connect the nodes. The machine causes display of a user interface including a prompt related to job-seeking guidance. The machine, based on a first action in response to the prompt, dynamically adjusts the graph, the dynamic adjusting including selecting a first node. The machine generates and causes display of a first incentive content item, and a first call-to-action content item. The machine, in response to a second action received in response to the first call-to action content item, dynamically selects an edge connecting the first node and a further node. The dynamic selecting of the edge results in display of a further incentive content item, and a further call-to-action content item.

Abstract: A technique for retaining a context in which data resides independently of a data store from which the data originates is disclosed. In relation to a method aspect of the technique, a computer-implemented method provides data with related first metadata, both originating from a data store and extracts the data and the related first metadata independently from the data store. A universal unique identifier of a portion of the data to which portion specific first metadata exists is created as part of the related first metadata. The universal unique identifier of the portion of the data is integrated into the related first metadata, thereby creating modified first metadata as an independently manageable and linkable representation of the related first metadata.

Abstract: The disclosure provides methods and systems for analyzing genotype data. In some embodiments, a computer-implemented method comprises receiving data relating to one or more phenotypes of a subject or family members thereof, and ranking genes based on their association score with one or more phenotypes. Next, an output of the data is generated, the output comprising a comparison of the data based on the association score. The comparison can be in at least one of numeric and graphic form.

Abstract: Systems and methods for managing change requests are disclosed. A system for managing change requests may include a memory storing instructions and at least one processor configured to execute instructions to perform operations including: receiving, from a client device, a change request; routing the change request to a first similarity determination pipeline, based on the first classification, identifying an implementation device; and transmitting the change request to the implementation device. The first similarity determination pipeline may be configured to: extract at least one first request element from the change request; determine a first group of change requests based on the at least one first extracted request element; determine a first similarity metric between the change request and the first group of change requests; and determine a first classification of the change request based on the first similarity metric.

Abstract: Systems and methods to intelligently optimize data collection requests are disclosed. In one embodiment, systems are configured to identify and select a complete set of suitable parameters to execute the data collection requests. In another embodiment, systems are configured to identify and select a partial set of suitable parameters to execute the data collection requests. The present embodiments can implement machine learning algorithms to identify and select the suitable parameters according to the nature of the data collection requests and the targets. Moreover, the embodiments provide systems and methods to generate feedback data based upon the effectiveness of the data collection parameters. Furthermore, the embodiments provide systems and methods to score the set of suitable parameters based on the feedback data and the overall cost, which are then stored in an internal database.

Abstract: A computer-implemented method that includes generating a graphical user interface including a coding interface and a document viewer interface. The coding interface displays a grid that includes a plurality of cells representing a plurality of documents and a plurality of fields. A selection of one of the cells is received. The cell represents a selected one of the documents, and a selected one of the fields. A rendering of the selected document is automatically displayed in the document viewer interface. A value entered into the selected cell is received and the value is transmitted to a database for storage thereby.

Abstract: Methods for snapshot isolation query transactions in distributed systems are performed by systems and devices. Distributed executions of queries are performed in a processing system according to an isolation level protocol for data management and data versioning across one or more data sets, one or more compute pools, etc., within a logical server via a single transaction manager that oversees the isolation semantics and data versioning. Read transactions of queries are performed lock-free via the isolation semantics, and instant rollbacks, point-in-time queries, single-phase commits in the distributed systems are also provided. Abort and cleanup operations are performed based on a distributed abort protocol and a determined oldest active transaction for the system in which the single transaction manager does not track read-only transactions, and client nodes do not maintain commit tables for transactions.