Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. Each computing device is operable to access one or more memory blocks within the storage devices and maintain a registry over the same one or more memory blocks. The registry may be adaptively resized according to the access of the one or more memory blocks.

Abstract: Systems and methods that make use of cluster-level redundancy within a distributed storage management system to address various node-level error scenarios are provided. Rather than using a generalized one-size-fits-all approach to reduce complexity, an approach tailored to the node-level error scenario at issue may be performed to avoid doing more than necessary. According to one embodiment, responsive to identifying a missing branch of a tree implemented by a KV store of a first node of a cluster of a distributed storage management system, a branch resynchronization process may be performed, including, for each block ID in the range of block IDs of the missing branch (i) reading a data block corresponding to the block ID from a second node of the cluster that maintains redundant information relating to the block ID; and (ii) restoring the block ID within the KV store by writing the data block to the first node.

Abstract: A method includes selecting, from content packs in a centralized content management system, a content pack to update in a data intake and query system. The content pack includes utility objects. For each utility object of at least a subset of the utility objects determining whether the utility object already exists in the data intake and query system, and loading the utility object to the data intake and query system when the utility object does not exist to obtain an updated utility object. The method further includes monitoring, by the data intake and query system, an endpoint of an endpoint type using the updated utility object.

Abstract: Disclosed are embodiments for generating metadata files for composite datasets. In one embodiment, a method is disclosed comprising generating a tree representing a plurality of datasets; parsing the tree into an algebraic representation of the tree; identifying a plurality of terms in the algebraic representation, each term in the terms comprising at least two factors, each of the two factors associated with a dataset in the plurality of datasets; generating a metadata object of the plurality of terms; serializing the metadata object to generate serialized terms; and storing the serialized terms in a metadata file associated with the plurality of datasets.

Abstract: Techniques for implementing nested group hierarchies for analytics applications are disclosed. In some embodiments, a computer-implemented method comprises: creating a hierarchy object in a semantic layer based on a request comprising a definition for a nested group hierarchy, the definition specifying a hierarchical relationship structure for non-leaf group nodes and at least one leaf node, the non-leaf group nodes and the leaf node(s) corresponding to data stored in a data source in a non-hierarchical structure, the hierarchy object specifying the hierarchical relationship structure based on the definition; generating a query result based on a request comprising an indication of the hierarchy object using the hierarchy object from the semantic layer to retrieve the data from the data source; and causing the query result to be displayed on a computing device using the hierarchy object to display the retrieved data in a hierarchical format indicating the hierarchical relationship structure.

Abstract: A contextual navigation and action user experience framework that facilitates workflows across multiple contexts and levels of object hierarchy is disclosed. Exemplary features include a swapper interface, an action toolbar with contextual buttons and contextual tabs, and a toolkit that provides an overview portal to view alerts, cross reference information, and perform actions on objects and insights that are important to the user across an entire product suite.

Abstract: According to one embodiment, a storage system includes a processor, a storage device, and a first memory. The storage device includes a nonvolatile memory, a control circuit, and a second memory. The processor retrieves, based on a retrieval key and retrieval information stored in the first memory, location information of data including the retrieval key and a value, and transmits the location information and the retrieval key to the control circuit. The control circuit reads the data from the nonvolatile memory based on the location information and the retrieval key, stores the data in the second memory, retrieves the value corresponding to the retrieval key from the data, and transmits the value to the processor.

Abstract: A contextual navigation and action user experience framework that facilitates workflows across multiple contexts and levels of object hierarchy is disclosed. Exemplary features include a swapper interface, an action toolbar with contextual buttons and contextual tabs, and a toolkit that provides an overview portal to view alerts, cross reference information, and perform actions on objects and insights that are important to the user across an entire product suite.

Abstract: Provided are methods, systems, devices, and tangible non-transitory computer readable media for providing data including vehicle map service data. The disclosed technology can perform operations including receiving vehicle map service data from a plurality of service systems that include a plurality of client systems associated with a vehicle. The vehicle map service data can include information associated with a geographic area. A local map of the geographic area within a predetermined distance of the vehicle can be generated based on the vehicle map service data. Portions of the local map to which each client system is subscribed can be determined for each client system of the plurality of client systems. Additionally, the portions of the local map to which each client system is subscribed can be sent to a respective client system of the plurality of client systems.

Abstract: Systems and methods are described for providing rapid access to data sets used by serverless function executions. Rather than pre-loading an entire data set into an environment of a serverless function, which might incur large latencies, the environment is provided with a local access view of the data set, such as in the form of a read-only mount point. As blocks within the data set are requested, a local process can translate the requests into requests for corresponding network objects. The network objects are then retrieved, and the relevant portion of the object is made available to the environment. Network objects may be shared among multiple data sets, so a host device may include a cache enabling an object retrieved for a first environment to also be used to service requests from a second environment.

Abstract: A storage engine may implement dynamic splitting of contentious data pages. Data pages may store data for a table of a data store as part of an indexing structure for the table. Access to the table may be provided by locating the corresponding data pages via the indexing structure. Access contention for different data pages may be monitored. Data pages may be identified for splitting based on the monitoring. A split operation for an identified data page may be formed to store the data on the identified data page on two different data pages so that subsequent access requests for the data are divided between the two data pages. Monitoring of access contention may also be performed to identify data pages for merging in order to consolidate access requests to a single data page.

Abstract: A database management system (DBMS) run a host CPU and a hardware coprocessor accelerate traversal of a tree-type data structure by allocating reusable memory in cache to store portions of the tree-type data structure as the tree-type data structure is being requested by the host CPU. The hardware coprocessor manages the cached tree-type data structure in a manner that is transparent to the host CPU. A driver located at the host CPU or at a separate computing device can provide an interface between the host CPU and the hardware coprocessor, thus reducing communications between the host CPU and the hardware coprocessor.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for locking a file in a memory. The method comprises enabling a thread to obtain a mixed lock of a file. The method further comprises, in response to enabling the thread to obtain the mixed lock, enabling a further thread to obtain a shared lock of the file, and prevent the further thread from obtaining the exclusive lock or mixed lock of the file. By adding a new mixed lock to a traditional read and write lock, embodiments of the present disclosure improve concurrent access performance of the file system.

Abstract: The systems, methods and apparatuses described herein provide a computing environment that manages private key storage. An apparatus according to the present disclosure may comprise a first non-volatile storage for storing a private root key for signing digital certificates, an input device for receiving manual input from an operator, a communication interface consisting of a one-way transmitter for transmitting information from the apparatus, and a processor. The processor may be configured to retrieve the private root key from the first non-volatile storage, receive information for a new digital certificate through the input device, generate the new digital certificate according to the received information, sign the new digital certificate using the private root key and transmit the new digital certificate from the apparatus using the transmitter.

Abstract: A computer located outside of an organizational computing environment is remotely prepared and configured to work in the organizational computing environment. A hypervisor operating system is installed and replaces the primary operating system of the computer, and the primary operating system, virtual software appliances (VSA) and virtual machines (VM) can execute as processes of the hypervisor. The hypervisor is configured to establish secure connection with organizational computing environment and to receive from it organization-configured image software for configuring the compute to work in the organizational computing environment. The secure connection can also be used for remote maintenance of the computer even when the computer operating system is faulty or inactive.

Abstract: Example embodiments of a user interface system employing nested data are described. In an example embodiment, first data items of a first data source available for selection is presented via a user interface, the first data items including an association with a second data source. A first user selection of the association with the second data source is received via the user interface. In response to the first user selection, second data items of the second data source available for selection are presented via the user interface. A second user selection of a data item of the second data items is received via the user interface. In response to the second user selection, an indication of the selected data item of the second data items is presented.

Abstract: Computer implemented methods for concurrent processing of operations on a tree-based data structure include: receiving input at a storage system managing a storage device in which the tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; determining one or more groups of the set of heterogeneous operations according to the one or more nodes to which the set of heterogeneous operations are to be applied; and applying, for each of the one or more groups, the set of heterogeneous operations according to a predefined order. Systems and methods for accomplishing the same are also disclosed.

Abstract: The invention discloses a device for a browser to process a page element comprising: at least one DOM object processor disposed at the browser side, each DOM object processor being configured to store a customized processing of a specific DOM object; a page parser configured to load an obtained page at the browser side, parse page elements of the obtained page, and convert each page element into a DOM object; a DOM processor coupled to the page parser and the at least one DOM object processor, and configured to invoke the at least one DOM object processor to perform a customized processing on at least one of converted DOM objects. By employing the invention, a personalized customization can be performed to a page according to the user needs. The invention further discloses a corresponding method.

Abstract: An apparatus includes a processor and a storage storing instructions causing the processor to: receive a request for data concerning a target node and neighboring nodes; multiply an identifier of the target node with an index multiplier to determine a location of an index entry of the target node within an index data; access the index entry to retrieve an identifier of a window and an indication of a location within the window at which a node entry of the target node may be accessed, and to retrieve an indication of data size of the node entry; access the node entry within the identified window to retrieve an amount of the node entry up to the data size to retrieve at least one identifier of at least one neighboring node within a single degree of separation of the target node; and output the at least one identifier.

Abstract: A system and method synthesizing images of a locale to generate a composite image that provide a panoramic view of the locale. A video camera moves along a street recording images of objects along the street. A GPS receiver and inertial navigation system provide the position of the camera as the images are being recorded. The images are indexed with the position data provided by the GPS receiver and inertial navigation system. The composite image is created on a column-by-column basis by determining which of the acquired images contains the desired pixel column, extracting the pixels associated with the column, and stacking the columns side by side. The composite images are stored in an image database and associated with a street name and number range of the street being depicted in the image. The image database covers a substantial amount of a geographic area allowing a user to visually navigate the area from a user terminal.

Abstract: A computer located outside of an organizational computing environment is remotely prepared and configured to work in the organizational computing environment. A hypervisor operating system is installed and replaces the primary operating system of the computer, and the primary operating system, virtual software appliances (VSA) and virtual machines (VM) can execute as processes of the hypervisor. The hypervisor is configured to establish secure connection with organizational computing environment and to receive from it organization-configured image software for configuring the compute to work in the organizational computing environment. The secure connection can also be used for remote maintenance of the computer even when the computer operating system is faulty or inactive.

Abstract: A method and system for indexing, searching, and retrieving information from timed media files based upon relevance intervals. The method and system for indexing, searching, and retrieving this information is based upon relevance intervals so that a portion of a timed media file is returned, which is selected specifically to be relevant to the given information representations, thereby eliminating the need for a manual determination of the relevance and avoiding missing relevant portions. The timed media includes streaming audio, streaming video, timed HTML, animations such as vector-based graphics, slide shows, other timed media, and combinations thereof.

Abstract: The present disclosure provides a method and an apparatus for storing data classification structure. Based on an initial classification structure tree, a reorganized classification structure tree that stores data classifications structure differently from that of the initial classification structure is generated. As the reorganized classification structure tree is flexible, when maintaining data and searching data by using the search engine, the present techniques may quickly find the desired data, thereby reducing the heavy burden of the search engine under the conventional techniques to conduct data search and high pressure of conducting data maintenance and data search. Further, the present techniques may not only reduce the burden of the search engine, but also relieve the pressure for maintaining data and searching data.

Abstract: A system includes generation of an encoding for each of a hierarchy of nodes, each of the nodes associated with one or more attributes, and the encoding for each node including a first pointer and a second pointer, and generation of an order tree comprising a hierarchy of entries, where each pointer of the encoding points to a respective one of the entries, wherein the encoding and the order tree indicate a position of each node in the hierarchy of nodes.

Abstract: Nodes in a tree data structure are associated with respective node keys. At least some of the nodes are associated with at least one respective node rank. The structure is searched to attempt to identify a preferred prefix-matching node on the basis of attempting to find a prefix-matching node that has a prefix match with a search key and which has a preferred node rank relative to a node rank associated with a node which may have a longer prefix match. If the prefix-matching node is identified, a dependent node rank identifier associated with the prefix-matching node is used to determine that the prefix-matching node has the preferred node rank. The dependent node rank identifier indicates at least a node rank of a node which may have a longer prefix match than the prefix-matching node. The prefix-matching node is selected, if identified, as a preferred prefix-matching node.

Abstract: Systems and methods for balancing electronic mailboxes among databases communicatively coupled to an information handling system are disclosed. A method may include comparing an actual utilization values for a first database to a threshold utilization value for the first database and, depending upon the results, identifying the first database as over-utilized. The method may also include comparing an actual utilization values for a second database to a threshold utilization value for the second database and, depending upon the results, identifying the second database as under-utilized. The method may further include comparing a threshold usage value of a first electronic mailbox stored in the first database to an upper threshold usage value for the first electronic mailbox and, depending upon the results, identifying the first electronic mailbox as heavily-utilized. The method may also include moving the heavily-utilized electronic mailbox to the second database.

Abstract: A system that provides secure autocomplete searching receives an autocomplete query from a user, the autocomplete query including a prefix of a search phrase, and retrieves security information of the user. The system searches one or more prefix indexes to find a set of matching objects, where the matching objects each include associated object security information. The system excludes matching objects that the user is not authorized to access from the set of matching objects based on the object security information and the user security information. The system then returns the set of matching objects to the user.

Abstract: An approach is provided in which a sample point system allocates sample point identifiers to a root node included an index tree that includes multiple leaf nodes. The sample point system distributes the sample point identifiers to the root node's child nodes, and recursively traverses through the index tree's hierarchical index levels and distributes the sample point identifiers from the child nodes to a subset of the index tree's leaf nodes. In turn, the sample point system collects sample data from the subset of the plurality of leaf nodes corresponding to the distributed sample point identifiers.

Abstract: Visual data mining techniques for increasing data classification accuracy are disclosed. For example, a method comprises the following steps. At least two decision tree data structures from a high-dimensional data set are generated. A composite data structure comprising the at least two decision tree data structures is generated. The composite data structure is generated based on a correlation computed between the at least two decision tree data structures. The composite data structure is visualized on a display. Modification of the composite data structure is enabled via interaction with the visualization of the composite data structure on the display.

Abstract: Techniques for facilitating a similarity search of digital assets (e.g., audio files, image files, video files, etc.) are described. Consistent with some embodiments, a cloud-based search service manages one or more search tree data structures for use in organizing digital assets to make the digital assets searchable. Each digital asset is associated with a feature vector based on the various attributes and/or characteristics of the digital asset. The digital assets are then assigned to leaf nodes in one or more search tree data structures based on a measure of the distance between the feature vector of the digital asset and a virtual feature vector associated with a leaf node. When a search for similar digital assets is invoked, a prioritized breadth first search of a search tree is performed to identify the digital assets having the feature vectors closest in distance to the reference digital asset.

Abstract: Systems, methods, and computer-readable and executable instructions are provided for selecting data paths. Selecting data paths can include creating a support data tree structure from a number of data trees within a data set. In addition, selecting data paths can include removing a number of paths from the support data tree based on a number of evaluations of each of a number of nodes within the support data tree. Furthermore, selecting data paths can include selecting a desired set of paths based on a desired number of removed paths and an associated number of evaluations of the support data tree.

Abstract: Community ratings are determined for users of an electronic marketplace. In a typical configuration, the community rating of an individual reflect the individual's reputation in the electronic community (e.g. feedback rating) as well as the reputations of the users the individual sponsors and the reputations of each user they sponsor, and so on. Various methodologies are provided for determining a community rating, such as aggregating feedback ratings, or weighting or thresholding these feedback ratings.

Abstract: An embodiment for evaluating rules pertaining to an event includes providing a rule trie comprising multiple nodes, wherein match conditions must be met to trigger a given rule, and each match condition corresponds to a different node. An attribute trie is provided for a string attribute, which includes a node sequence having a value. The string attribute is extracted from the event and also has a value. The value of the extracted string attribute and the value of the node sequence are compared, by traversing a path extending along the node sequence. Responsive to determining that the values of the extracted string attribute and the node sequence are the same, notice is provided that the match condition of a particular node of the rule trie has been met by an attribute of the received event.

Abstract: Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation.

Abstract: A storage system includes: a data storing means configured to store storage target data and also store address data so as to be tree-structured, the address data being based on a content and storing position of data to be referred to, and the address data referring to the storage target data or other address data; an operation log generating means configured to generate an operation log that represents a content of an operation of storing the storage target data into the data storing means and a content of an operation of storing the tree-structured address data referring to the storage target data into the data storing means; and a file system committing means configured to store the storage target data and the tree-structured address data into the data storing means based on the operation log.

Abstract: A method of implementing a tree data structure comprises creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, and maintaining only one incoming pointer for each of the nodes in the tree data structure at all times. A tree data structure in which each node in the tree data structure has a single incoming pointer, and in which the tree data structure comprises a pointer directed to a local overflow node from a node at the same hierarchical level as the local overflow node.

Abstract: A method for loading information into a tree structured database includes receiving a document and forming a top-down tree characterizing the document. Leaf nodes in the top-down tree are identified. Bottom-up indices are formed for the leaf nodes, where the bottom-up indices characterizes paths from selected leaf nodes to a root node of the top-down tree. The top-down tree and bottom-up indices are stored as separately searchable entities in the tree structured database.

Abstract: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during, migration.

Abstract: A method for inserting a file in a search tree (B-tree) implemented on a file system, includes: (a) in response to a current node being a root node or an internal node, determining a child node; (b) repeating (a) until a leaf node is detected; (c) in response to a number of leaf nodes at a level of the leaf node exceeding an upper limit of files or a number of child nodes of a current node exceeding an upper limit of sub-directories, balancing the level of the leaf node or child nodes; and (d) inserting the file at the level of the leaf node.

Abstract: Methods, apparatuses, and computer program products are provided for an address system to identify a field and/or a row in a data structure. A method may include receiving a request to modify a field of data, wherein the field of data is identified by a received field key. A method may also include determining whether the field of data was rendered for display. A method may also include modifying the field in a tree structure in an instance in which the field of data was rendered for display, wherein the received field key is configured locate an address object that is related to the field. A method may also include modifying the field of data in a tree structure in an instance in which the field of data was not rendered for display by locating the received field key in a field key lookup map, wherein the field key lookup map is configured to locate the address object.

Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.

Abstract: Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory.

Abstract: A large-scale data processing system, a large-scale data processing method, and a non-transitory tangible machine-readable medium are provided. The large-scale data processing system comprises an interface and a processor. The interface accesses a multi-dimensional data model, wherein the multi-dimensional data model comprises a plurality of dimensions, the dimensions form a multi-dimensional space of measures, each dimension is a single space comprising a plurality of members with a common set of attributes, and each measure is a data element organized and accessible through the multi-dimensional space of the cross-product of all dimensions. The processor builds at least one Tree Object (TO), wherein the TO is derived by converting the multi-dimensional data model into an N-level tree data structure according to a level order of N attributes, each tree node in the TO meets all conditions of attributes for all ancestor nodes, and N is a positive integer.

Abstract: A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point.

Abstract: An example method includes identifying instances of a search term in a source text, and identifying prefix strings and suffix strings comprising tokens preceding and subsequent to the search term in the source text. The method further includes displaying a visualization interface that includes the search term within a combined tree diagram that includes a prefix tree and a suffix tree extending to either side of the search term. The prefix tree displays the prefix strings and the suffix tree displays the suffix strings, and both have user-selectable branches. The method further includes providing, in response to a user input selecting a branch in the prefix tree or in the suffix tree, a visual indication of a prefix string and a suffix string in the visualization interface that form a matching sequence that originate together in the source text, for matching sequences that are connected through the selected branch.

Abstract: In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time.

Abstract: Computation execution can be visualized and debugged. A computation such as a database query plan graph can be extracted from a database query expression. Trace points can be injected into the database query expression while preserving original behavior. Query graphs can be generated with automatic inserting of mechanisms to connect to trace points, enabling visualization of query execution lifecycle states, collection of data traces across operators, and historical debugging with replay of data sets.

Abstract: Health monitoring system comprising a patient side subsystem, a health care provider side subsystem, and a server station. The patient side subsystem is able to periodically receive and apply a monitoring profile comprising profile elements being connected to each other in a predetermined manner, the monitoring profile elements comprising patient related data, monitoring related data, evaluating process elements, wherein the monitoring profile elements are connected to each other to provide a multi-level tree structure consisting of at least two monitoring profile levels comprising a higher or top level and a lower or bottom level, wherein the monitoring profile elements are divided according to the tree structure of the multi level monitoring profile and a part of the monitoring profile elements is assigned to the top monitoring profile level and a part of the monitoring profile elements is assigned to the bottom monitoring profile level.

Abstract: A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object.

Abstract: Transaction-segregated metrics are obtained for component invocations of different transactions of an application. Corresponding tree data structures are maintained by an agent and a manager which describe sequences of invoked components of the different transactions. The start and end of each component are each represented by a node in each branch of the tree data structure. Each transaction is identified by matching a branch to a transaction trace. Gatherers are linked to one or more nodes to collect the transaction-segregated metrics. For example, metrics can be gathered separately for component invocations in different transactions. Metrics can also be gathered together for instances of different components in one or more transactions. A user interface includes a directed graph having vertices connected by edges. Edge portions are visually distinguished from one another based on the metrics of the gatherers. Each edge portion can be associated with one or more of the gatherers.