Abstract: Provided herein are systems and methods for global data objects on a data platform where the global data objects are accessible at an organization level. In particular, an organization-level global data object provided by various embodiments can be used as a generic organization object that is owned by a specific organization, and can be managed (e.g., created, deleted, or modified) by use of a leader-based model.

Abstract: Disclosed is an encoding system and associated methods for generating a graph-integrated tree-based representation of data that provides for direct lateral traversals of nodes in a each layer of the tree-based representation. The encoding system organizes data from a dataset to a tree-based representation with multiple layers and multiple nodes in each layer. The encoding system detects the nodes in each layer, and defines a graph structure that links the nodes in each layer for direct lateral access. The encoding system searches the tree-based representation in response to a query for a particular subset of the data by performing a single downward traversal to a particular layer with individual nodes that satisfy part of the query, and by laterally traversing the nodes in the particular layer using the graph structure to directly access a second node in the particular layer from a first node in the particular layer.

Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.

Abstract: One or more computing devices may comprise congestion management circuitry, one or more client file system request buffers, and DESS interface circuitry. The one or more client file system request buffers is/are operable to queue first client file system requests of a first priority level and second client file system requests of a second priority level, where the first priority level is higher priority than the second priority level. The DESS interface circuitry is operable to determine a choking level according to the load on a plurality of DESS resources. Individual load values of the DESS resources are mapped to a composite load value using a first function. The composite load value is mapped to a congestion contribution using a second function. And, the congestion contribution is mapped to a choking level using a third function.

Abstract: Techniques described herein relate to a method for managing migrations of applications. The method may include identifying, by a verification manager associated with an execution environment, an application potential migration event associated with an application; in response to identifying the application potential migration event: obtaining application configuration information associated with the application; making a determination that the application configuration information indicates the execution environment is capable of hosting the application; generating potential migration information associated with the execution environment and the application; and sending an affirmation and the potential migration information to the application.

Abstract: Provided herein are systems and methods for global data objects on a data platform where the global data objects are accessible at an organization level. In particular, an organization-level global data object provided by various embodiments can be used as a generic organization object that is owned by a specific organization, and can be managed (e.g., created, deleted, or modified) by use of a leader-based model.

Abstract: A multi-lender architecture evaluates applicant data against lending rule sets of multiple lenders. Rule sets provided by different lenders may be expressed differently. The multi-lender architecture transforms the rules in each rule set and represents the rules in a normalization grid. The normalization grid allows a single algorithm to evaluate the rules of different lenders.

Abstract: There is provided an information processor, an information processing method, and a recording medium to automatically estimate a sense of values of a community. The information processor includes a control unit that performs a control. The control unit acquires sensor data obtained by sensing a member who belongs to a specific community, and automatically estimate a sense of values of the member who belongs to the specific community, on the basis of the acquired sensor data.

Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.

Abstract: A method of maintaining an index of time-series data records held in a data store comprises identifying one or more time-series data records not currently indexed in a binary tree structure and corresponding with a time range, and creating a new leaf node. Start-time and end-time fields of the new leaf node are populated with values encompassing the time range corresponding with identified time-series data records. The binary tree structure is updated such that the new leaf node is added as a first or second child node of a parent node representing a time range encompassing the values of the start-time and end-time fields of the new leaf node. Existence of the new leaf node in the binary tree structure is thereby indicative of existence of the one or more identified time-series data records in the data store.

Abstract: The technology disclosed relates to systems and methods for device-dependent display of an article from a PDF file that has multiple articles and a table of contents to the articles. The system can use a library to render the article from the PDF file. The rendering can include bounding boxes positioned at on-page coordinates that can include one or more images and multiple text blocks of glyphs. The system can detect at least one table in the PDF file that includes pages numbers and multiple columns. The system includes logic to partition a contiguous sequence of text representing the table into text blocks of entries and columns. The system includes logic to merge multiple text blocks that align horizontally with a single page number into a single text block. Table of contents is displayed in a device-dependent format including the entries from the merged text blocks.

Abstract: Techniques are disclosed relating to tree data structures capable of storing information indicative of database keys. A computer system may operate a database. The computer system may store a multi-level tree data structure usable to perform key lookups for the database. In various cases, the multi-level tree data structure may be stored in system memory as a plurality of subtree data structures each comprising a set of linked nodes. A given one of the plurality of subtree data structures may be stored as a respective continuous block of information in system memory. The computer system may access the respective continuous block for a first particular subtree data structure encompassing a particular range of levels in the multi-level tree data structure. The accessing may be performed without accessing one or more other subtree data structures encompassing one or more levels within the particular range of levels.

Abstract: An improved data storage system and apparatus including an improved storage controller that provides storage compute functionality that enables the acceleration of datacenter software, and that enables easier deployment of application software portions onto storage devices, in a manner that supports runtime performance acceleration of network-latency-throttled applications. Mechanisms and methods are provided for server hosted applications to initiate deployment of, initiate execution of, and interoperate with a multitude of softwares on a multitude of storage devices, where these softwares execute proximate to storage contents on the storage devices.

Abstract: A system for performing digital rights protected content playing includes a computing platform having a hardware processor and a memory storing a software code. The hardware processor executes the software code to receive, from a first user, metadata identifying one or more content segment(s), determine whether the first user has a right to access the content segment(s), produce a playlist using the metadata when the first user has the right, and output the playlist to the first user and/or a second user. The hardware processor may further execute the software code to receive the playlist from the second user, determine each content segment identified by the playlist that the second user has a right to access, generate a content compilation that omits any content segment identified by the playlist to which the second user lacks the right, and playout the content compilation to the second user.

Abstract: Systems and methods described herein include receiving, at a network device, a message including an identifier associated with a subscriber and an identifier associated with a rating group associated with one or more data flows and determining a data quota and one or more usage monitoring thresholds associated with the subscriber. The data quota indicates a first amount of data associated with the rating group that the subscriber is authorized to use during a time period and the one or more usage monitoring thresholds indicate one or more second amounts of data associated with the rating group and one or more service flows that the subscriber is authorized to use during the time period. The network device transmits the data quota and the one or more usage monitoring thresholds, receives data usage information, and processes the data usage information.

Abstract: In response to receiving a flow of data, one or more operators in a parallel region included in a distributed data processing system for stream processing the flow of data are initialized. In response to identifying a change to the flow of data or a change to the distributed data processing system, at least one of the flow of data and a size of the parallel region included in the distributed data processing system are dynamically adjusted. The flow of data is processed via the dynamically adjusted one of the flow of data and the parallel region included in the distributed data processing system.

Abstract: In various embodiments, methods and systems for providing access to file systems are provided. An SFA-based operation having an operation modifier for a file in a file system is received. The SFA-based operation is defined based on a file-representational state transfer (REST) interface. The SFA-REST interface comprises integrated functionality of an SFA protocol and REST protocol. The SFA-based operation is executed using the operation modifier. A REST-based operation for the file in the distributed file storage is received. The REST-based operation is defined based on the SFA-REST interface. The operation modifier is referenced in order to execute the REST-based operation. The REST-based operation based on the SFA-REST interface. A schema can be implemented for accessing the file system. The schema includes tables to store files, the table comprises fields corresponding to elements of a SFA-REST interface. A snapshot component can be implemented to backup file shares in the file system.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices triggering a metadata recovery process within a network storage system, which include: dividing metadata into metadata segments, wherein each of the metadata segments is tasked to perform a specific file system operation function, validating each of the metadata segments during the specific file system operation function; upon failure to validate at least one of the metadata segments, triggering an automatic repair process while maintaining the operation function tasked to the metadata segment, and upon finalizing the automatic repair process, resuming the specific file system operation function tasked to the metadata segment.

Abstract: Implementations are described for selectively publishing an event responsive to an operation on a database in a transaction. Publishing the event is delayed or not delayed respectively, responsive to determining that a value of an attribute for the event indicates that publishing the event is to be delayed, or not to be delayed, until the transaction is rolled back or committed. If publishing the event is delayed, the event is published if the transaction is committed and discarded if the transaction is rolled back. If publishing the event is not delayed, the event is published. Optionally, if the event is published, the event is published in a database or a datastore respectively, responsive to determining whether another value of another attribute for the event indicates that the event is to be published in a database or a datastore.

Abstract: Generating unique document identifiers from content within a selected page region is disclosed. A selection of a first region within a first page of the documents is received from a user, and is defined by a set of first boundaries relative to the first page. A text string of a first base selection page content within the first region is retrieved from the first page. Then the retrieved text string is assigned to a page location index associated with the first page. A text string of a first replicated selection page content is retrieved from a second page. The first replicated selection page content is included in the same first region defined by the set of first boundaries relative to the second page. The retrieved text string of the first replicated selection page content is assigned to a page location index of the second page.

Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

Abstract: Provided are a data archiving method and apparatus capable of providing a remote near-line data archiving function by receiving remote function invoking from a target system in which data is stored, providing the target system with a first function for archiving, in a storage system, at least some of the data stored in the target system over a network in response to the remote function invoking, and providing the target system with a second function for the query of the data archived in the storage system over the network.

Abstract: A system and method allows a matching system to mediate requests for information among different computer systems without storing information that can be used to log into those computer systems.

Abstract: A method includes executing an instruction to execute a query for a data block, the data block associated with a corresponding memory level of a logarithmic number of memory levels (li) of memory, each memory level (li) including physical memory (RAMi) residing on memory hardware of a distributed system. The method also includes retrieving a value associated with the data block from an oblivious hash table using a corresponding key, and extracting un-queried key value pairs from the oblivious hash table associated with un-queried data blocks after executing a threshold number of queries for data blocks. The method also includes a multi-array shuffle routine on the extracted key value pairs from the oblivious hash table to generate an output array containing the un-queried key value pairs.

Abstract: A computer-implemented method and system for arranging, in an ordered hierarchy, attached files as transferred during a discourse history. The computer implemented method includes accessing discourse data associated with a history of discourse communications. In embodiments, the discourse data includes a plurality of discourse attachments transferred in accordance with the history, and the discourse attachments include multiple versions of at least one discourse attachment within the plurality. The method further includes deriving a discourse attachment arrangement (DAA) component based at least in part on the discourse data. The method includes outputting, based at least in part on the DAA component, the multiple versions of the at least one discourse attachment arranged in a hierarchical order.

Abstract: The present invention relates to a computer-implemented method for the signed registration of a file, preferably a PDF-based document, by a user in a blockchain, said method comprising the steps of: (a) receiving said file from said user; (b) processing said file and calculating a hash for said file, said step (b) comprising the sub-steps (b.i) processing said file by creating and/or revising a file identifier comprised in said file so that it is unique with respect to the blockchain, obtaining a uniquely identified file; (b.ii) calculating the hash of said uniquely identified file comprising said file identifier with a cryptographic hash function; (b.iii) optionally, determining if the hash obtained in step (b.ii) is unique with respect to the blockchain and if so, ending step (b); if not, resuming from step (b.i); (c) establishing a file reference taking into account said hash; and (d) registering said file reference in the blockchain.

Abstract: An embodiment involves persistent storage and one or more processors. The persistent storage may contain a plurality of hardware models specifying types of computing devices, wherein the hardware models include attributes representing manufacturer names, product names, and model numbers of the computing devices. The processors may be configured to: obtain, from the persistent storage, a hardware model; calculate a hash value over attributes of the hardware model; compare the hash value to hash values in a curated list, the curated list including normalized hardware models that map the hash values to normalized manufacturer names, normalized product names, or normalized model numbers; determine that the hash value matches a particular hash value for a normalized hardware model; and update, in the persistent storage, the hardware model to include at least one of a normalized manufacturer name, a normalized product name, or a normalized model number associated with the normalized hardware model.

Abstract: Disclosed are various examples for remotely managing passwords using local security policies. A client device can be enrolled with a management service. The management service then transmits a password policy requiring a password hint to be defined by the user. A management component executed on the client device can then enforce the password policy by requiring a user to define a password hint in order to access enterprise resources.

Abstract: A system and method allows a matching system to mediate requests for information among different computer systems without storing information that can be used to log into those computer systems.

Abstract: A document management apparatus provides an electronic document management service for managing electronic documents by storing the electronic documents in plural folders. The document management apparatus includes a processor configured to cause a learner to learn such that the learner specifies a folder in which an electronic document is stored, based on content of the electronic document stored in the folder and a service attribute assigned to the electronic document by the electronic document management service, and specify a storage destination folder in which a new electronic document is to be stored, based on content of the new electronic document and a service attribute of the new electronic document.

Abstract: Provided is an edit unit that checks, as time data, a designated time received in an input unit, against a map data DB to identify map data corresponding to the designated time. Upon the receipt of the designated time in the input unit, a map-data generating unit redoes the update of the map data, identified by the edit unit, using measurement data newly acquired after the designated time is received in the input unit.

Abstract: Techniques are described herein that are capable of selecting checkpoints of a database job. For instance, at compile time, temporal indicators associated with the query plans of the database job are determined. Each temporal indicator indicates first and second subsets of stages of the respective query plan. Values of attributes of each stage in at least each first subset are predicted using a machine learning technique. At the compile time, candidate stage(s) for each query plan are identified based on the respective candidate stage being a child of stage(s) in the corresponding second subset or not being a child of another stage in the respective query plan. The candidate stage(s) for each query plan are selectively chosen as respective checkpoint(s) based on whether the values of the attributes of each stage in at least the first subset of the stages of the respective query plan satisfy one or more criteria.

Abstract: The described technology is generally directed towards distributing data fragments and coding fragments of a protection group among storage entities (e.g., nodes or disks) based on affinity levels (e.g., maintained in an affinity matrix) that represent dependency relationships between the storage entities with respect to storing protection groups. The technology operates to distribute a protection group's components such that the affinity level between any pair of storage entities is approximately the same as any other pair. In the event of a storage entity failure, as a result of the affinity-based distribution of the protection group components needed for data recovery, a larger number of the other storage entities can be involved in the data recovery (relative to the number likely involved without affinity-based distribution). This tends to assure a better load balance and faster data recovery.

Abstract: Techniques provide for Redundant Array of Independent Disks RAID type conversion. Such techniques involve: determining, based on a type of the target RAID, a plurality of storage spaces from a plurality of available storage disks for forming the target RAID; copying data from a first storage block of a source RAID to a corresponding second storage block in the plurality of storage spaces, wherein a first logical block address of the first storage block in the source RAID is identical to a second logical block address of the second storage block in the target RAID; determining at least one address reference associated with the first storage block; and updating the at least one address reference to point to the second storage block.

Abstract: A storage system is provided. The storage system includes a backplane; a plurality of single port storage devices; and a plurality of controllers, wherein the backplane routes a plurality of interconnection lanes between the plurality of controllers and the plurality of single port storage devices, wherein the plurality of controllers is configured to: enable at least one second interconnection lane of the plurality of interconnection lanes when a first controller of the plurality of controllers has failed, wherein a first interconnection lane of the plurality of interconnection lanes is between the first controller and a first single port storage device of the plurality of single port storage devices, wherein the at least one second interconnection lane is between a second controller of the plurality of controllers and the first single port storage device.

Abstract: Disclosed herein are systems and method for disaster recovery using application streaming. In one aspect, a method includes generating a backup image of a computing system having at least one installed application and user data. The generating involves including the user data in the backup image and actively excluding program data files of the at least one installed application from the backup image. The method includes determining an application package specifying the installed application. The application package is stored at an application streaming service. Responsive to detecting a disaster recovery event, the method further includes copying the user data from the backup image to a recovery computing instance, and executing, on the recovery computing instance, a remote application from the application streaming service based on the determined application package.

Abstract: Systems, methods, and other embodiments associated with distributed primary identifier management in a multi-master database system are described. One embodiment includes: Receiving a request to add a new master node to a multi-master database environment. Retrieving the next available master node number from a master node counter for the database environment. Generating a numeric base for primary identifiers of data objects of the new master node by deriving high order bits of the numeric base from the retrieved master node number. Configuring the new master node to assign the next unassigned number in a sequence of numbers beginning with the numeric base as the primary identifier for each data object created by the new master node. Add the new master node to the database environment. In one embodiment, the numeric base is generated by replacing the leading bits of the primary identifier range with the reversed the binary equivalent of the node number of the new master node.

Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving, by a computer, a data access request; sending, by the computer, a recall request to a remote storage location for data which corresponds to the data access request; and receiving, by the computer, a copy of an existing object which includes blocks. The data which corresponds to the data access request is stored in at least one of the blocks. The data access request is satisfied, by the computer, by providing the copy of the existing object. Moreover, a sparse object, which only includes ones of the blocks which contain data that has been modified, is received by the computer. The sparse object is sent, by the computer, to the remote storage location; and one or more instructions to use the blocks included in the sparse object to update the existing object are also sent by the computer.

Abstract: One embodiment facilitates thin-provisioning in a distributed storage system. During operation, the system receives, by a first network switch, data to be written to a storage component of the first network switch. The system writes, by the first network switch, the data to the storage component. The system performs, by an integrated circuit residing on the first network switch, a data reduction process which reduces a size of the data to obtain reduced data. The system encodes, by the integrated circuit, the reduced data based on an encoding mechanism to obtain encoded data, wherein the encoded data can be written to non-volatile memory of one or more storage devices.

Abstract: Systems and methods for performing a recovery operation for a host. A user interface is displayed and a recovery operation is configured. During configuration of the recovery operation, the source of the backup for the recovery operation can be selected by a user. The recovery operation is performed based on the user-selected backup.

Abstract: A method and system for a distributing and computing platform are provided that generates a mapping between each of a plurality of applications and a plurality of application storage formats, wherein each application has a mapping to at least one application storage format; stores the mapping of the application and the application storage format in the name node; obtains a data node storage format information for each of the plurality of data nodes; stores the data node storage format information for each of the plurality of data nodes in the name node; and stores data generated by at least one of the plurality of applications in at least one data node based on the mapping information stored in the name node. Through the above embodiment, the distributing and computing platform may store the data in the data node with the storage format which is proper for the application.

Abstract: A distributed system is adapted to manage the performance of distributed processes. In one aspect, multiple stripes associated with a data item are stored in a distributed storage. The stored stripes may include one or more stripes of redundancy information for the data item. The stored stripes may include one or more copies of stripes for the data item. A distributed process including at least one task is performed. During performance of the distributed process, a determination is made as to whether to perform an accelerated data retrieval operation. Responsive to a determination to perform an accelerated data retrieval operation, at more than the minimal number stripes information required to reconstruct the data item is requested from the distributed storage. After a sufficient subset of stripes associated with the data item is received, the data item is reconstructed using the subset.

Abstract: A technique for managing metadata in a data storage system includes receiving a set of data to be stored in a file system of the data storage system and calculating values of metadata blocks that the file system will use to organize the set of data in the file system. The technique aggregates values of the metadata blocks and sends them in a single, atomic transaction to a persistent cache. The transaction either succeeds, in which case the persistent cache stores the values of all of the metadata blocks, or it fails, in which case the persistent cache stores none of the values of the metadata blocks. Over time, the persistent cache flushes the values of the metadata blocks to a set of non-volatile storage devices that back the metadata blocks in the data storage system.

Abstract: A digital camera processing system with software to manage taking photos with a digital camera. Camera software controls the digital camera. A downloaded software component controls the digital camera software and causes a handheld mobile device to perform operations. The operations may include instructing a user to have the digital camera take photos of a check; displaying an instruction on a display of the handheld mobile device to assist the user in having the digital camera take the photos; or assisting the user as to an orientation for taking the photos with the digital camera. The digital camera processing system may generate a log file including a bi-tonal image formatted as a TIFF image.

Abstract: Systems and methods are provided for managing states of deployment. A presence of a configuration change to be implemented at a deployment may be detected. The configuration change may include one or more commands to change a configuration of the deployment. Responsive to detecting the presence of the configuration change, information describing the configuration change may be stored in a repository. The information may be stored in an unsubstituted form and a substituted form. An interface through which configuration change information is accessible may be provided. The configuration change information may describe the configuration change at the deployment based on one or both of the unsubstituted form and the substituted form.

Abstract: Techniques involve writing to a disk array. In response to a request for writing target data to a target storage area in a stripe of the disk array including at least one failed storage area, it is determined whether incompletion of the writing of the target data is to cause failed data in the at least one failed storage area to be unrecoverable. In response to determining that the incompletion of the writing is to cause failed data to be unrecoverable, the failed data is recovered. The recovered data is stored in a persistent memory, and the target data is written in the target storage area. In this way, the efficiency and performance of writing processing of the disk array having a failed disk is increased significantly.

Abstract: In a case where a designation of a first index and a second index is received, two folders having a hierarchical structure corresponding to the first index and second index are generated in response to a request to generate.

Abstract: Communication fabric-coupled computing architectures, platforms, and systems are provided herein. In one example, an apparatus includes a management entity configured to establish compute units each comprising components selected among a plurality of physical computing components. The apparatus includes a fabric interface configured to instruct a communication fabric communicatively coupling the plurality of physical computing components to establish logical isolation within the communication fabric to form the compute units.

Abstract: Generating unique document identifiers from content within a selected page region is disclosed. A selection of a first region within a first page of the documents is received from a user, and is defined by a set of first boundaries relative to the first page. A text string of a first base selection page content within the first region is retrieved from the first page. Then the retrieved text string is assigned to a page location index associated with the first page. A text string of a first replicated selection page content is retrieved from a second page. The first replicated selection page content is included in the same first region defined by the set of first boundaries relative to the second page. The retrieved text string of the first replicated selection page content is assigned to a page location index of the second page.